/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-fb4f59a-m [2022-04-28 10:03:20,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:03:20,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:03:20,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:03:20,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:03:20,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:03:20,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:03:20,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:03:20,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:03:20,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:03:20,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:03:20,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:03:20,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:03:20,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:03:20,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:03:20,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:03:20,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:03:20,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:03:20,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:03:20,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:03:20,661 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:03:20,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:03:20,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:03:20,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:03:20,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:03:20,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:03:20,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:03:20,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:03:20,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:03:20,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:03:20,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:03:20,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:03:20,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:03:20,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:03:20,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:03:20,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:03:20,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:03:20,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:03:20,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:03:20,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:03:20,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:03:20,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:03:20,676 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:03:20,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:03:20,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:03:20,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:03:20,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:03:20,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:03:20,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:03:20,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:03:20,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:03:20,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:03:20,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:03:20,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:03:20,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:03:20,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:03:20,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:03:20,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:03:20,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:03:20,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:03:20,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:03:20,693 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:03:20,693 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:03:20,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:03:20,693 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:03:20,694 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:03:20,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:03:20,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:03:20,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:03:20,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:03:20,890 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:03:20,891 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-28 10:03:20,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9d474ca/dbb9e4f34328470ba71e2e9268289000/FLAGa942579d9 [2022-04-28 10:03:21,269 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:03:21,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-28 10:03:21,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9d474ca/dbb9e4f34328470ba71e2e9268289000/FLAGa942579d9 [2022-04-28 10:03:21,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9d474ca/dbb9e4f34328470ba71e2e9268289000 [2022-04-28 10:03:21,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:03:21,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:03:21,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:03:21,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:03:21,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:03:21,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:03:21" (1/1) ... [2022-04-28 10:03:21,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37faaf36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21, skipping insertion in model container [2022-04-28 10:03:21,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:03:21" (1/1) ... [2022-04-28 10:03:21,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:03:21,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:03:21,861 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-28 10:03:21,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:03:21,878 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:03:21,888 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-28 10:03:21,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:03:21,902 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:03:21,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21 WrapperNode [2022-04-28 10:03:21,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:03:21,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:03:21,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:03:21,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:03:21,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21" (1/1) ... [2022-04-28 10:03:21,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21" (1/1) ... [2022-04-28 10:03:21,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21" (1/1) ... [2022-04-28 10:03:21,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21" (1/1) ... [2022-04-28 10:03:21,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21" (1/1) ... [2022-04-28 10:03:21,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21" (1/1) ... [2022-04-28 10:03:21,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21" (1/1) ... [2022-04-28 10:03:21,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:03:21,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:03:21,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:03:21,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:03:21,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21" (1/1) ... [2022-04-28 10:03:21,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:03:21,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:21,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:03:21,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:03:21,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:03:21,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:03:21,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:03:21,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:03:21,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:03:21,996 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:03:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:03:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:03:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:03:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:03:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:03:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:03:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:03:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:03:21,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:03:21,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:03:21,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:03:21,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:03:22,040 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:03:22,041 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:03:22,135 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:03:22,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:03:22,141 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 10:03:22,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:03:22 BoogieIcfgContainer [2022-04-28 10:03:22,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:03:22,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:03:22,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:03:22,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:03:22,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:03:21" (1/3) ... [2022-04-28 10:03:22,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326c278a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:03:22, skipping insertion in model container [2022-04-28 10:03:22,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:21" (2/3) ... [2022-04-28 10:03:22,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326c278a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:03:22, skipping insertion in model container [2022-04-28 10:03:22,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:03:22" (3/3) ... [2022-04-28 10:03:22,153 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de20.c [2022-04-28 10:03:22,165 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:03:22,166 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:03:22,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:03:22,208 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b2ed1ea, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a245a9b [2022-04-28 10:03:22,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:03:22,215 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-28 10:03:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 10:03:22,220 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:22,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:22,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 1 times [2022-04-28 10:03:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:22,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1559541218] [2022-04-28 10:03:22,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:03:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 2 times [2022-04-28 10:03:22,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:22,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766416943] [2022-04-28 10:03:22,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:22,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:22,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:22,707 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-28 10:03:22,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 10:03:22,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-28 10:03:22,710 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-28 10:03:22,711 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-28 10:03:22,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 10:03:22,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-28 10:03:22,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret9 := main(); {24#true} is VALID [2022-04-28 10:03:22,712 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-28 10:03:22,713 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-28 10:03:22,714 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-28 10:03:22,715 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-28 10:03:22,717 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-28 10:03:22,718 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-28 10:03:22,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-28 10:03:22,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 10:03:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:22,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766416943] [2022-04-28 10:03:22,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766416943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:22,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:22,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:03:22,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:22,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1559541218] [2022-04-28 10:03:22,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1559541218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:22,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:22,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:03:22,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647938306] [2022-04-28 10:03:22,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:22,734 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-28 10:03:22,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:22,739 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-28 10:03:22,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:22,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:03:22,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:22,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:03:22,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:03:22,784 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-28 10:03:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:23,095 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-28 10:03:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:03:23,095 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-28 10:03:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:23,097 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-28 10:03:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-28 10:03:23,104 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-28 10:03:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-28 10:03:23,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-28 10:03:23,165 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-28 10:03:23,172 INFO L225 Difference]: With dead ends: 46 [2022-04-28 10:03:23,173 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:03:23,176 INFO L412 NwaCegarLoop]: 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-28 10:03:23,181 INFO L413 NwaCegarLoop]: 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-28 10:03:23,182 INFO L414 NwaCegarLoop]: 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-28 10:03:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:03:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:03:23,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:23,210 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-28 10:03:23,211 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-28 10:03:23,211 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-28 10:03:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:23,215 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:03:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:03:23,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:23,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:23,215 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-28 10:03:23,216 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-28 10:03:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:23,218 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:03:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:03:23,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:23,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:23,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:23,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:23,219 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-28 10:03:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 10:03:23,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-28 10:03:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:23,222 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 10:03:23,223 INFO L496 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-28 10:03:23,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 10:03:23,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:03:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:03:23,250 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:23,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:23,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:03:23,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 1 times [2022-04-28 10:03:23,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:23,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566043769] [2022-04-28 10:03:23,264 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:23,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 2 times [2022-04-28 10:03:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:23,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493532316] [2022-04-28 10:03:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:23,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:23,347 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-28 10:03:23,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-28 10:03:23,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #50#return; {203#true} is VALID [2022-04-28 10:03:23,349 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-28 10:03:23,349 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-28 10:03:23,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-28 10:03:23,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #50#return; {203#true} is VALID [2022-04-28 10:03:23,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret9 := main(); {203#true} is VALID [2022-04-28 10:03:23,350 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-28 10:03:23,351 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-28 10:03:23,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(= main_~y~0 0)} ~z~0 := ~y~0; {209#(= main_~z~0 0)} is VALID [2022-04-28 10:03:23,352 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-28 10:03:23,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#false} assume !(~z~0 % 4294967296 > 0); {204#false} is VALID [2022-04-28 10:03:23,352 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-28 10:03:23,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#false} ~cond := #in~cond; {204#false} is VALID [2022-04-28 10:03:23,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#false} assume 0 == ~cond; {204#false} is VALID [2022-04-28 10:03:23,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-28 10:03:23,353 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-28 10:03:23,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:23,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493532316] [2022-04-28 10:03:23,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493532316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:23,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:23,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:03:23,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:23,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566043769] [2022-04-28 10:03:23,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566043769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:23,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:23,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:03:23,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130540341] [2022-04-28 10:03:23,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:23,358 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-28 10:03:23,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:23,358 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-28 10:03:23,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:23,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:03:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:23,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:03:23,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:03:23,372 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-28 10:03:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:23,474 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 10:03:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:03:23,474 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-28 10:03:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:23,475 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-28 10:03:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 10:03:23,480 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-28 10:03:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 10:03:23,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-28 10:03:23,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:23,507 INFO L225 Difference]: With dead ends: 23 [2022-04-28 10:03:23,507 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 10:03:23,508 INFO L412 NwaCegarLoop]: 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-28 10:03:23,510 INFO L413 NwaCegarLoop]: 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-28 10:03:23,511 INFO L414 NwaCegarLoop]: 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-28 10:03:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 10:03:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 10:03:23,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:23,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:23,521 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:23,521 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:23,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:23,522 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 10:03:23,522 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:03:23,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:23,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:23,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:03:23,523 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:03:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:23,525 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 10:03:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:03:23,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:23,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:23,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:23,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 10:03:23,527 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-04-28 10:03:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:23,528 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 10:03:23,528 INFO L496 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-28 10:03:23,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 10:03:23,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:03:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:03:23,543 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:23,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:23,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:03:23,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:23,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:23,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 1 times [2022-04-28 10:03:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:23,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1435046896] [2022-04-28 10:03:23,557 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:23,557 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:23,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 2 times [2022-04-28 10:03:23,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:23,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037860026] [2022-04-28 10:03:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:23,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:23,662 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-28 10:03:23,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#true} assume true; {323#true} is VALID [2022-04-28 10:03:23,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {323#true} {323#true} #50#return; {323#true} is VALID [2022-04-28 10:03:23,663 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-28 10:03:23,664 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-28 10:03:23,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2022-04-28 10:03:23,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #50#return; {323#true} is VALID [2022-04-28 10:03:23,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret9 := main(); {323#true} is VALID [2022-04-28 10:03:23,667 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-28 10:03:23,671 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-28 10:03:23,672 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-28 10:03:23,673 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-28 10:03:23,673 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-28 10:03:23,674 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-28 10:03:23,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-28 10:03:23,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-28 10:03:23,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-28 10:03:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:23,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:23,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037860026] [2022-04-28 10:03:23,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037860026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:23,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461320340] [2022-04-28 10:03:23,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:23,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:23,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:23,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:23,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:03:23,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:23,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:23,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:03:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:23,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:23,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-28 10:03:23,967 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-28 10:03:23,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2022-04-28 10:03:23,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #50#return; {323#true} is VALID [2022-04-28 10:03:23,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret9 := main(); {323#true} is VALID [2022-04-28 10:03:23,968 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-28 10:03:23,968 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-28 10:03:23,969 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-28 10:03:23,970 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-28 10:03:23,970 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-28 10:03:23,970 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-28 10:03:23,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-28 10:03:23,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-28 10:03:23,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-28 10:03:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:23,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:24,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-28 10:03:24,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-28 10:03:24,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-28 10:03:24,046 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-28 10:03:24,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {324#false} is VALID [2022-04-28 10:03:24,047 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-28 10:03:24,048 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-28 10:03:24,049 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-28 10:03:24,049 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-28 10:03:24,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret9 := main(); {323#true} is VALID [2022-04-28 10:03:24,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #50#return; {323#true} is VALID [2022-04-28 10:03:24,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2022-04-28 10:03:24,050 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-28 10:03:24,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-28 10:03:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:24,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461320340] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:24,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:24,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:03:24,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1435046896] [2022-04-28 10:03:24,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1435046896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:24,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:24,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:03:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900260378] [2022-04-28 10:03:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:24,052 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-28 10:03:24,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:24,053 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-28 10:03:24,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:24,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:03:24,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:03:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:03:24,066 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-28 10:03:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:24,214 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 10:03:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:03:24,214 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-28 10:03:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:24,215 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-28 10:03:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-28 10:03:24,216 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-28 10:03:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-28 10:03:24,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-28 10:03:24,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:24,247 INFO L225 Difference]: With dead ends: 25 [2022-04-28 10:03:24,247 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 10:03:24,248 INFO L412 NwaCegarLoop]: 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-28 10:03:24,249 INFO L413 NwaCegarLoop]: 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-28 10:03:24,249 INFO L414 NwaCegarLoop]: 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-28 10:03:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 10:03:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-28 10:03:24,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:24,262 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-28 10:03:24,263 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-28 10:03:24,263 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-28 10:03:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:24,265 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 10:03:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 10:03:24,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:24,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:24,265 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-28 10:03:24,266 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-28 10:03:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:24,270 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 10:03:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 10:03:24,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:24,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:24,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:24,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:24,271 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-28 10:03:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 10:03:24,272 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-04-28 10:03:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:24,273 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 10:03:24,273 INFO L496 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-28 10:03:24,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 10:03:24,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 10:03:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:03:24,296 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:24,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:24,323 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-28 10:03:24,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:24,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 1 times [2022-04-28 10:03:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:24,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146975170] [2022-04-28 10:03:24,524 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:24,524 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 2 times [2022-04-28 10:03:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:24,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129588188] [2022-04-28 10:03:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:24,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:24,689 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-28 10:03:24,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 10:03:24,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {551#true} {551#true} #50#return; {551#true} is VALID [2022-04-28 10:03:24,690 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-28 10:03:24,690 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-28 10:03:24,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 10:03:24,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #50#return; {551#true} is VALID [2022-04-28 10:03:24,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret9 := main(); {551#true} is VALID [2022-04-28 10:03:24,691 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-28 10:03:24,692 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-28 10:03:24,692 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-28 10:03:24,693 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-28 10:03:24,694 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-28 10:03:24,695 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-28 10:03:24,696 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-28 10:03:24,696 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-28 10:03:24,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {560#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {552#false} is VALID [2022-04-28 10:03:24,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-28 10:03:24,697 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-28 10:03:24,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:24,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129588188] [2022-04-28 10:03:24,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129588188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:24,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875353570] [2022-04-28 10:03:24,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:24,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:24,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:24,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:24,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:03:24,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:24,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:24,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:03:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:24,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:24,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {551#true} is VALID [2022-04-28 10:03:24,875 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-28 10:03:24,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 10:03:24,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #50#return; {551#true} is VALID [2022-04-28 10:03:24,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret9 := main(); {551#true} is VALID [2022-04-28 10:03:24,876 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-28 10:03:24,877 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-28 10:03:24,880 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-28 10:03:24,880 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-28 10:03:24,881 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-28 10:03:24,882 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-28 10:03:24,883 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-28 10:03:24,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:03:24,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {552#false} is VALID [2022-04-28 10:03:24,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-28 10:03:24,885 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-28 10:03:24,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:25,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-28 10:03:25,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {552#false} is VALID [2022-04-28 10:03:25,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:03:25,033 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-28 10:03:25,034 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-28 10:03:25,039 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-28 10:03:25,040 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-28 10:03:25,041 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-28 10:03:25,042 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-28 10:03:25,051 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-28 10:03:25,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret9 := main(); {551#true} is VALID [2022-04-28 10:03:25,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #50#return; {551#true} is VALID [2022-04-28 10:03:25,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 10:03:25,051 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-28 10:03:25,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {551#true} is VALID [2022-04-28 10:03:25,052 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-28 10:03:25,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875353570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:25,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:25,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-04-28 10:03:25,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:25,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146975170] [2022-04-28 10:03:25,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146975170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:25,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:25,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:03:25,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26420826] [2022-04-28 10:03:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:25,053 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-28 10:03:25,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:25,054 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-28 10:03:25,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:25,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:03:25,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:25,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:03:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:03:25,070 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-28 10:03:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:25,303 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 10:03:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:03:25,304 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-28 10:03:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:25,304 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-28 10:03:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-28 10:03:25,305 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-28 10:03:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-28 10:03:25,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-04-28 10:03:25,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:25,336 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:03:25,336 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:03:25,336 INFO L412 NwaCegarLoop]: 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-28 10:03:25,337 INFO L413 NwaCegarLoop]: 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-28 10:03:25,337 INFO L414 NwaCegarLoop]: 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-28 10:03:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:03:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 10:03:25,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:25,360 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-28 10:03:25,360 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-28 10:03:25,360 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-28 10:03:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:25,361 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 10:03:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 10:03:25,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:25,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:25,362 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-28 10:03:25,362 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-28 10:03:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:25,363 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 10:03:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 10:03:25,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:25,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:25,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:25,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:25,364 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-28 10:03:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 10:03:25,365 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-28 10:03:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:25,365 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 10:03:25,365 INFO L496 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-28 10:03:25,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 10:03:25,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 10:03:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:03:25,401 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:25,401 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:25,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:03:25,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 10:03:25,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash 507290039, now seen corresponding path program 3 times [2022-04-28 10:03:25,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:25,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [586912869] [2022-04-28 10:03:25,611 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:25,611 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:25,611 INFO L85 PathProgramCache]: Analyzing trace with hash 507290039, now seen corresponding path program 4 times [2022-04-28 10:03:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:25,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729056249] [2022-04-28 10:03:25,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:25,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:25,685 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-28 10:03:25,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#true} assume true; {787#true} is VALID [2022-04-28 10:03:25,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {787#true} {787#true} #50#return; {787#true} is VALID [2022-04-28 10:03:25,686 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-28 10:03:25,686 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-28 10:03:25,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} assume true; {787#true} is VALID [2022-04-28 10:03:25,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} #50#return; {787#true} is VALID [2022-04-28 10:03:25,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} call #t~ret9 := main(); {787#true} is VALID [2022-04-28 10:03:25,687 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-28 10:03:25,687 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-28 10:03:25,688 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-28 10:03:25,689 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-28 10:03:25,689 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-28 10:03:25,690 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-28 10:03:25,690 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-28 10:03:25,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#false} ~cond := #in~cond; {788#false} is VALID [2022-04-28 10:03:25,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#false} assume 0 == ~cond; {788#false} is VALID [2022-04-28 10:03:25,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#false} assume !false; {788#false} is VALID [2022-04-28 10:03:25,690 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-28 10:03:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:25,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729056249] [2022-04-28 10:03:25,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729056249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:25,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575923304] [2022-04-28 10:03:25,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:25,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:25,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:25,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:25,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 10:03:25,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:25,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:25,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:03:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:25,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:25,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {787#true} call ULTIMATE.init(); {787#true} is VALID [2022-04-28 10:03:25,947 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-28 10:03:25,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} assume true; {787#true} is VALID [2022-04-28 10:03:25,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} #50#return; {787#true} is VALID [2022-04-28 10:03:25,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} call #t~ret9 := main(); {787#true} is VALID [2022-04-28 10:03:25,947 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-28 10:03:25,948 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-28 10:03:25,949 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-28 10:03:25,949 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-28 10:03:25,950 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-28 10:03:25,950 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-28 10:03:25,951 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-28 10:03:25,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#false} ~cond := #in~cond; {788#false} is VALID [2022-04-28 10:03:25,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#false} assume 0 == ~cond; {788#false} is VALID [2022-04-28 10:03:25,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#false} assume !false; {788#false} is VALID [2022-04-28 10:03:25,951 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-28 10:03:25,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:26,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#false} assume !false; {788#false} is VALID [2022-04-28 10:03:26,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#false} assume 0 == ~cond; {788#false} is VALID [2022-04-28 10:03:26,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#false} ~cond := #in~cond; {788#false} is VALID [2022-04-28 10:03:26,060 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-28 10:03:26,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {855#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {788#false} is VALID [2022-04-28 10:03:26,061 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-28 10:03:26,062 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-28 10:03:26,063 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-28 10:03:26,064 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-28 10:03:26,064 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-28 10:03:26,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} call #t~ret9 := main(); {787#true} is VALID [2022-04-28 10:03:26,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} #50#return; {787#true} is VALID [2022-04-28 10:03:26,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} assume true; {787#true} is VALID [2022-04-28 10:03:26,066 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-28 10:03:26,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {787#true} call ULTIMATE.init(); {787#true} is VALID [2022-04-28 10:03:26,066 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-28 10:03:26,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575923304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:26,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:26,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 10:03:26,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:26,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [586912869] [2022-04-28 10:03:26,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [586912869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:26,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:26,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:03:26,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900952712] [2022-04-28 10:03:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:26,068 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-28 10:03:26,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:26,068 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-28 10:03:26,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:26,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:03:26,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:26,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:03:26,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:03:26,089 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-28 10:03:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:26,346 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 10:03:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:03:26,346 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-28 10:03:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:26,347 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-28 10:03:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 10:03:26,349 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-28 10:03:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 10:03:26,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-28 10:03:26,388 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-28 10:03:26,390 INFO L225 Difference]: With dead ends: 31 [2022-04-28 10:03:26,390 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 10:03:26,390 INFO L412 NwaCegarLoop]: 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-28 10:03:26,391 INFO L413 NwaCegarLoop]: 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-28 10:03:26,391 INFO L414 NwaCegarLoop]: 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-28 10:03:26,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 10:03:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-28 10:03:26,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:26,418 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-28 10:03:26,418 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-28 10:03:26,418 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-28 10:03:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:26,419 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 10:03:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 10:03:26,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:26,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:26,420 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-28 10:03:26,420 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-28 10:03:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:26,421 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 10:03:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 10:03:26,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:26,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:26,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:26,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:26,422 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-28 10:03:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 10:03:26,423 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-04-28 10:03:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:26,423 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 10:03:26,424 INFO L496 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-28 10:03:26,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 10:03:26,449 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-28 10:03:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 10:03:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:03:26,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:26,450 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:26,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:03:26,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:26,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -834915316, now seen corresponding path program 3 times [2022-04-28 10:03:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:26,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1435425288] [2022-04-28 10:03:26,679 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:26,679 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash -834915316, now seen corresponding path program 4 times [2022-04-28 10:03:26,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:26,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143821628] [2022-04-28 10:03:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:26,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:26,796 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-28 10:03:26,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-28 10:03:26,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1055#true} {1055#true} #50#return; {1055#true} is VALID [2022-04-28 10:03:26,797 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-28 10:03:26,797 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-28 10:03:26,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-28 10:03:26,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1055#true} {1055#true} #50#return; {1055#true} is VALID [2022-04-28 10:03:26,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {1055#true} call #t~ret9 := main(); {1055#true} is VALID [2022-04-28 10:03:26,799 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-28 10:03:26,799 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-28 10:03:26,800 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-28 10:03:26,800 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-28 10:03:26,801 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-28 10:03:26,802 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-28 10:03:26,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {1056#false} assume !(~z~0 % 4294967296 > 0); {1056#false} is VALID [2022-04-28 10:03:26,802 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-28 10:03:26,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#false} ~cond := #in~cond; {1056#false} is VALID [2022-04-28 10:03:26,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {1056#false} assume 0 == ~cond; {1056#false} is VALID [2022-04-28 10:03:26,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {1056#false} assume !false; {1056#false} is VALID [2022-04-28 10:03:26,803 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-28 10:03:26,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:26,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143821628] [2022-04-28 10:03:26,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143821628] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:26,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091101022] [2022-04-28 10:03:26,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:26,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:26,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:26,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:26,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 10:03:26,839 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:26,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:26,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:03:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:26,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:27,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {1055#true} call ULTIMATE.init(); {1055#true} is VALID [2022-04-28 10:03:27,071 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-28 10:03:27,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-28 10:03:27,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1055#true} {1055#true} #50#return; {1055#true} is VALID [2022-04-28 10:03:27,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {1055#true} call #t~ret9 := main(); {1055#true} is VALID [2022-04-28 10:03:27,072 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-28 10:03:27,073 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-28 10:03:27,073 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-28 10:03:27,074 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-28 10:03:27,075 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-28 10:03:27,075 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-28 10:03:27,076 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-28 10:03:27,076 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-28 10:03:27,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#false} ~cond := #in~cond; {1056#false} is VALID [2022-04-28 10:03:27,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {1056#false} assume 0 == ~cond; {1056#false} is VALID [2022-04-28 10:03:27,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {1056#false} assume !false; {1056#false} is VALID [2022-04-28 10:03:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:27,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:27,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {1056#false} assume !false; {1056#false} is VALID [2022-04-28 10:03:27,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {1056#false} assume 0 == ~cond; {1056#false} is VALID [2022-04-28 10:03:27,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#false} ~cond := #in~cond; {1056#false} is VALID [2022-04-28 10:03:27,214 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-28 10:03:27,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1056#false} is VALID [2022-04-28 10:03:27,215 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-28 10:03:27,216 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-28 10:03:27,217 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-28 10:03:27,217 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-28 10:03:27,218 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-28 10:03:27,218 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-28 10:03:27,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {1055#true} call #t~ret9 := main(); {1055#true} is VALID [2022-04-28 10:03:27,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1055#true} {1055#true} #50#return; {1055#true} is VALID [2022-04-28 10:03:27,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-28 10:03:27,219 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-28 10:03:27,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {1055#true} call ULTIMATE.init(); {1055#true} is VALID [2022-04-28 10:03:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:27,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091101022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:27,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:27,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-28 10:03:27,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:27,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1435425288] [2022-04-28 10:03:27,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1435425288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:27,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:27,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:03:27,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174525121] [2022-04-28 10:03:27,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:27,220 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-28 10:03:27,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:27,221 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-28 10:03:27,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:27,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:03:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:03:27,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:03:27,232 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-28 10:03:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:27,418 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 10:03:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:03:27,418 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-28 10:03:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:27,418 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-28 10:03:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 10:03:27,419 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-28 10:03:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 10:03:27,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-28 10:03:27,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:27,447 INFO L225 Difference]: With dead ends: 28 [2022-04-28 10:03:27,447 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:03:27,448 INFO L412 NwaCegarLoop]: 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-28 10:03:27,449 INFO L413 NwaCegarLoop]: 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-28 10:03:27,449 INFO L414 NwaCegarLoop]: 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-28 10:03:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:03:27,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 10:03:27,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:27,468 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-28 10:03:27,469 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-28 10:03:27,469 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-28 10:03:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:27,470 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 10:03:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 10:03:27,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:27,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:27,470 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-28 10:03:27,470 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-28 10:03:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:27,471 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 10:03:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 10:03:27,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:27,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:27,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:27,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:27,472 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-28 10:03:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 10:03:27,473 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2022-04-28 10:03:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:27,473 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 10:03:27,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:27,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 10:03:27,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 10:03:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:03:27,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:27,496 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:27,522 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-28 10:03:27,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:27,708 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1419382901, now seen corresponding path program 5 times [2022-04-28 10:03:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:27,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398592169] [2022-04-28 10:03:27,712 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:27,712 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1419382901, now seen corresponding path program 6 times [2022-04-28 10:03:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:27,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498882122] [2022-04-28 10:03:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:27,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:27,799 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-28 10:03:27,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 10:03:27,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} #50#return; {1306#true} is VALID [2022-04-28 10:03:27,800 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-28 10:03:27,800 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-28 10:03:27,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 10:03:27,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #50#return; {1306#true} is VALID [2022-04-28 10:03:27,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret9 := main(); {1306#true} is VALID [2022-04-28 10:03:27,801 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-28 10:03:27,801 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-28 10:03:27,802 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-28 10:03:27,803 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-28 10:03:27,803 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-28 10:03:27,804 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-28 10:03:27,804 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-28 10:03:27,804 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-28 10:03:27,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-28 10:03:27,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-28 10:03:27,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-28 10:03:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:27,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:27,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498882122] [2022-04-28 10:03:27,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498882122] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:27,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639306687] [2022-04-28 10:03:27,805 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:03:27,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:27,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:27,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:27,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 10:03:27,849 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 10:03:27,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:27,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:03:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:27,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:28,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-28 10:03:28,070 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-28 10:03:28,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 10:03:28,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #50#return; {1306#true} is VALID [2022-04-28 10:03:28,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret9 := main(); {1306#true} is VALID [2022-04-28 10:03:28,071 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-28 10:03:28,072 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-28 10:03:28,073 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-28 10:03:28,074 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-28 10:03:28,074 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-28 10:03:28,075 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-28 10:03:28,078 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-28 10:03:28,078 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-28 10:03:28,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-28 10:03:28,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-28 10:03:28,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-28 10:03:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:28,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:28,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-28 10:03:28,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-28 10:03:28,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-28 10:03:28,187 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-28 10:03:28,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {1378#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1307#false} is VALID [2022-04-28 10:03:28,189 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-28 10:03:28,189 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-28 10:03:28,189 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-28 10:03:28,190 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-28 10:03:28,191 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-28 10:03:28,204 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-28 10:03:28,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret9 := main(); {1306#true} is VALID [2022-04-28 10:03:28,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #50#return; {1306#true} is VALID [2022-04-28 10:03:28,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 10:03:28,204 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-28 10:03:28,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-28 10:03:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:28,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639306687] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:28,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:28,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 10:03:28,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:28,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398592169] [2022-04-28 10:03:28,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398592169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:28,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:28,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:03:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753225846] [2022-04-28 10:03:28,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:28,206 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-28 10:03:28,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:28,206 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-28 10:03:28,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:28,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:03:28,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:28,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:03:28,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:03:28,220 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-28 10:03:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:28,445 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 10:03:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:03:28,445 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-28 10:03:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:28,446 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-28 10:03:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 10:03:28,447 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-28 10:03:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 10:03:28,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-28 10:03:28,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:28,473 INFO L225 Difference]: With dead ends: 27 [2022-04-28 10:03:28,473 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 10:03:28,473 INFO L412 NwaCegarLoop]: 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-28 10:03:28,474 INFO L413 NwaCegarLoop]: 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-28 10:03:28,474 INFO L414 NwaCegarLoop]: 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-28 10:03:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 10:03:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-28 10:03:28,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:28,494 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-28 10:03:28,494 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-28 10:03:28,494 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-28 10:03:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:28,495 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 10:03:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 10:03:28,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:28,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:28,495 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-28 10:03:28,495 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-28 10:03:28,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:28,496 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 10:03:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 10:03:28,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:28,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:28,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:28,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:28,497 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-28 10:03:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-28 10:03:28,498 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2022-04-28 10:03:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:28,498 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-28 10:03:28,498 INFO L496 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-28 10:03:28,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-28 10:03:28,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 10:03:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:03:28,521 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:28,522 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:28,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 10:03:28,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:28,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:28,732 INFO L85 PathProgramCache]: Analyzing trace with hash 778520620, now seen corresponding path program 5 times [2022-04-28 10:03:28,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:28,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1320628678] [2022-04-28 10:03:28,739 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:28,739 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash 778520620, now seen corresponding path program 6 times [2022-04-28 10:03:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:28,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300778372] [2022-04-28 10:03:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:28,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:28,844 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-28 10:03:28,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 10:03:28,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1566#true} {1566#true} #50#return; {1566#true} is VALID [2022-04-28 10:03:28,845 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-28 10:03:28,845 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-28 10:03:28,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 10:03:28,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #50#return; {1566#true} is VALID [2022-04-28 10:03:28,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret9 := main(); {1566#true} is VALID [2022-04-28 10:03:28,846 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-28 10:03:28,846 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-28 10:03:28,848 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-28 10:03:28,849 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-28 10:03:28,849 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-28 10:03:28,850 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-28 10:03:28,850 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-28 10:03:28,851 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-28 10:03:28,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-28 10:03:28,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 10:03:28,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 10:03:28,851 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-28 10:03:28,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:28,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300778372] [2022-04-28 10:03:28,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300778372] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:28,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227090134] [2022-04-28 10:03:28,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:03:28,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:28,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:28,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:28,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 10:03:28,908 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:03:28,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:28,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:03:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:28,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:29,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-28 10:03:29,093 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-28 10:03:29,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 10:03:29,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #50#return; {1566#true} is VALID [2022-04-28 10:03:29,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret9 := main(); {1566#true} is VALID [2022-04-28 10:03:29,093 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-28 10:03:29,094 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-28 10:03:29,094 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-28 10:03:29,095 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-28 10:03:29,095 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-28 10:03:29,096 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-28 10:03:29,098 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-28 10:03:29,098 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-28 10:03:29,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-28 10:03:29,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 10:03:29,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 10:03:29,098 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-28 10:03:29,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:29,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 10:03:29,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 10:03:29,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-28 10:03:29,207 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-28 10:03:29,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {1638#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1567#false} is VALID [2022-04-28 10:03:29,207 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-28 10:03:29,208 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-28 10:03:29,208 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-28 10:03:29,209 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-28 10:03:29,210 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-28 10:03:29,210 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-28 10:03:29,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret9 := main(); {1566#true} is VALID [2022-04-28 10:03:29,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #50#return; {1566#true} is VALID [2022-04-28 10:03:29,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 10:03:29,211 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-28 10:03:29,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-28 10:03:29,211 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-28 10:03:29,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227090134] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:29,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:29,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 10:03:29,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:29,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1320628678] [2022-04-28 10:03:29,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1320628678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:29,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:29,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:03:29,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261657674] [2022-04-28 10:03:29,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:29,225 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-28 10:03:29,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:29,226 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-28 10:03:29,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:29,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:03:29,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:29,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:03:29,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:03:29,240 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-28 10:03:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:29,507 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 10:03:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:03:29,507 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-28 10:03:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:29,507 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-28 10:03:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 10:03:29,509 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-28 10:03:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 10:03:29,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 10:03:29,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:29,546 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:03:29,546 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 10:03:29,546 INFO L412 NwaCegarLoop]: 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-28 10:03:29,547 INFO L413 NwaCegarLoop]: 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-28 10:03:29,547 INFO L414 NwaCegarLoop]: 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-28 10:03:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 10:03:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-04-28 10:03:29,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:29,576 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-28 10:03:29,576 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-28 10:03:29,577 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-28 10:03:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:29,581 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-28 10:03:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-28 10:03:29,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:29,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:29,583 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-28 10:03:29,584 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-28 10:03:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:29,586 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-28 10:03:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-28 10:03:29,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:29,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:29,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:29,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:29,590 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-28 10:03:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-28 10:03:29,591 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2022-04-28 10:03:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:29,591 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-28 10:03:29,591 INFO L496 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-28 10:03:29,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-28 10:03:29,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 10:03:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:03:29,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:29,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:29,643 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-28 10:03:29,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:29,841 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:29,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1016701897, now seen corresponding path program 7 times [2022-04-28 10:03:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:29,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [621124892] [2022-04-28 10:03:29,848 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:29,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1016701897, now seen corresponding path program 8 times [2022-04-28 10:03:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:29,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407153956] [2022-04-28 10:03:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:29,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:29,999 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-28 10:03:29,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-04-28 10:03:29,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1850#true} {1850#true} #50#return; {1850#true} is VALID [2022-04-28 10:03:30,000 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-28 10:03:30,000 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-28 10:03:30,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-04-28 10:03:30,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #50#return; {1850#true} is VALID [2022-04-28 10:03:30,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {1850#true} call #t~ret9 := main(); {1850#true} is VALID [2022-04-28 10:03:30,001 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-28 10:03:30,002 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-28 10:03:30,003 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-28 10:03:30,003 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-28 10:03:30,004 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-28 10:03:30,004 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-28 10:03:30,005 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-28 10:03:30,005 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-28 10:03:30,006 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-28 10:03:30,007 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-28 10:03:30,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {1860#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1851#false} is VALID [2022-04-28 10:03:30,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2022-04-28 10:03:30,007 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-28 10:03:30,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:30,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407153956] [2022-04-28 10:03:30,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407153956] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:30,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452024802] [2022-04-28 10:03:30,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:30,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:30,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:30,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:30,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 10:03:30,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:30,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:30,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:03:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:30,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:30,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {1850#true} call ULTIMATE.init(); {1850#true} is VALID [2022-04-28 10:03:30,167 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-28 10:03:30,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-04-28 10:03:30,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #50#return; {1850#true} is VALID [2022-04-28 10:03:30,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {1850#true} call #t~ret9 := main(); {1850#true} is VALID [2022-04-28 10:03:30,168 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-28 10:03:30,169 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-28 10:03:30,169 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-28 10:03:30,170 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-28 10:03:30,170 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-28 10:03:30,171 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-28 10:03:30,172 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-28 10:03:30,172 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-28 10:03:30,173 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-28 10:03:30,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:03:30,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1851#false} is VALID [2022-04-28 10:03:30,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2022-04-28 10:03:30,174 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-28 10:03:30,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:30,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2022-04-28 10:03:30,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1851#false} is VALID [2022-04-28 10:03:30,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:03:30,318 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-28 10:03:30,318 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-28 10:03:30,320 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-28 10:03:30,321 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-28 10:03:30,321 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-28 10:03:30,322 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-28 10:03:30,323 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-28 10:03:30,324 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-28 10:03:30,327 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-28 10:03:30,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {1850#true} call #t~ret9 := main(); {1850#true} is VALID [2022-04-28 10:03:30,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #50#return; {1850#true} is VALID [2022-04-28 10:03:30,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-04-28 10:03:30,327 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-28 10:03:30,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {1850#true} call ULTIMATE.init(); {1850#true} is VALID [2022-04-28 10:03:30,327 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-28 10:03:30,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452024802] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:30,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:30,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-04-28 10:03:30,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:30,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [621124892] [2022-04-28 10:03:30,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [621124892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:30,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:30,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:03:30,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924398118] [2022-04-28 10:03:30,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:30,329 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-28 10:03:30,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:30,329 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-28 10:03:30,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:30,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:03:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:03:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:03:30,349 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-28 10:03:30,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:30,616 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 10:03:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:03:30,617 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-28 10:03:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:30,617 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-28 10:03:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-28 10:03:30,618 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-28 10:03:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-28 10:03:30,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 28 transitions. [2022-04-28 10:03:30,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:30,646 INFO L225 Difference]: With dead ends: 29 [2022-04-28 10:03:30,646 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 10:03:30,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:03:30,646 INFO L413 NwaCegarLoop]: 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-28 10:03:30,647 INFO L414 NwaCegarLoop]: 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-28 10:03:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 10:03:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-28 10:03:30,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:30,681 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-28 10:03:30,681 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-28 10:03:30,681 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-28 10:03:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:30,682 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 10:03:30,682 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 10:03:30,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:30,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:30,682 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-28 10:03:30,683 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-28 10:03:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:30,683 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 10:03:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 10:03:30,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:30,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:30,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:30,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:30,684 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-28 10:03:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-28 10:03:30,685 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2022-04-28 10:03:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:30,685 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-28 10:03:30,685 INFO L496 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-28 10:03:30,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-28 10:03:30,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:30,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 10:03:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:03:30,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:30,714 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:30,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 10:03:30,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:30,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1601169482, now seen corresponding path program 9 times [2022-04-28 10:03:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:30,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12283526] [2022-04-28 10:03:30,918 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:30,919 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1601169482, now seen corresponding path program 10 times [2022-04-28 10:03:30,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:30,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694484505] [2022-04-28 10:03:30,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:30,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:31,009 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-28 10:03:31,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-28 10:03:31,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2130#true} {2130#true} #50#return; {2130#true} is VALID [2022-04-28 10:03:31,010 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-28 10:03:31,010 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-28 10:03:31,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-28 10:03:31,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #50#return; {2130#true} is VALID [2022-04-28 10:03:31,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret9 := main(); {2130#true} is VALID [2022-04-28 10:03:31,011 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-28 10:03:31,011 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-28 10:03:31,012 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-28 10:03:31,012 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-28 10:03:31,013 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-28 10:03:31,013 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-28 10:03:31,014 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-28 10:03:31,015 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-28 10:03:31,015 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-28 10:03:31,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#false} ~cond := #in~cond; {2131#false} is VALID [2022-04-28 10:03:31,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {2131#false} assume 0 == ~cond; {2131#false} is VALID [2022-04-28 10:03:31,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-28 10:03:31,015 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-28 10:03:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:31,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694484505] [2022-04-28 10:03:31,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694484505] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:31,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378228001] [2022-04-28 10:03:31,016 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:31,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:31,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:31,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:31,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 10:03:31,055 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:31,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:31,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:03:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:31,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:31,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2022-04-28 10:03:31,256 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-28 10:03:31,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-28 10:03:31,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #50#return; {2130#true} is VALID [2022-04-28 10:03:31,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret9 := main(); {2130#true} is VALID [2022-04-28 10:03:31,257 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-28 10:03:31,257 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-28 10:03:31,258 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-28 10:03:31,259 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-28 10:03:31,259 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-28 10:03:31,260 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-28 10:03:31,260 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-28 10:03:31,261 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-28 10:03:31,261 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-28 10:03:31,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#false} ~cond := #in~cond; {2131#false} is VALID [2022-04-28 10:03:31,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {2131#false} assume 0 == ~cond; {2131#false} is VALID [2022-04-28 10:03:31,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-28 10:03:31,261 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-28 10:03:31,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:31,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-28 10:03:31,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {2131#false} assume 0 == ~cond; {2131#false} is VALID [2022-04-28 10:03:31,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#false} ~cond := #in~cond; {2131#false} is VALID [2022-04-28 10:03:31,377 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-28 10:03:31,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {2206#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2131#false} is VALID [2022-04-28 10:03:31,378 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-28 10:03:31,378 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-28 10:03:31,379 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-28 10:03:31,379 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-28 10:03:31,380 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-28 10:03:31,381 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-28 10:03:31,383 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-28 10:03:31,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret9 := main(); {2130#true} is VALID [2022-04-28 10:03:31,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #50#return; {2130#true} is VALID [2022-04-28 10:03:31,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-28 10:03:31,384 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-28 10:03:31,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2022-04-28 10:03:31,384 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-28 10:03:31,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378228001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:31,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:31,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 10:03:31,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:31,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12283526] [2022-04-28 10:03:31,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12283526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:31,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:31,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:03:31,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711260564] [2022-04-28 10:03:31,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:31,385 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-28 10:03:31,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:31,385 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-28 10:03:31,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:31,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:03:31,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:03:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:03:31,402 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-28 10:03:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:31,825 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 10:03:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:03:31,825 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-28 10:03:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:31,826 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-28 10:03:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-28 10:03:31,827 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-28 10:03:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-28 10:03:31,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-28 10:03:31,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:31,864 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:03:31,864 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:03:31,864 INFO L412 NwaCegarLoop]: 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-28 10:03:31,865 INFO L413 NwaCegarLoop]: 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-28 10:03:31,865 INFO L414 NwaCegarLoop]: 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-28 10:03:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:03:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2022-04-28 10:03:31,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:31,901 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-28 10:03:31,901 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-28 10:03:31,901 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-28 10:03:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:31,902 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-28 10:03:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 10:03:31,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:31,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:31,903 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-28 10:03:31,903 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-28 10:03:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:31,903 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-28 10:03:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 10:03:31,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:31,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:31,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:31,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:31,904 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-28 10:03:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-28 10:03:31,905 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2022-04-28 10:03:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:31,905 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-28 10:03:31,905 INFO L496 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-28 10:03:31,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-28 10:03:31,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 10:03:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:03:31,936 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:31,936 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:31,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:03:32,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:03:32,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash 596734039, now seen corresponding path program 7 times [2022-04-28 10:03:32,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:32,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888609915] [2022-04-28 10:03:32,150 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:32,151 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash 596734039, now seen corresponding path program 8 times [2022-04-28 10:03:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:32,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592227250] [2022-04-28 10:03:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:32,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:32,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:32,240 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-28 10:03:32,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-28 10:03:32,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2436#true} {2436#true} #50#return; {2436#true} is VALID [2022-04-28 10:03:32,241 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-28 10:03:32,241 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-28 10:03:32,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-28 10:03:32,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #50#return; {2436#true} is VALID [2022-04-28 10:03:32,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret9 := main(); {2436#true} is VALID [2022-04-28 10:03:32,242 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-28 10:03:32,242 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-28 10:03:32,243 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-28 10:03:32,244 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-28 10:03:32,244 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-28 10:03:32,245 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-28 10:03:32,245 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-28 10:03:32,246 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-28 10:03:32,246 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-28 10:03:32,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-28 10:03:32,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-28 10:03:32,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-28 10:03:32,246 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-28 10:03:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:32,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592227250] [2022-04-28 10:03:32,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592227250] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:32,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810451440] [2022-04-28 10:03:32,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:32,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:32,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:32,248 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:32,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 10:03:32,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:32,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:32,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:03:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:32,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:32,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2022-04-28 10:03:32,493 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-28 10:03:32,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-28 10:03:32,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #50#return; {2436#true} is VALID [2022-04-28 10:03:32,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret9 := main(); {2436#true} is VALID [2022-04-28 10:03:32,494 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-28 10:03:32,494 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-28 10:03:32,495 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-28 10:03:32,495 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-28 10:03:32,496 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-28 10:03:32,496 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-28 10:03:32,496 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-28 10:03:32,497 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-28 10:03:32,497 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-28 10:03:32,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-28 10:03:32,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-28 10:03:32,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-28 10:03:32,497 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-28 10:03:32,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:32,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-28 10:03:32,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-28 10:03:32,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-28 10:03:32,642 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-28 10:03:32,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {2512#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2437#false} is VALID [2022-04-28 10:03:32,643 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-28 10:03:32,643 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-28 10:03:32,644 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-28 10:03:32,645 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-28 10:03:32,646 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-28 10:03:32,646 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-28 10:03:32,647 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-28 10:03:32,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret9 := main(); {2436#true} is VALID [2022-04-28 10:03:32,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #50#return; {2436#true} is VALID [2022-04-28 10:03:32,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-28 10:03:32,647 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-28 10:03:32,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2022-04-28 10:03:32,648 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-28 10:03:32,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810451440] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:32,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:32,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 10:03:32,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:32,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888609915] [2022-04-28 10:03:32,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888609915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:32,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:32,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:03:32,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415047086] [2022-04-28 10:03:32,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:32,650 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-28 10:03:32,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:32,650 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-28 10:03:32,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:32,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:03:32,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:32,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:03:32,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:03:32,664 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-28 10:03:33,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:33,076 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-28 10:03:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:03:33,077 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-28 10:03:33,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:33,077 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-28 10:03:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-28 10:03:33,078 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-28 10:03:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-28 10:03:33,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-28 10:03:33,123 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-28 10:03:33,124 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:03:33,124 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:03:33,125 INFO L412 NwaCegarLoop]: 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-28 10:03:33,125 INFO L413 NwaCegarLoop]: 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-28 10:03:33,125 INFO L414 NwaCegarLoop]: 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-28 10:03:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:03:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-04-28 10:03:33,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:33,163 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-28 10:03:33,163 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-28 10:03:33,163 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-28 10:03:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:33,164 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 10:03:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 10:03:33,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:33,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:33,165 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-28 10:03:33,165 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-28 10:03:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:33,166 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 10:03:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 10:03:33,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:33,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:33,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:33,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:33,166 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-28 10:03:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-28 10:03:33,167 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2022-04-28 10:03:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:33,167 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-28 10:03:33,167 INFO L496 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-28 10:03:33,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-28 10:03:33,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 10:03:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:03:33,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:33,214 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:33,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 10:03:33,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:33,437 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:33,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1418492661, now seen corresponding path program 11 times [2022-04-28 10:03:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:33,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [532264238] [2022-04-28 10:03:33,440 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:33,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:33,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1418492661, now seen corresponding path program 12 times [2022-04-28 10:03:33,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:33,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815849950] [2022-04-28 10:03:33,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:33,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:33,533 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-28 10:03:33,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {2764#true} assume true; {2764#true} is VALID [2022-04-28 10:03:33,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2764#true} {2764#true} #50#return; {2764#true} is VALID [2022-04-28 10:03:33,534 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-28 10:03:33,534 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-28 10:03:33,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {2764#true} assume true; {2764#true} is VALID [2022-04-28 10:03:33,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2764#true} {2764#true} #50#return; {2764#true} is VALID [2022-04-28 10:03:33,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {2764#true} call #t~ret9 := main(); {2764#true} is VALID [2022-04-28 10:03:33,534 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-28 10:03:33,535 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-28 10:03:33,535 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-28 10:03:33,536 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-28 10:03:33,536 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-28 10:03:33,537 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-28 10:03:33,538 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-28 10:03:33,538 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-28 10:03:33,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {2765#false} assume !(~z~0 % 4294967296 > 0); {2765#false} is VALID [2022-04-28 10:03:33,539 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-28 10:03:33,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {2765#false} ~cond := #in~cond; {2765#false} is VALID [2022-04-28 10:03:33,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {2765#false} assume 0 == ~cond; {2765#false} is VALID [2022-04-28 10:03:33,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {2765#false} assume !false; {2765#false} is VALID [2022-04-28 10:03:33,539 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-28 10:03:33,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:33,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815849950] [2022-04-28 10:03:33,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815849950] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:33,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246654588] [2022-04-28 10:03:33,540 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:03:33,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:33,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:33,541 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-28 10:03:33,569 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-28 10:03:33,589 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:03:33,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:33,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:03:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:33,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:33,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {2764#true} call ULTIMATE.init(); {2764#true} is VALID [2022-04-28 10:03:33,809 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-28 10:03:33,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {2764#true} assume true; {2764#true} is VALID [2022-04-28 10:03:33,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2764#true} {2764#true} #50#return; {2764#true} is VALID [2022-04-28 10:03:33,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {2764#true} call #t~ret9 := main(); {2764#true} is VALID [2022-04-28 10:03:33,810 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-28 10:03:33,810 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-28 10:03:33,811 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-28 10:03:33,812 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-28 10:03:33,813 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-28 10:03:33,813 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-28 10:03:33,814 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-28 10:03:33,815 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-28 10:03:33,815 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-28 10:03:33,815 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-28 10:03:33,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {2765#false} ~cond := #in~cond; {2765#false} is VALID [2022-04-28 10:03:33,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {2765#false} assume 0 == ~cond; {2765#false} is VALID [2022-04-28 10:03:33,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {2765#false} assume !false; {2765#false} is VALID [2022-04-28 10:03:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:33,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:33,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {2765#false} assume !false; {2765#false} is VALID [2022-04-28 10:03:33,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {2765#false} assume 0 == ~cond; {2765#false} is VALID [2022-04-28 10:03:33,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {2765#false} ~cond := #in~cond; {2765#false} is VALID [2022-04-28 10:03:33,978 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-28 10:03:33,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {2843#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2765#false} is VALID [2022-04-28 10:03:33,980 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-28 10:03:33,981 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-28 10:03:33,981 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-28 10:03:33,982 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-28 10:03:33,982 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-28 10:03:33,983 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-28 10:03:33,984 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-28 10:03:33,984 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-28 10:03:33,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {2764#true} call #t~ret9 := main(); {2764#true} is VALID [2022-04-28 10:03:33,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2764#true} {2764#true} #50#return; {2764#true} is VALID [2022-04-28 10:03:33,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {2764#true} assume true; {2764#true} is VALID [2022-04-28 10:03:33,985 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-28 10:03:33,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {2764#true} call ULTIMATE.init(); {2764#true} is VALID [2022-04-28 10:03:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:33,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246654588] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:33,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:33,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-04-28 10:03:33,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:33,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [532264238] [2022-04-28 10:03:33,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [532264238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:33,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:33,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:03:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449915941] [2022-04-28 10:03:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:33,986 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-28 10:03:33,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:33,986 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-28 10:03:34,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:34,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:03:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:34,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:03:34,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:03:34,003 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-28 10:03:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:34,298 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 10:03:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:03:34,299 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-28 10:03:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:34,299 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-28 10:03:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-04-28 10:03:34,300 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-28 10:03:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-04-28 10:03:34,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 29 transitions. [2022-04-28 10:03:34,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:34,332 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:03:34,332 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:03:34,333 INFO L412 NwaCegarLoop]: 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-28 10:03:34,333 INFO L413 NwaCegarLoop]: 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-28 10:03:34,333 INFO L414 NwaCegarLoop]: 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-28 10:03:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:03:34,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 10:03:34,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:34,374 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-28 10:03:34,374 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-28 10:03:34,374 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-28 10:03:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:34,375 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 10:03:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 10:03:34,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:34,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:34,375 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-28 10:03:34,375 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-28 10:03:34,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:34,376 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 10:03:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 10:03:34,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:34,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:34,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:34,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:34,381 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-28 10:03:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-28 10:03:34,382 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2022-04-28 10:03:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:34,382 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-28 10:03:34,382 INFO L496 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-28 10:03:34,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-28 10:03:34,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 10:03:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:03:34,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:34,413 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:34,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 10:03:34,613 WARN L477 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-28 10:03:34,613 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:34,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1937848684, now seen corresponding path program 13 times [2022-04-28 10:03:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:34,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [536530717] [2022-04-28 10:03:34,616 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:34,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1937848684, now seen corresponding path program 14 times [2022-04-28 10:03:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:34,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915353270] [2022-04-28 10:03:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:34,763 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-28 10:03:34,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {3061#true} assume true; {3061#true} is VALID [2022-04-28 10:03:34,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3061#true} {3061#true} #50#return; {3061#true} is VALID [2022-04-28 10:03:34,764 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-28 10:03:34,764 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-28 10:03:34,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {3061#true} assume true; {3061#true} is VALID [2022-04-28 10:03:34,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3061#true} {3061#true} #50#return; {3061#true} is VALID [2022-04-28 10:03:34,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {3061#true} call #t~ret9 := main(); {3061#true} is VALID [2022-04-28 10:03:34,765 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-28 10:03:34,765 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-28 10:03:34,766 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-28 10:03:34,766 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-28 10:03:34,766 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-28 10:03:34,767 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-28 10:03:34,767 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-28 10:03:34,768 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-28 10:03:34,768 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-28 10:03:34,768 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-28 10:03:34,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {3062#false} ~cond := #in~cond; {3062#false} is VALID [2022-04-28 10:03:34,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {3062#false} assume 0 == ~cond; {3062#false} is VALID [2022-04-28 10:03:34,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {3062#false} assume !false; {3062#false} is VALID [2022-04-28 10:03:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:34,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:34,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915353270] [2022-04-28 10:03:34,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915353270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:34,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260567698] [2022-04-28 10:03:34,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:34,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:34,770 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-28 10:03:34,770 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-28 10:03:34,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:34,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:34,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:03:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:34,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:35,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {3061#true} call ULTIMATE.init(); {3061#true} is VALID [2022-04-28 10:03:35,025 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-28 10:03:35,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {3061#true} assume true; {3061#true} is VALID [2022-04-28 10:03:35,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3061#true} {3061#true} #50#return; {3061#true} is VALID [2022-04-28 10:03:35,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {3061#true} call #t~ret9 := main(); {3061#true} is VALID [2022-04-28 10:03:35,026 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-28 10:03:35,027 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-28 10:03:35,027 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-28 10:03:35,028 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-28 10:03:35,029 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-28 10:03:35,029 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-28 10:03:35,030 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-28 10:03:35,030 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-28 10:03:35,031 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-28 10:03:35,031 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-28 10:03:35,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {3062#false} ~cond := #in~cond; {3062#false} is VALID [2022-04-28 10:03:35,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {3062#false} assume 0 == ~cond; {3062#false} is VALID [2022-04-28 10:03:35,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {3062#false} assume !false; {3062#false} is VALID [2022-04-28 10:03:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:35,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:35,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {3062#false} assume !false; {3062#false} is VALID [2022-04-28 10:03:35,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {3062#false} assume 0 == ~cond; {3062#false} is VALID [2022-04-28 10:03:35,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {3062#false} ~cond := #in~cond; {3062#false} is VALID [2022-04-28 10:03:35,200 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-28 10:03:35,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {3141#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3062#false} is VALID [2022-04-28 10:03:35,201 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-28 10:03:35,201 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-28 10:03:35,202 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-28 10:03:35,202 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-28 10:03:35,203 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-28 10:03:35,203 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-28 10:03:35,204 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-28 10:03:35,204 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-28 10:03:35,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {3061#true} call #t~ret9 := main(); {3061#true} is VALID [2022-04-28 10:03:35,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3061#true} {3061#true} #50#return; {3061#true} is VALID [2022-04-28 10:03:35,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {3061#true} assume true; {3061#true} is VALID [2022-04-28 10:03:35,205 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-28 10:03:35,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {3061#true} call ULTIMATE.init(); {3061#true} is VALID [2022-04-28 10:03:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:35,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260567698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:35,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:35,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:03:35,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:35,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [536530717] [2022-04-28 10:03:35,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [536530717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:35,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:35,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:03:35,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002100488] [2022-04-28 10:03:35,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:35,206 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-28 10:03:35,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:35,206 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-28 10:03:35,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:35,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:03:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:35,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:03:35,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:03:35,221 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-28 10:03:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:35,594 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 10:03:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:03:35,594 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-28 10:03:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:35,594 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-28 10:03:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-28 10:03:35,595 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-28 10:03:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-28 10:03:35,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-28 10:03:35,622 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-28 10:03:35,622 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:03:35,622 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 10:03:35,623 INFO L412 NwaCegarLoop]: 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-28 10:03:35,623 INFO L413 NwaCegarLoop]: 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-28 10:03:35,623 INFO L414 NwaCegarLoop]: 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-28 10:03:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 10:03:35,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-28 10:03:35,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:35,660 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-28 10:03:35,660 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-28 10:03:35,660 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-28 10:03:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:35,661 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 10:03:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 10:03:35,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:35,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:35,661 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-28 10:03:35,661 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-28 10:03:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:35,662 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 10:03:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 10:03:35,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:35,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:35,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:35,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:35,662 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-28 10:03:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 10:03:35,663 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2022-04-28 10:03:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:35,663 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 10:03:35,663 INFO L496 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-28 10:03:35,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 10:03:35,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 10:03:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:03:35,695 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:35,695 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:35,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 10:03:35,919 WARN L477 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-28 10:03:35,920 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1353381099, now seen corresponding path program 15 times [2022-04-28 10:03:35,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:35,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372751685] [2022-04-28 10:03:35,923 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:35,923 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1353381099, now seen corresponding path program 16 times [2022-04-28 10:03:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:35,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717017381] [2022-04-28 10:03:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:36,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:36,040 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-28 10:03:36,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {3369#true} assume true; {3369#true} is VALID [2022-04-28 10:03:36,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3369#true} {3369#true} #50#return; {3369#true} is VALID [2022-04-28 10:03:36,041 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-28 10:03:36,041 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-28 10:03:36,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {3369#true} assume true; {3369#true} is VALID [2022-04-28 10:03:36,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3369#true} {3369#true} #50#return; {3369#true} is VALID [2022-04-28 10:03:36,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {3369#true} call #t~ret9 := main(); {3369#true} is VALID [2022-04-28 10:03:36,042 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-28 10:03:36,042 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-28 10:03:36,043 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-28 10:03:36,043 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-28 10:03:36,044 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-28 10:03:36,044 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-28 10:03:36,045 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-28 10:03:36,045 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-28 10:03:36,046 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-28 10:03:36,046 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-28 10:03:36,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {3370#false} ~cond := #in~cond; {3370#false} is VALID [2022-04-28 10:03:36,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {3370#false} assume 0 == ~cond; {3370#false} is VALID [2022-04-28 10:03:36,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {3370#false} assume !false; {3370#false} is VALID [2022-04-28 10:03:36,046 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-28 10:03:36,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:36,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717017381] [2022-04-28 10:03:36,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717017381] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:36,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70872782] [2022-04-28 10:03:36,047 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:36,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:36,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:36,048 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-28 10:03:36,049 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-28 10:03:36,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:36,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:36,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:03:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:36,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:36,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {3369#true} call ULTIMATE.init(); {3369#true} is VALID [2022-04-28 10:03:36,291 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-28 10:03:36,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {3369#true} assume true; {3369#true} is VALID [2022-04-28 10:03:36,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3369#true} {3369#true} #50#return; {3369#true} is VALID [2022-04-28 10:03:36,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {3369#true} call #t~ret9 := main(); {3369#true} is VALID [2022-04-28 10:03:36,292 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-28 10:03:36,293 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-28 10:03:36,293 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-28 10:03:36,294 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-28 10:03:36,295 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-28 10:03:36,296 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-28 10:03:36,296 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-28 10:03:36,297 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-28 10:03:36,297 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-28 10:03:36,298 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-28 10:03:36,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {3370#false} ~cond := #in~cond; {3370#false} is VALID [2022-04-28 10:03:36,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {3370#false} assume 0 == ~cond; {3370#false} is VALID [2022-04-28 10:03:36,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {3370#false} assume !false; {3370#false} is VALID [2022-04-28 10:03:36,298 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-28 10:03:36,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:36,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {3370#false} assume !false; {3370#false} is VALID [2022-04-28 10:03:36,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {3370#false} assume 0 == ~cond; {3370#false} is VALID [2022-04-28 10:03:36,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {3370#false} ~cond := #in~cond; {3370#false} is VALID [2022-04-28 10:03:36,441 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-28 10:03:36,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {3449#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3370#false} is VALID [2022-04-28 10:03:36,442 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-28 10:03:36,443 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-28 10:03:36,443 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-28 10:03:36,444 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-28 10:03:36,444 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-28 10:03:36,445 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-28 10:03:36,445 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-28 10:03:36,446 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-28 10:03:36,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {3369#true} call #t~ret9 := main(); {3369#true} is VALID [2022-04-28 10:03:36,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3369#true} {3369#true} #50#return; {3369#true} is VALID [2022-04-28 10:03:36,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {3369#true} assume true; {3369#true} is VALID [2022-04-28 10:03:36,446 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-28 10:03:36,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {3369#true} call ULTIMATE.init(); {3369#true} is VALID [2022-04-28 10:03:36,446 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-28 10:03:36,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70872782] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:36,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:36,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:03:36,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:36,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372751685] [2022-04-28 10:03:36,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372751685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:36,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:36,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:03:36,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818576155] [2022-04-28 10:03:36,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:36,447 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-28 10:03:36,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:36,448 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-28 10:03:36,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:36,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:03:36,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:36,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:03:36,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:03:36,461 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-28 10:03:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:36,877 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 10:03:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:03:36,877 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-28 10:03:36,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:36,878 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-28 10:03:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-04-28 10:03:36,879 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-28 10:03:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-04-28 10:03:36,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2022-04-28 10:03:36,914 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-28 10:03:36,914 INFO L225 Difference]: With dead ends: 35 [2022-04-28 10:03:36,914 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:03:36,915 INFO L412 NwaCegarLoop]: 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-28 10:03:36,915 INFO L413 NwaCegarLoop]: 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-28 10:03:36,916 INFO L414 NwaCegarLoop]: 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-28 10:03:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:03:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-04-28 10:03:36,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:36,957 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-28 10:03:36,957 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-28 10:03:36,957 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-28 10:03:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:36,958 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 10:03:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 10:03:36,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:36,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:36,958 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-28 10:03:36,958 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-28 10:03:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:36,959 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 10:03:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 10:03:36,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:36,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:36,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:36,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:36,959 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-28 10:03:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 10:03:36,960 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2022-04-28 10:03:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:36,960 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 10:03:36,960 INFO L496 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-28 10:03:36,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 10:03:36,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 10:03:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:03:36,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:36,998 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:37,014 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-28 10:03:37,203 WARN L477 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-28 10:03:37,203 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash -743682676, now seen corresponding path program 9 times [2022-04-28 10:03:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:37,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1722949801] [2022-04-28 10:03:37,206 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:37,206 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash -743682676, now seen corresponding path program 10 times [2022-04-28 10:03:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:37,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834183471] [2022-04-28 10:03:37,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:37,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:37,324 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-28 10:03:37,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-28 10:03:37,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3691#true} {3691#true} #50#return; {3691#true} is VALID [2022-04-28 10:03:37,325 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-28 10:03:37,325 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-28 10:03:37,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-28 10:03:37,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3691#true} {3691#true} #50#return; {3691#true} is VALID [2022-04-28 10:03:37,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {3691#true} call #t~ret9 := main(); {3691#true} is VALID [2022-04-28 10:03:37,325 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-28 10:03:37,326 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-28 10:03:37,326 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-28 10:03:37,327 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-28 10:03:37,327 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-28 10:03:37,328 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-28 10:03:37,328 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-28 10:03:37,328 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-28 10:03:37,329 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-28 10:03:37,329 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-28 10:03:37,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {3692#false} ~cond := #in~cond; {3692#false} is VALID [2022-04-28 10:03:37,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {3692#false} assume 0 == ~cond; {3692#false} is VALID [2022-04-28 10:03:37,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {3692#false} assume !false; {3692#false} is VALID [2022-04-28 10:03:37,329 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-28 10:03:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:37,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834183471] [2022-04-28 10:03:37,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834183471] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:37,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397218214] [2022-04-28 10:03:37,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:37,330 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-28 10:03:37,331 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-28 10:03:37,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:37,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:37,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:03:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:37,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:37,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {3691#true} call ULTIMATE.init(); {3691#true} is VALID [2022-04-28 10:03:37,574 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-28 10:03:37,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-28 10:03:37,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3691#true} {3691#true} #50#return; {3691#true} is VALID [2022-04-28 10:03:37,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {3691#true} call #t~ret9 := main(); {3691#true} is VALID [2022-04-28 10:03:37,574 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-28 10:03:37,575 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-28 10:03:37,576 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-28 10:03:37,576 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-28 10:03:37,577 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-28 10:03:37,578 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-28 10:03:37,578 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-28 10:03:37,578 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-28 10:03:37,579 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-28 10:03:37,579 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-28 10:03:37,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {3692#false} ~cond := #in~cond; {3692#false} is VALID [2022-04-28 10:03:37,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {3692#false} assume 0 == ~cond; {3692#false} is VALID [2022-04-28 10:03:37,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {3692#false} assume !false; {3692#false} is VALID [2022-04-28 10:03:37,579 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-28 10:03:37,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:37,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {3692#false} assume !false; {3692#false} is VALID [2022-04-28 10:03:37,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {3692#false} assume 0 == ~cond; {3692#false} is VALID [2022-04-28 10:03:37,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {3692#false} ~cond := #in~cond; {3692#false} is VALID [2022-04-28 10:03:37,729 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-28 10:03:37,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {3771#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3692#false} is VALID [2022-04-28 10:03:37,729 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-28 10:03:37,735 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-28 10:03:37,736 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-28 10:03:37,737 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-28 10:03:37,737 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-28 10:03:37,738 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-28 10:03:37,739 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-28 10:03:37,740 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-28 10:03:37,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {3691#true} call #t~ret9 := main(); {3691#true} is VALID [2022-04-28 10:03:37,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3691#true} {3691#true} #50#return; {3691#true} is VALID [2022-04-28 10:03:37,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-28 10:03:37,740 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-28 10:03:37,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {3691#true} call ULTIMATE.init(); {3691#true} is VALID [2022-04-28 10:03:37,740 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-28 10:03:37,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397218214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:37,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:37,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:03:37,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:37,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1722949801] [2022-04-28 10:03:37,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1722949801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:37,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:37,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:03:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323814186] [2022-04-28 10:03:37,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:37,742 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-28 10:03:37,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:37,742 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-28 10:03:37,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:37,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:03:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:03:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:03:37,754 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-28 10:03:38,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:38,186 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-28 10:03:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:03:38,186 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-28 10:03:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:38,187 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-28 10:03:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 10:03:38,188 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-28 10:03:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 10:03:38,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-28 10:03:38,226 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-28 10:03:38,226 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:03:38,226 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 10:03:38,227 INFO L412 NwaCegarLoop]: 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-28 10:03:38,227 INFO L413 NwaCegarLoop]: 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-28 10:03:38,227 INFO L414 NwaCegarLoop]: 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-28 10:03:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 10:03:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2022-04-28 10:03:38,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:38,269 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-28 10:03:38,269 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-28 10:03:38,269 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-28 10:03:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:38,270 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-28 10:03:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-28 10:03:38,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:38,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:38,271 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-28 10:03:38,271 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-28 10:03:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:38,271 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-28 10:03:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-28 10:03:38,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:38,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:38,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:38,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:38,272 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-28 10:03:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-28 10:03:38,273 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 18 [2022-04-28 10:03:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:38,273 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-28 10:03:38,273 INFO L496 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-28 10:03:38,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-28 10:03:38,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 10:03:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:03:38,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:38,306 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:38,322 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-28 10:03:38,511 WARN L477 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-28 10:03:38,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:38,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash -21737866, now seen corresponding path program 17 times [2022-04-28 10:03:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:38,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882935748] [2022-04-28 10:03:38,514 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:38,514 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:38,514 INFO L85 PathProgramCache]: Analyzing trace with hash -21737866, now seen corresponding path program 18 times [2022-04-28 10:03:38,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:38,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268349907] [2022-04-28 10:03:38,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:38,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:38,676 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-28 10:03:38,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {4035#true} assume true; {4035#true} is VALID [2022-04-28 10:03:38,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4035#true} {4035#true} #50#return; {4035#true} is VALID [2022-04-28 10:03:38,677 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-28 10:03:38,677 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-28 10:03:38,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {4035#true} assume true; {4035#true} is VALID [2022-04-28 10:03:38,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4035#true} {4035#true} #50#return; {4035#true} is VALID [2022-04-28 10:03:38,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {4035#true} call #t~ret9 := main(); {4035#true} is VALID [2022-04-28 10:03:38,677 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-28 10:03:38,678 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-28 10:03:38,679 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-28 10:03:38,679 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-28 10:03:38,680 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-28 10:03:38,680 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-28 10:03:38,681 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-28 10:03:38,681 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-28 10:03:38,682 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-28 10:03:38,683 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-28 10:03:38,684 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-28 10:03:38,684 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-28 10:03:38,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {4046#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4036#false} is VALID [2022-04-28 10:03:38,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {4036#false} assume !false; {4036#false} is VALID [2022-04-28 10:03:38,684 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-28 10:03:38,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:38,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268349907] [2022-04-28 10:03:38,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268349907] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:38,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268118990] [2022-04-28 10:03:38,685 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:03:38,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:38,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:38,686 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-28 10:03:38,686 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-28 10:03:38,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:03:38,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:38,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:03:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:38,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:38,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {4035#true} call ULTIMATE.init(); {4035#true} is VALID [2022-04-28 10:03:38,865 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-28 10:03:38,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {4035#true} assume true; {4035#true} is VALID [2022-04-28 10:03:38,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4035#true} {4035#true} #50#return; {4035#true} is VALID [2022-04-28 10:03:38,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {4035#true} call #t~ret9 := main(); {4035#true} is VALID [2022-04-28 10:03:38,866 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-28 10:03:38,867 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-28 10:03:38,867 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-28 10:03:38,868 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-28 10:03:38,868 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-28 10:03:38,868 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-28 10:03:38,869 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-28 10:03:38,870 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-28 10:03:38,870 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-28 10:03:38,870 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-28 10:03:38,871 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-28 10:03:38,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {4096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:03:38,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {4100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4036#false} is VALID [2022-04-28 10:03:38,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {4036#false} assume !false; {4036#false} is VALID [2022-04-28 10:03:38,872 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-28 10:03:38,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:39,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {4036#false} assume !false; {4036#false} is VALID [2022-04-28 10:03:39,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {4100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4036#false} is VALID [2022-04-28 10:03:39,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {4096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:03:39,033 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-28 10:03:39,034 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-28 10:03:39,035 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-28 10:03:39,036 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-28 10:03:39,036 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-28 10:03:39,037 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-28 10:03:39,037 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-28 10:03:39,040 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-28 10:03:39,040 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-28 10:03:39,041 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-28 10:03:39,042 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-28 10:03:39,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {4035#true} call #t~ret9 := main(); {4035#true} is VALID [2022-04-28 10:03:39,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4035#true} {4035#true} #50#return; {4035#true} is VALID [2022-04-28 10:03:39,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {4035#true} assume true; {4035#true} is VALID [2022-04-28 10:03:39,042 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-28 10:03:39,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {4035#true} call ULTIMATE.init(); {4035#true} is VALID [2022-04-28 10:03:39,043 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-28 10:03:39,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268118990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:39,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:39,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-28 10:03:39,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:39,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882935748] [2022-04-28 10:03:39,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882935748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:39,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:39,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:03:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097216728] [2022-04-28 10:03:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:39,044 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-28 10:03:39,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:39,044 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-28 10:03:39,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:39,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:03:39,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:39,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:03:39,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:03:39,065 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-28 10:03:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:39,413 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 10:03:39,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:03:39,413 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-28 10:03:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:39,414 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-28 10:03:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-28 10:03:39,414 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-28 10:03:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-28 10:03:39,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 30 transitions. [2022-04-28 10:03:39,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:39,443 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:03:39,443 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:03:39,443 INFO L412 NwaCegarLoop]: 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-28 10:03:39,444 INFO L413 NwaCegarLoop]: 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-28 10:03:39,444 INFO L414 NwaCegarLoop]: 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-28 10:03:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:03:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-28 10:03:39,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:39,498 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-28 10:03:39,498 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-28 10:03:39,498 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-28 10:03:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:39,499 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 10:03:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 10:03:39,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:39,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:39,499 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-28 10:03:39,499 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-28 10:03:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:39,500 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 10:03:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 10:03:39,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:39,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:39,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:39,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:39,500 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-28 10:03:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 10:03:39,500 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-04-28 10:03:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:39,500 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 10:03:39,501 INFO L496 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-28 10:03:39,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 10:03:39,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 10:03:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:03:39,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:39,535 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:39,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 10:03:39,735 WARN L477 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-28 10:03:39,736 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:39,736 INFO L85 PathProgramCache]: Analyzing trace with hash -960363817, now seen corresponding path program 19 times [2022-04-28 10:03:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:39,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1806031749] [2022-04-28 10:03:39,739 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:39,739 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:39,739 INFO L85 PathProgramCache]: Analyzing trace with hash -960363817, now seen corresponding path program 20 times [2022-04-28 10:03:39,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:39,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017835784] [2022-04-28 10:03:39,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:39,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:39,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:39,873 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-28 10:03:39,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {4359#true} assume true; {4359#true} is VALID [2022-04-28 10:03:39,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4359#true} {4359#true} #50#return; {4359#true} is VALID [2022-04-28 10:03:39,873 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-28 10:03:39,873 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-28 10:03:39,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {4359#true} assume true; {4359#true} is VALID [2022-04-28 10:03:39,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4359#true} {4359#true} #50#return; {4359#true} is VALID [2022-04-28 10:03:39,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {4359#true} call #t~ret9 := main(); {4359#true} is VALID [2022-04-28 10:03:39,874 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-28 10:03:39,874 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-28 10:03:39,875 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-28 10:03:39,875 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-28 10:03:39,876 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-28 10:03:39,876 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-28 10:03:39,876 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-28 10:03:39,877 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-28 10:03:39,877 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-28 10:03:39,878 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-28 10:03:39,878 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-28 10:03:39,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {4360#false} ~cond := #in~cond; {4360#false} is VALID [2022-04-28 10:03:39,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {4360#false} assume 0 == ~cond; {4360#false} is VALID [2022-04-28 10:03:39,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {4360#false} assume !false; {4360#false} is VALID [2022-04-28 10:03:39,878 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-28 10:03:39,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:39,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017835784] [2022-04-28 10:03:39,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017835784] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:39,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116863156] [2022-04-28 10:03:39,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:39,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:39,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:39,880 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-28 10:03:39,881 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-28 10:03:39,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:39,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:39,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:03:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:39,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:40,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {4359#true} call ULTIMATE.init(); {4359#true} is VALID [2022-04-28 10:03:40,131 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-28 10:03:40,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {4359#true} assume true; {4359#true} is VALID [2022-04-28 10:03:40,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4359#true} {4359#true} #50#return; {4359#true} is VALID [2022-04-28 10:03:40,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {4359#true} call #t~ret9 := main(); {4359#true} is VALID [2022-04-28 10:03:40,132 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-28 10:03:40,132 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-28 10:03:40,135 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-28 10:03:40,136 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-28 10:03:40,136 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-28 10:03:40,137 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-28 10:03:40,137 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-28 10:03:40,137 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-28 10:03:40,138 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-28 10:03:40,138 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-28 10:03:40,139 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-28 10:03:40,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {4360#false} ~cond := #in~cond; {4360#false} is VALID [2022-04-28 10:03:40,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {4360#false} assume 0 == ~cond; {4360#false} is VALID [2022-04-28 10:03:40,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {4360#false} assume !false; {4360#false} is VALID [2022-04-28 10:03:40,139 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-28 10:03:40,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:40,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {4360#false} assume !false; {4360#false} is VALID [2022-04-28 10:03:40,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {4360#false} assume 0 == ~cond; {4360#false} is VALID [2022-04-28 10:03:40,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {4360#false} ~cond := #in~cond; {4360#false} is VALID [2022-04-28 10:03:40,324 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-28 10:03:40,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {4443#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4360#false} is VALID [2022-04-28 10:03:40,340 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-28 10:03:40,340 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-28 10:03:40,341 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-28 10:03:40,341 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-28 10:03:40,342 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-28 10:03:40,342 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-28 10:03:40,343 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-28 10:03:40,344 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-28 10:03:40,347 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-28 10:03:40,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {4359#true} call #t~ret9 := main(); {4359#true} is VALID [2022-04-28 10:03:40,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4359#true} {4359#true} #50#return; {4359#true} is VALID [2022-04-28 10:03:40,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {4359#true} assume true; {4359#true} is VALID [2022-04-28 10:03:40,348 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-28 10:03:40,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {4359#true} call ULTIMATE.init(); {4359#true} is VALID [2022-04-28 10:03:40,348 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-28 10:03:40,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116863156] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:40,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:40,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:03:40,348 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:40,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1806031749] [2022-04-28 10:03:40,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1806031749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:40,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:40,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:03:40,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286862501] [2022-04-28 10:03:40,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:40,349 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-28 10:03:40,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:40,350 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-28 10:03:40,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:40,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:03:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:03:40,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:03:40,363 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-28 10:03:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:40,804 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-28 10:03:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:03:40,804 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-28 10:03:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:40,805 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-28 10:03:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 10:03:40,817 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-28 10:03:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 10:03:40,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-28 10:03:40,848 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-28 10:03:40,849 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:03:40,849 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 10:03:40,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:03:40,850 INFO L413 NwaCegarLoop]: 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-28 10:03:40,850 INFO L414 NwaCegarLoop]: 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-28 10:03:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 10:03:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-04-28 10:03:40,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:40,911 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-28 10:03:40,912 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-28 10:03:40,912 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-28 10:03:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:40,912 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 10:03:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 10:03:40,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:40,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:40,913 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-28 10:03:40,913 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-28 10:03:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:40,913 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 10:03:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 10:03:40,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:40,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:40,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:40,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:40,914 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-28 10:03:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 10:03:40,914 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-04-28 10:03:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:40,915 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 10:03:40,915 INFO L496 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-28 10:03:40,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 10:03:40,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 10:03:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:03:40,954 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:40,954 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:40,971 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-28 10:03:41,154 WARN L477 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-28 10:03:41,154 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1544831402, now seen corresponding path program 21 times [2022-04-28 10:03:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:41,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1973699173] [2022-04-28 10:03:41,159 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:41,159 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1544831402, now seen corresponding path program 22 times [2022-04-28 10:03:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:41,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201563283] [2022-04-28 10:03:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:41,284 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-28 10:03:41,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-28 10:03:41,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4719#true} {4719#true} #50#return; {4719#true} is VALID [2022-04-28 10:03:41,285 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-28 10:03:41,285 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-28 10:03:41,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-28 10:03:41,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4719#true} {4719#true} #50#return; {4719#true} is VALID [2022-04-28 10:03:41,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {4719#true} call #t~ret9 := main(); {4719#true} is VALID [2022-04-28 10:03:41,285 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-28 10:03:41,286 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-28 10:03:41,286 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-28 10:03:41,287 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-28 10:03:41,287 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-28 10:03:41,288 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-28 10:03:41,288 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-28 10:03:41,289 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-28 10:03:41,289 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-28 10:03:41,289 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-28 10:03:41,290 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-28 10:03:41,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {4720#false} ~cond := #in~cond; {4720#false} is VALID [2022-04-28 10:03:41,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {4720#false} assume 0 == ~cond; {4720#false} is VALID [2022-04-28 10:03:41,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {4720#false} assume !false; {4720#false} is VALID [2022-04-28 10:03:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:41,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:41,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201563283] [2022-04-28 10:03:41,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201563283] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:41,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606171969] [2022-04-28 10:03:41,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:41,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:41,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:41,292 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-28 10:03:41,295 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-28 10:03:41,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:41,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:41,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:03:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:41,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:41,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {4719#true} call ULTIMATE.init(); {4719#true} is VALID [2022-04-28 10:03:41,541 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-28 10:03:41,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-28 10:03:41,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4719#true} {4719#true} #50#return; {4719#true} is VALID [2022-04-28 10:03:41,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {4719#true} call #t~ret9 := main(); {4719#true} is VALID [2022-04-28 10:03:41,542 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-28 10:03:41,542 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-28 10:03:41,543 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-28 10:03:41,543 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-28 10:03:41,544 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-28 10:03:41,544 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-28 10:03:41,545 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-28 10:03:41,545 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-28 10:03:41,545 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-28 10:03:41,546 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-28 10:03:41,546 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-28 10:03:41,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {4720#false} ~cond := #in~cond; {4720#false} is VALID [2022-04-28 10:03:41,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {4720#false} assume 0 == ~cond; {4720#false} is VALID [2022-04-28 10:03:41,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {4720#false} assume !false; {4720#false} is VALID [2022-04-28 10:03:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:41,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:41,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {4720#false} assume !false; {4720#false} is VALID [2022-04-28 10:03:41,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {4720#false} assume 0 == ~cond; {4720#false} is VALID [2022-04-28 10:03:41,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {4720#false} ~cond := #in~cond; {4720#false} is VALID [2022-04-28 10:03:41,704 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-28 10:03:41,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {4803#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4720#false} is VALID [2022-04-28 10:03:41,705 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-28 10:03:41,706 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-28 10:03:41,706 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-28 10:03:41,707 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-28 10:03:41,707 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-28 10:03:41,708 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-28 10:03:41,709 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-28 10:03:41,709 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-28 10:03:41,710 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-28 10:03:41,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {4719#true} call #t~ret9 := main(); {4719#true} is VALID [2022-04-28 10:03:41,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4719#true} {4719#true} #50#return; {4719#true} is VALID [2022-04-28 10:03:41,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-28 10:03:41,710 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-28 10:03:41,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {4719#true} call ULTIMATE.init(); {4719#true} is VALID [2022-04-28 10:03:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:41,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606171969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:41,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:41,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:03:41,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:41,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1973699173] [2022-04-28 10:03:41,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1973699173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:41,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:41,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:03:41,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957060270] [2022-04-28 10:03:41,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:41,711 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-28 10:03:41,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:41,711 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-28 10:03:41,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:41,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:03:41,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:03:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:03:41,725 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-28 10:03:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:42,262 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-28 10:03:42,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:03:42,262 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-28 10:03:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:42,262 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-28 10:03:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 10:03:42,263 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-28 10:03:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 10:03:42,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-28 10:03:42,304 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-28 10:03:42,304 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:03:42,304 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 10:03:42,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:03:42,305 INFO L413 NwaCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:42,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:03:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 10:03:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2022-04-28 10:03:42,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:42,367 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-28 10:03:42,367 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-28 10:03:42,367 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-28 10:03:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:42,368 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-28 10:03:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-28 10:03:42,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:42,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:42,368 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-28 10:03:42,368 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-28 10:03:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:42,369 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-28 10:03:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-28 10:03:42,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:42,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:42,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:42,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:42,369 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-28 10:03:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 10:03:42,370 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-04-28 10:03:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:42,370 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 10:03:42,370 INFO L496 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-28 10:03:42,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 10:03:42,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 10:03:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:03:42,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:42,407 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:42,423 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-28 10:03:42,611 WARN L477 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-28 10:03:42,611 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:42,612 INFO L85 PathProgramCache]: Analyzing trace with hash 653072119, now seen corresponding path program 11 times [2022-04-28 10:03:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:42,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [768600726] [2022-04-28 10:03:42,614 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:42,614 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash 653072119, now seen corresponding path program 12 times [2022-04-28 10:03:42,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:42,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140338509] [2022-04-28 10:03:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:42,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:42,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:42,740 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-28 10:03:42,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {5089#true} assume true; {5089#true} is VALID [2022-04-28 10:03:42,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5089#true} {5089#true} #50#return; {5089#true} is VALID [2022-04-28 10:03:42,741 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-28 10:03:42,741 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-28 10:03:42,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {5089#true} assume true; {5089#true} is VALID [2022-04-28 10:03:42,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5089#true} {5089#true} #50#return; {5089#true} is VALID [2022-04-28 10:03:42,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {5089#true} call #t~ret9 := main(); {5089#true} is VALID [2022-04-28 10:03:42,742 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-28 10:03:42,742 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-28 10:03:42,743 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-28 10:03:42,744 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-28 10:03:42,744 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-28 10:03:42,745 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-28 10:03:42,746 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-28 10:03:42,746 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-28 10:03:42,747 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-28 10:03:42,748 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-28 10:03:42,748 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-28 10:03:42,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {5090#false} ~cond := #in~cond; {5090#false} is VALID [2022-04-28 10:03:42,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {5090#false} assume 0 == ~cond; {5090#false} is VALID [2022-04-28 10:03:42,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {5090#false} assume !false; {5090#false} is VALID [2022-04-28 10:03:42,748 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-28 10:03:42,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:42,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140338509] [2022-04-28 10:03:42,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140338509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:42,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735428474] [2022-04-28 10:03:42,749 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:03:42,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:42,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:42,751 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-28 10:03:42,754 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-28 10:03:42,793 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:03:42,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:42,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:03:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:42,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:43,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {5089#true} call ULTIMATE.init(); {5089#true} is VALID [2022-04-28 10:03:43,028 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-28 10:03:43,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {5089#true} assume true; {5089#true} is VALID [2022-04-28 10:03:43,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5089#true} {5089#true} #50#return; {5089#true} is VALID [2022-04-28 10:03:43,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {5089#true} call #t~ret9 := main(); {5089#true} is VALID [2022-04-28 10:03:43,028 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-28 10:03:43,028 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-28 10:03:43,029 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-28 10:03:43,030 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-28 10:03:43,030 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-28 10:03:43,031 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-28 10:03:43,031 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-28 10:03:43,031 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-28 10:03:43,032 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-28 10:03:43,032 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-28 10:03:43,032 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-28 10:03:43,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {5090#false} ~cond := #in~cond; {5090#false} is VALID [2022-04-28 10:03:43,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {5090#false} assume 0 == ~cond; {5090#false} is VALID [2022-04-28 10:03:43,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {5090#false} assume !false; {5090#false} is VALID [2022-04-28 10:03:43,033 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-28 10:03:43,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:43,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {5090#false} assume !false; {5090#false} is VALID [2022-04-28 10:03:43,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {5090#false} assume 0 == ~cond; {5090#false} is VALID [2022-04-28 10:03:43,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {5090#false} ~cond := #in~cond; {5090#false} is VALID [2022-04-28 10:03:43,204 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-28 10:03:43,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {5173#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5090#false} is VALID [2022-04-28 10:03:43,211 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-28 10:03:43,212 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-28 10:03:43,213 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-28 10:03:43,213 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-28 10:03:43,214 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-28 10:03:43,215 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-28 10:03:43,216 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-28 10:03:43,217 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-28 10:03:43,217 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-28 10:03:43,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {5089#true} call #t~ret9 := main(); {5089#true} is VALID [2022-04-28 10:03:43,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5089#true} {5089#true} #50#return; {5089#true} is VALID [2022-04-28 10:03:43,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {5089#true} assume true; {5089#true} is VALID [2022-04-28 10:03:43,217 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-28 10:03:43,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {5089#true} call ULTIMATE.init(); {5089#true} is VALID [2022-04-28 10:03:43,218 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-28 10:03:43,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735428474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:43,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:43,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:03:43,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:43,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [768600726] [2022-04-28 10:03:43,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [768600726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:43,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:43,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:03:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298541264] [2022-04-28 10:03:43,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:43,219 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-28 10:03:43,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:43,219 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-28 10:03:43,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:43,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:03:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:03:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:03:43,235 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-28 10:03:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:43,865 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-04-28 10:03:43,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:03:43,865 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-28 10:03:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:43,865 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-28 10:03:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2022-04-28 10:03:43,866 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-28 10:03:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2022-04-28 10:03:43,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 48 transitions. [2022-04-28 10:03:43,904 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-28 10:03:43,905 INFO L225 Difference]: With dead ends: 48 [2022-04-28 10:03:43,905 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 10:03:43,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:03:43,905 INFO L413 NwaCegarLoop]: 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-28 10:03:43,906 INFO L414 NwaCegarLoop]: 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-28 10:03:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 10:03:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-04-28 10:03:43,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:43,968 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-28 10:03:43,968 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-28 10:03:43,968 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-28 10:03:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:43,969 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-28 10:03:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-28 10:03:43,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:43,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:43,969 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-28 10:03:43,969 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-28 10:03:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:43,970 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-28 10:03:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-28 10:03:43,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:43,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:43,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:43,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:43,971 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-28 10:03:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-04-28 10:03:43,971 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 19 [2022-04-28 10:03:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:43,972 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-04-28 10:03:43,972 INFO L496 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-28 10:03:43,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 34 transitions. [2022-04-28 10:03:44,016 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-28 10:03:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 10:03:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:03:44,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:44,016 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:44,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 10:03:44,217 WARN L477 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-28 10:03:44,217 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:44,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:44,217 INFO L85 PathProgramCache]: Analyzing trace with hash -639378772, now seen corresponding path program 23 times [2022-04-28 10:03:44,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:44,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618429663] [2022-04-28 10:03:44,220 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:44,220 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash -639378772, now seen corresponding path program 24 times [2022-04-28 10:03:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:44,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678085380] [2022-04-28 10:03:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:44,338 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-28 10:03:44,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {5481#true} assume true; {5481#true} is VALID [2022-04-28 10:03:44,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5481#true} {5481#true} #50#return; {5481#true} is VALID [2022-04-28 10:03:44,338 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-28 10:03:44,338 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-28 10:03:44,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {5481#true} assume true; {5481#true} is VALID [2022-04-28 10:03:44,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5481#true} {5481#true} #50#return; {5481#true} is VALID [2022-04-28 10:03:44,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {5481#true} call #t~ret9 := main(); {5481#true} is VALID [2022-04-28 10:03:44,339 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-28 10:03:44,339 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-28 10:03:44,340 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-28 10:03:44,340 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-28 10:03:44,341 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-28 10:03:44,341 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-28 10:03:44,342 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-28 10:03:44,342 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-28 10:03:44,343 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-28 10:03:44,343 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-28 10:03:44,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {5482#false} assume !(~z~0 % 4294967296 > 0); {5482#false} is VALID [2022-04-28 10:03:44,343 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-28 10:03:44,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {5482#false} ~cond := #in~cond; {5482#false} is VALID [2022-04-28 10:03:44,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {5482#false} assume 0 == ~cond; {5482#false} is VALID [2022-04-28 10:03:44,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {5482#false} assume !false; {5482#false} is VALID [2022-04-28 10:03:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:44,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678085380] [2022-04-28 10:03:44,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678085380] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:44,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263831841] [2022-04-28 10:03:44,344 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:03:44,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:44,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:44,345 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-28 10:03:44,346 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-28 10:03:44,380 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:03:44,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:44,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:03:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:44,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:44,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {5481#true} call ULTIMATE.init(); {5481#true} is VALID [2022-04-28 10:03:44,600 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-28 10:03:44,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {5481#true} assume true; {5481#true} is VALID [2022-04-28 10:03:44,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5481#true} {5481#true} #50#return; {5481#true} is VALID [2022-04-28 10:03:44,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {5481#true} call #t~ret9 := main(); {5481#true} is VALID [2022-04-28 10:03:44,601 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-28 10:03:44,601 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-28 10:03:44,603 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-28 10:03:44,603 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-28 10:03:44,603 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-28 10:03:44,604 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-28 10:03:44,604 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-28 10:03:44,605 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-28 10:03:44,605 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-28 10:03:44,606 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-28 10:03:44,606 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-28 10:03:44,606 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-28 10:03:44,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {5482#false} ~cond := #in~cond; {5482#false} is VALID [2022-04-28 10:03:44,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {5482#false} assume 0 == ~cond; {5482#false} is VALID [2022-04-28 10:03:44,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {5482#false} assume !false; {5482#false} is VALID [2022-04-28 10:03:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:44,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:44,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {5482#false} assume !false; {5482#false} is VALID [2022-04-28 10:03:44,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {5482#false} assume 0 == ~cond; {5482#false} is VALID [2022-04-28 10:03:44,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {5482#false} ~cond := #in~cond; {5482#false} is VALID [2022-04-28 10:03:44,791 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-28 10:03:44,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {5568#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5482#false} is VALID [2022-04-28 10:03:44,792 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-28 10:03:44,792 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-28 10:03:44,793 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-28 10:03:44,794 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-28 10:03:44,794 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-28 10:03:44,794 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-28 10:03:44,795 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-28 10:03:44,796 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-28 10:03:44,796 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-28 10:03:44,798 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-28 10:03:44,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {5481#true} call #t~ret9 := main(); {5481#true} is VALID [2022-04-28 10:03:44,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5481#true} {5481#true} #50#return; {5481#true} is VALID [2022-04-28 10:03:44,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {5481#true} assume true; {5481#true} is VALID [2022-04-28 10:03:44,798 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-28 10:03:44,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {5481#true} call ULTIMATE.init(); {5481#true} is VALID [2022-04-28 10:03:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:44,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263831841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:44,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:44,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-04-28 10:03:44,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:44,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618429663] [2022-04-28 10:03:44,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618429663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:44,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:44,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:03:44,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634759260] [2022-04-28 10:03:44,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:44,800 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-28 10:03:44,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:44,800 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-28 10:03:44,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:44,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:03:44,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:44,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:03:44,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:03:44,824 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-28 10:03:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:45,226 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-28 10:03:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:03:45,226 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-28 10:03:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:45,227 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-28 10:03:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 31 transitions. [2022-04-28 10:03:45,227 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-28 10:03:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 31 transitions. [2022-04-28 10:03:45,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 31 transitions. [2022-04-28 10:03:45,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:45,252 INFO L225 Difference]: With dead ends: 38 [2022-04-28 10:03:45,252 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 10:03:45,252 INFO L412 NwaCegarLoop]: 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-28 10:03:45,253 INFO L413 NwaCegarLoop]: 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-28 10:03:45,253 INFO L414 NwaCegarLoop]: 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-28 10:03:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 10:03:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 10:03:45,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:45,304 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-28 10:03:45,304 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-28 10:03:45,304 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-28 10:03:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:45,305 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 10:03:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 10:03:45,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:45,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:45,305 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-28 10:03:45,305 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-28 10:03:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:45,305 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 10:03:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 10:03:45,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:45,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:45,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:45,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:45,306 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-28 10:03:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 10:03:45,306 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2022-04-28 10:03:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:45,306 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 10:03:45,306 INFO L496 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-28 10:03:45,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 10:03:45,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 10:03:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:03:45,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:45,343 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:45,359 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-28 10:03:45,544 WARN L477 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-28 10:03:45,546 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash 327987819, now seen corresponding path program 25 times [2022-04-28 10:03:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:45,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809364209] [2022-04-28 10:03:45,553 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:45,553 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:45,553 INFO L85 PathProgramCache]: Analyzing trace with hash 327987819, now seen corresponding path program 26 times [2022-04-28 10:03:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:45,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683511741] [2022-04-28 10:03:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:45,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:45,682 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-28 10:03:45,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {5824#true} assume true; {5824#true} is VALID [2022-04-28 10:03:45,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5824#true} {5824#true} #50#return; {5824#true} is VALID [2022-04-28 10:03:45,685 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-28 10:03:45,685 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-28 10:03:45,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {5824#true} assume true; {5824#true} is VALID [2022-04-28 10:03:45,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5824#true} {5824#true} #50#return; {5824#true} is VALID [2022-04-28 10:03:45,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {5824#true} call #t~ret9 := main(); {5824#true} is VALID [2022-04-28 10:03:45,686 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-28 10:03:45,686 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-28 10:03:45,687 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-28 10:03:45,687 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-28 10:03:45,688 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-28 10:03:45,688 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-28 10:03:45,689 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-28 10:03:45,690 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-28 10:03:45,691 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-28 10:03:45,691 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-28 10:03:45,692 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-28 10:03:45,692 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-28 10:03:45,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {5825#false} ~cond := #in~cond; {5825#false} is VALID [2022-04-28 10:03:45,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {5825#false} assume 0 == ~cond; {5825#false} is VALID [2022-04-28 10:03:45,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {5825#false} assume !false; {5825#false} is VALID [2022-04-28 10:03:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:45,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:45,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683511741] [2022-04-28 10:03:45,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683511741] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:45,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333601337] [2022-04-28 10:03:45,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:45,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:45,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:45,693 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-28 10:03:45,694 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-28 10:03:45,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:45,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:45,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:03:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:45,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:45,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {5824#true} call ULTIMATE.init(); {5824#true} is VALID [2022-04-28 10:03:45,911 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-28 10:03:45,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {5824#true} assume true; {5824#true} is VALID [2022-04-28 10:03:45,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5824#true} {5824#true} #50#return; {5824#true} is VALID [2022-04-28 10:03:45,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {5824#true} call #t~ret9 := main(); {5824#true} is VALID [2022-04-28 10:03:45,912 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-28 10:03:45,912 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-28 10:03:45,913 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-28 10:03:45,913 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-28 10:03:45,914 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-28 10:03:45,914 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-28 10:03:45,914 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-28 10:03:45,915 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-28 10:03:45,915 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-28 10:03:45,916 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-28 10:03:45,916 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-28 10:03:45,916 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-28 10:03:45,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {5825#false} ~cond := #in~cond; {5825#false} is VALID [2022-04-28 10:03:45,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {5825#false} assume 0 == ~cond; {5825#false} is VALID [2022-04-28 10:03:45,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {5825#false} assume !false; {5825#false} is VALID [2022-04-28 10:03:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:45,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:46,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {5825#false} assume !false; {5825#false} is VALID [2022-04-28 10:03:46,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {5825#false} assume 0 == ~cond; {5825#false} is VALID [2022-04-28 10:03:46,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {5825#false} ~cond := #in~cond; {5825#false} is VALID [2022-04-28 10:03:46,093 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-28 10:03:46,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {5912#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5825#false} is VALID [2022-04-28 10:03:46,094 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-28 10:03:46,095 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-28 10:03:46,095 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-28 10:03:46,096 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-28 10:03:46,096 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-28 10:03:46,097 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-28 10:03:46,097 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-28 10:03:46,098 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-28 10:03:46,098 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-28 10:03:46,099 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-28 10:03:46,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {5824#true} call #t~ret9 := main(); {5824#true} is VALID [2022-04-28 10:03:46,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5824#true} {5824#true} #50#return; {5824#true} is VALID [2022-04-28 10:03:46,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {5824#true} assume true; {5824#true} is VALID [2022-04-28 10:03:46,099 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-28 10:03:46,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {5824#true} call ULTIMATE.init(); {5824#true} is VALID [2022-04-28 10:03:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:46,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333601337] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:46,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:46,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:03:46,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:46,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809364209] [2022-04-28 10:03:46,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809364209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:46,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:46,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:03:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863915565] [2022-04-28 10:03:46,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:46,100 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-28 10:03:46,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:46,100 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-28 10:03:46,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:46,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:03:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:46,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:03:46,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:03:46,114 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-28 10:03:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:46,516 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-28 10:03:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:03:46,516 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-28 10:03:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:46,516 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-28 10:03:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-04-28 10:03:46,517 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-28 10:03:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-04-28 10:03:46,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 34 transitions. [2022-04-28 10:03:46,548 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-28 10:03:46,549 INFO L225 Difference]: With dead ends: 37 [2022-04-28 10:03:46,549 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:03:46,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:03:46,550 INFO L413 NwaCegarLoop]: 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-28 10:03:46,550 INFO L414 NwaCegarLoop]: 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-28 10:03:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:03:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-04-28 10:03:46,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:46,615 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-28 10:03:46,615 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-28 10:03:46,615 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-28 10:03:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:46,616 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 10:03:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 10:03:46,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:46,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:46,616 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-28 10:03:46,616 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-28 10:03:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:46,617 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 10:03:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 10:03:46,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:46,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:46,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:46,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:46,617 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-28 10:03:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-28 10:03:46,618 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2022-04-28 10:03:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:46,618 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-28 10:03:46,618 INFO L496 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-28 10:03:46,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-28 10:03:46,659 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-28 10:03:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 10:03:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:03:46,659 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:46,659 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:46,675 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-28 10:03:46,863 WARN L477 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-28 10:03:46,863 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash -610638132, now seen corresponding path program 27 times [2022-04-28 10:03:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:46,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1746094012] [2022-04-28 10:03:46,869 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:46,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash -610638132, now seen corresponding path program 28 times [2022-04-28 10:03:46,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:46,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712688644] [2022-04-28 10:03:46,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:46,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:47,016 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-28 10:03:47,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-28 10:03:47,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6180#true} {6180#true} #50#return; {6180#true} is VALID [2022-04-28 10:03:47,017 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-28 10:03:47,017 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-28 10:03:47,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-28 10:03:47,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6180#true} {6180#true} #50#return; {6180#true} is VALID [2022-04-28 10:03:47,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {6180#true} call #t~ret9 := main(); {6180#true} is VALID [2022-04-28 10:03:47,017 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-28 10:03:47,018 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-28 10:03:47,018 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-28 10:03:47,019 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-28 10:03:47,019 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-28 10:03:47,020 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-28 10:03:47,020 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-28 10:03:47,027 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-28 10:03:47,027 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-28 10:03:47,028 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-28 10:03:47,028 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-28 10:03:47,028 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-28 10:03:47,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {6181#false} ~cond := #in~cond; {6181#false} is VALID [2022-04-28 10:03:47,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {6181#false} assume 0 == ~cond; {6181#false} is VALID [2022-04-28 10:03:47,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {6181#false} assume !false; {6181#false} is VALID [2022-04-28 10:03:47,029 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-28 10:03:47,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:47,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712688644] [2022-04-28 10:03:47,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712688644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:47,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343119774] [2022-04-28 10:03:47,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:47,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:47,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:47,030 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-28 10:03:47,031 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-28 10:03:47,060 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:47,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:47,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:03:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:47,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:47,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {6180#true} call ULTIMATE.init(); {6180#true} is VALID [2022-04-28 10:03:47,266 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-28 10:03:47,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-28 10:03:47,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6180#true} {6180#true} #50#return; {6180#true} is VALID [2022-04-28 10:03:47,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {6180#true} call #t~ret9 := main(); {6180#true} is VALID [2022-04-28 10:03:47,271 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-28 10:03:47,272 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-28 10:03:47,272 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-28 10:03:47,273 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-28 10:03:47,274 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-28 10:03:47,274 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-28 10:03:47,275 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-28 10:03:47,275 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-28 10:03:47,276 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-28 10:03:47,277 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-28 10:03:47,277 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-28 10:03:47,277 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-28 10:03:47,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {6181#false} ~cond := #in~cond; {6181#false} is VALID [2022-04-28 10:03:47,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {6181#false} assume 0 == ~cond; {6181#false} is VALID [2022-04-28 10:03:47,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {6181#false} assume !false; {6181#false} is VALID [2022-04-28 10:03:47,278 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-28 10:03:47,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:47,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {6181#false} assume !false; {6181#false} is VALID [2022-04-28 10:03:47,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {6181#false} assume 0 == ~cond; {6181#false} is VALID [2022-04-28 10:03:47,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {6181#false} ~cond := #in~cond; {6181#false} is VALID [2022-04-28 10:03:47,472 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-28 10:03:47,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {6268#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6181#false} is VALID [2022-04-28 10:03:47,473 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-28 10:03:47,474 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-28 10:03:47,474 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-28 10:03:47,474 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-28 10:03:47,475 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-28 10:03:47,476 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-28 10:03:47,476 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-28 10:03:47,477 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-28 10:03:47,477 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-28 10:03:47,478 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-28 10:03:47,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {6180#true} call #t~ret9 := main(); {6180#true} is VALID [2022-04-28 10:03:47,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6180#true} {6180#true} #50#return; {6180#true} is VALID [2022-04-28 10:03:47,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-28 10:03:47,478 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-28 10:03:47,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {6180#true} call ULTIMATE.init(); {6180#true} is VALID [2022-04-28 10:03:47,478 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-28 10:03:47,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343119774] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:47,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:47,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:03:47,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:47,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1746094012] [2022-04-28 10:03:47,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1746094012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:47,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:47,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:03:47,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732685918] [2022-04-28 10:03:47,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:47,479 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-28 10:03:47,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:47,480 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-28 10:03:47,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:47,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:03:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:47,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:03:47,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:03:47,496 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-28 10:03:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:48,032 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-28 10:03:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:03:48,032 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-28 10:03:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:48,032 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-28 10:03:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2022-04-28 10:03:48,035 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-28 10:03:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2022-04-28 10:03:48,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 41 transitions. [2022-04-28 10:03:48,066 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-28 10:03:48,066 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:03:48,066 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:03:48,067 INFO L412 NwaCegarLoop]: 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-28 10:03:48,067 INFO L413 NwaCegarLoop]: 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-28 10:03:48,068 INFO L414 NwaCegarLoop]: 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-28 10:03:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:03:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-04-28 10:03:48,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:48,134 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-28 10:03:48,134 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-28 10:03:48,134 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-28 10:03:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:48,135 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-28 10:03:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 10:03:48,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:48,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:48,135 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-28 10:03:48,135 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-28 10:03:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:48,136 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-28 10:03:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 10:03:48,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:48,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:48,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:48,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:48,136 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-28 10:03:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-28 10:03:48,137 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2022-04-28 10:03:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:48,137 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-28 10:03:48,137 INFO L496 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-28 10:03:48,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-28 10:03:48,184 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-28 10:03:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 10:03:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:03:48,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:48,184 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:48,200 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-28 10:03:48,387 WARN L477 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-28 10:03:48,387 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:48,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1195105717, now seen corresponding path program 29 times [2022-04-28 10:03:48,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:48,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1908875638] [2022-04-28 10:03:48,390 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:48,390 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1195105717, now seen corresponding path program 30 times [2022-04-28 10:03:48,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:48,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865165404] [2022-04-28 10:03:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:48,532 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-28 10:03:48,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {6556#true} assume true; {6556#true} is VALID [2022-04-28 10:03:48,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6556#true} {6556#true} #50#return; {6556#true} is VALID [2022-04-28 10:03:48,533 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-28 10:03:48,533 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-28 10:03:48,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {6556#true} assume true; {6556#true} is VALID [2022-04-28 10:03:48,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6556#true} {6556#true} #50#return; {6556#true} is VALID [2022-04-28 10:03:48,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {6556#true} call #t~ret9 := main(); {6556#true} is VALID [2022-04-28 10:03:48,533 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-28 10:03:48,534 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-28 10:03:48,539 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-28 10:03:48,540 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-28 10:03:48,541 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-28 10:03:48,542 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-28 10:03:48,542 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-28 10:03:48,543 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-28 10:03:48,543 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-28 10:03:48,544 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-28 10:03:48,544 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-28 10:03:48,545 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-28 10:03:48,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {6557#false} ~cond := #in~cond; {6557#false} is VALID [2022-04-28 10:03:48,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {6557#false} assume 0 == ~cond; {6557#false} is VALID [2022-04-28 10:03:48,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {6557#false} assume !false; {6557#false} is VALID [2022-04-28 10:03:48,545 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-28 10:03:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:48,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865165404] [2022-04-28 10:03:48,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865165404] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:48,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074828766] [2022-04-28 10:03:48,545 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:03:48,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:48,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:48,546 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-28 10:03:48,547 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-28 10:03:48,581 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:03:48,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:48,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:03:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:48,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:48,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {6556#true} call ULTIMATE.init(); {6556#true} is VALID [2022-04-28 10:03:48,793 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-28 10:03:48,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {6556#true} assume true; {6556#true} is VALID [2022-04-28 10:03:48,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6556#true} {6556#true} #50#return; {6556#true} is VALID [2022-04-28 10:03:48,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {6556#true} call #t~ret9 := main(); {6556#true} is VALID [2022-04-28 10:03:48,793 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-28 10:03:48,794 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-28 10:03:48,794 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-28 10:03:48,795 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-28 10:03:48,795 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-28 10:03:48,796 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-28 10:03:48,796 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-28 10:03:48,797 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-28 10:03:48,797 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-28 10:03:48,797 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-28 10:03:48,798 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-28 10:03:48,798 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-28 10:03:48,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {6557#false} ~cond := #in~cond; {6557#false} is VALID [2022-04-28 10:03:48,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {6557#false} assume 0 == ~cond; {6557#false} is VALID [2022-04-28 10:03:48,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {6557#false} assume !false; {6557#false} is VALID [2022-04-28 10:03:48,798 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-28 10:03:48,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:49,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {6557#false} assume !false; {6557#false} is VALID [2022-04-28 10:03:49,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {6557#false} assume 0 == ~cond; {6557#false} is VALID [2022-04-28 10:03:49,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {6557#false} ~cond := #in~cond; {6557#false} is VALID [2022-04-28 10:03:49,059 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-28 10:03:49,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {6644#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6557#false} is VALID [2022-04-28 10:03:49,060 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-28 10:03:49,061 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-28 10:03:49,061 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-28 10:03:49,062 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-28 10:03:49,062 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-28 10:03:49,063 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-28 10:03:49,064 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-28 10:03:49,064 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-28 10:03:49,065 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-28 10:03:49,065 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-28 10:03:49,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {6556#true} call #t~ret9 := main(); {6556#true} is VALID [2022-04-28 10:03:49,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6556#true} {6556#true} #50#return; {6556#true} is VALID [2022-04-28 10:03:49,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {6556#true} assume true; {6556#true} is VALID [2022-04-28 10:03:49,065 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-28 10:03:49,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {6556#true} call ULTIMATE.init(); {6556#true} is VALID [2022-04-28 10:03:49,066 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-28 10:03:49,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074828766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:49,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:49,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:03:49,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:49,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1908875638] [2022-04-28 10:03:49,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1908875638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:49,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:49,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:03:49,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675702634] [2022-04-28 10:03:49,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:49,067 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-28 10:03:49,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:49,067 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-28 10:03:49,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:49,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:03:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:49,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:03:49,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:03:49,086 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-28 10:03:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:49,723 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 10:03:49,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:03:49,723 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-28 10:03:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:49,723 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-28 10:03:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-28 10:03:49,724 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-28 10:03:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-28 10:03:49,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2022-04-28 10:03:49,762 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-28 10:03:49,763 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:03:49,763 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:03:49,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:03:49,764 INFO L413 NwaCegarLoop]: 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-28 10:03:49,764 INFO L414 NwaCegarLoop]: 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-28 10:03:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:03:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2022-04-28 10:03:49,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:49,831 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-28 10:03:49,831 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-28 10:03:49,831 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-28 10:03:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:49,832 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-28 10:03:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:03:49,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:49,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:49,832 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-28 10:03:49,832 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-28 10:03:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:49,833 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-28 10:03:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:03:49,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:49,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:49,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:49,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:49,833 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-28 10:03:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-28 10:03:49,834 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2022-04-28 10:03:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:49,834 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-28 10:03:49,834 INFO L496 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-28 10:03:49,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-28 10:03:49,893 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-28 10:03:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 10:03:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:03:49,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:49,894 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:49,909 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-28 10:03:50,094 WARN L477 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-28 10:03:50,094 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:50,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1002797804, now seen corresponding path program 13 times [2022-04-28 10:03:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:50,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1685594972] [2022-04-28 10:03:50,097 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:50,097 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:50,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1002797804, now seen corresponding path program 14 times [2022-04-28 10:03:50,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:50,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660123358] [2022-04-28 10:03:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:50,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:50,231 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-28 10:03:50,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-04-28 10:03:50,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6942#true} {6942#true} #50#return; {6942#true} is VALID [2022-04-28 10:03:50,232 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-28 10:03:50,232 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-28 10:03:50,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-04-28 10:03:50,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6942#true} {6942#true} #50#return; {6942#true} is VALID [2022-04-28 10:03:50,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {6942#true} call #t~ret9 := main(); {6942#true} is VALID [2022-04-28 10:03:50,232 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-28 10:03:50,233 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-28 10:03:50,233 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-28 10:03:50,234 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-28 10:03:50,234 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-28 10:03:50,235 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-28 10:03:50,235 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-28 10:03:50,236 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-28 10:03:50,236 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-28 10:03:50,236 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-28 10:03:50,237 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-28 10:03:50,237 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-28 10:03:50,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {6943#false} ~cond := #in~cond; {6943#false} is VALID [2022-04-28 10:03:50,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {6943#false} assume 0 == ~cond; {6943#false} is VALID [2022-04-28 10:03:50,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {6943#false} assume !false; {6943#false} is VALID [2022-04-28 10:03:50,237 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-28 10:03:50,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:50,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660123358] [2022-04-28 10:03:50,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660123358] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:50,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222456712] [2022-04-28 10:03:50,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:50,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:50,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:50,239 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-28 10:03:50,239 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-28 10:03:50,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:50,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:50,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:03:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:50,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:50,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {6942#true} call ULTIMATE.init(); {6942#true} is VALID [2022-04-28 10:03:50,483 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-28 10:03:50,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-04-28 10:03:50,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6942#true} {6942#true} #50#return; {6942#true} is VALID [2022-04-28 10:03:50,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {6942#true} call #t~ret9 := main(); {6942#true} is VALID [2022-04-28 10:03:50,484 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-28 10:03:50,484 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-28 10:03:50,485 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-28 10:03:50,485 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-28 10:03:50,486 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-28 10:03:50,486 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-28 10:03:50,487 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-28 10:03:50,487 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-28 10:03:50,488 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-28 10:03:50,488 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-28 10:03:50,489 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-28 10:03:50,489 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-28 10:03:50,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {6943#false} ~cond := #in~cond; {6943#false} is VALID [2022-04-28 10:03:50,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {6943#false} assume 0 == ~cond; {6943#false} is VALID [2022-04-28 10:03:50,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {6943#false} assume !false; {6943#false} is VALID [2022-04-28 10:03:50,489 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-28 10:03:50,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:50,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {6943#false} assume !false; {6943#false} is VALID [2022-04-28 10:03:50,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {6943#false} assume 0 == ~cond; {6943#false} is VALID [2022-04-28 10:03:50,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {6943#false} ~cond := #in~cond; {6943#false} is VALID [2022-04-28 10:03:50,678 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-28 10:03:50,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {7030#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6943#false} is VALID [2022-04-28 10:03:50,678 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-28 10:03:50,679 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-28 10:03:50,679 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-28 10:03:50,680 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-28 10:03:50,680 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-28 10:03:50,681 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-28 10:03:50,682 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-28 10:03:50,682 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-28 10:03:50,683 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-28 10:03:50,683 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-28 10:03:50,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {6942#true} call #t~ret9 := main(); {6942#true} is VALID [2022-04-28 10:03:50,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6942#true} {6942#true} #50#return; {6942#true} is VALID [2022-04-28 10:03:50,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-04-28 10:03:50,683 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-28 10:03:50,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {6942#true} call ULTIMATE.init(); {6942#true} is VALID [2022-04-28 10:03:50,684 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-28 10:03:50,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222456712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:50,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:50,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:03:50,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:50,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1685594972] [2022-04-28 10:03:50,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1685594972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:50,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:50,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:03:50,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816276178] [2022-04-28 10:03:50,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:50,684 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-28 10:03:50,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:50,685 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-28 10:03:50,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:50,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:03:50,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:50,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:03:50,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:03:50,699 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-28 10:03:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:51,424 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-28 10:03:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:03:51,425 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-28 10:03:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:51,425 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-28 10:03:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-28 10:03:51,426 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-28 10:03:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-28 10:03:51,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 49 transitions. [2022-04-28 10:03:51,483 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-28 10:03:51,484 INFO L225 Difference]: With dead ends: 49 [2022-04-28 10:03:51,484 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 10:03:51,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:03:51,485 INFO L413 NwaCegarLoop]: 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-28 10:03:51,485 INFO L414 NwaCegarLoop]: 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-28 10:03:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 10:03:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-04-28 10:03:51,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:51,556 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-28 10:03:51,556 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-28 10:03:51,556 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-28 10:03:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:51,557 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 10:03:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-04-28 10:03:51,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:51,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:51,557 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-28 10:03:51,557 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-28 10:03:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:51,558 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 10:03:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-04-28 10:03:51,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:51,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:51,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:51,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:51,558 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-28 10:03:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-28 10:03:51,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 20 [2022-04-28 10:03:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:51,559 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-28 10:03:51,559 INFO L496 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-28 10:03:51,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 35 transitions. [2022-04-28 10:03:51,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 10:03:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:03:51,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:51,617 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:51,633 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-28 10:03:51,818 WARN L477 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-28 10:03:51,818 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:51,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:51,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1612182871, now seen corresponding path program 31 times [2022-04-28 10:03:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:51,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275881751] [2022-04-28 10:03:51,821 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:51,821 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:51,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1612182871, now seen corresponding path program 32 times [2022-04-28 10:03:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:51,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919406755] [2022-04-28 10:03:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:51,984 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-28 10:03:51,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {7350#true} assume true; {7350#true} is VALID [2022-04-28 10:03:51,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7350#true} {7350#true} #50#return; {7350#true} is VALID [2022-04-28 10:03:51,985 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-28 10:03:51,985 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-28 10:03:51,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {7350#true} assume true; {7350#true} is VALID [2022-04-28 10:03:51,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7350#true} {7350#true} #50#return; {7350#true} is VALID [2022-04-28 10:03:51,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {7350#true} call #t~ret9 := main(); {7350#true} is VALID [2022-04-28 10:03:51,985 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-28 10:03:51,986 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-28 10:03:51,986 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-28 10:03:51,987 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-28 10:03:51,988 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-28 10:03:51,988 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-28 10:03:51,988 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-28 10:03:51,989 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-28 10:03:51,989 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-28 10:03:51,990 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-28 10:03:51,991 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-28 10:03:51,991 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-28 10:03:51,992 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-28 10:03:51,992 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-28 10:03:51,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {7362#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7351#false} is VALID [2022-04-28 10:03:51,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {7351#false} assume !false; {7351#false} is VALID [2022-04-28 10:03:51,993 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-28 10:03:51,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:51,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919406755] [2022-04-28 10:03:51,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919406755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:51,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070892254] [2022-04-28 10:03:51,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:51,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:51,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:51,994 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-28 10:03:51,995 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-28 10:03:52,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:52,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:52,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:03:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:52,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:52,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {7350#true} call ULTIMATE.init(); {7350#true} is VALID [2022-04-28 10:03:52,198 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-28 10:03:52,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {7350#true} assume true; {7350#true} is VALID [2022-04-28 10:03:52,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7350#true} {7350#true} #50#return; {7350#true} is VALID [2022-04-28 10:03:52,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {7350#true} call #t~ret9 := main(); {7350#true} is VALID [2022-04-28 10:03:52,199 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-28 10:03:52,199 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-28 10:03:52,200 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-28 10:03:52,200 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-28 10:03:52,201 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-28 10:03:52,201 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-28 10:03:52,202 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-28 10:03:52,202 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-28 10:03:52,203 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-28 10:03:52,203 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-28 10:03:52,204 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-28 10:03:52,204 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-28 10:03:52,205 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-28 10:03:52,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {7418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:03:52,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {7422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7351#false} is VALID [2022-04-28 10:03:52,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {7351#false} assume !false; {7351#false} is VALID [2022-04-28 10:03:52,206 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-28 10:03:52,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:52,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {7351#false} assume !false; {7351#false} is VALID [2022-04-28 10:03:52,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {7422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7351#false} is VALID [2022-04-28 10:03:52,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {7418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:03:52,384 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-28 10:03:52,384 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-28 10:03:52,385 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-28 10:03:52,386 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-28 10:03:52,387 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-28 10:03:52,387 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-28 10:03:52,388 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-28 10:03:52,388 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-28 10:03:52,389 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-28 10:03:52,389 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-28 10:03:52,390 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-28 10:03:52,391 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-28 10:03:52,391 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-28 10:03:52,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {7350#true} call #t~ret9 := main(); {7350#true} is VALID [2022-04-28 10:03:52,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7350#true} {7350#true} #50#return; {7350#true} is VALID [2022-04-28 10:03:52,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {7350#true} assume true; {7350#true} is VALID [2022-04-28 10:03:52,392 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-28 10:03:52,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {7350#true} call ULTIMATE.init(); {7350#true} is VALID [2022-04-28 10:03:52,392 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-28 10:03:52,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070892254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:52,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:52,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-04-28 10:03:52,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:52,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275881751] [2022-04-28 10:03:52,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275881751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:52,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:52,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:03:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690113068] [2022-04-28 10:03:52,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:52,393 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-28 10:03:52,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:52,393 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-28 10:03:52,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:52,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:03:52,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:52,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:03:52,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:03:52,409 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-28 10:03:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:52,853 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 10:03:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:03:52,855 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-28 10:03:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:52,855 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-28 10:03:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-28 10:03:52,856 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-28 10:03:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-28 10:03:52,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-28 10:03:52,902 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-28 10:03:52,903 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:03:52,903 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:03:52,903 INFO L412 NwaCegarLoop]: 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-28 10:03:52,904 INFO L413 NwaCegarLoop]: 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-28 10:03:52,904 INFO L414 NwaCegarLoop]: 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-28 10:03:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:03:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-28 10:03:52,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:52,990 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-28 10:03:52,990 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-28 10:03:52,990 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-28 10:03:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:52,990 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 10:03:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-28 10:03:52,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:52,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:52,991 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-28 10:03:52,991 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-28 10:03:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:52,991 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 10:03:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-28 10:03:52,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:52,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:52,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:52,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:52,992 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-28 10:03:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-28 10:03:52,992 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2022-04-28 10:03:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:52,992 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-28 10:03:52,992 INFO L496 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-28 10:03:52,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-28 10:03:53,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 10:03:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:03:53,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:53,047 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:53,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 10:03:53,251 WARN L477 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-28 10:03:53,251 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:53,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1715417834, now seen corresponding path program 33 times [2022-04-28 10:03:53,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:53,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [646646162] [2022-04-28 10:03:53,254 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:53,254 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1715417834, now seen corresponding path program 34 times [2022-04-28 10:03:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:53,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682505844] [2022-04-28 10:03:53,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:53,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:53,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:53,425 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-28 10:03:53,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {7718#true} assume true; {7718#true} is VALID [2022-04-28 10:03:53,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7718#true} {7718#true} #50#return; {7718#true} is VALID [2022-04-28 10:03:53,426 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-28 10:03:53,426 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-28 10:03:53,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {7718#true} assume true; {7718#true} is VALID [2022-04-28 10:03:53,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7718#true} {7718#true} #50#return; {7718#true} is VALID [2022-04-28 10:03:53,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {7718#true} call #t~ret9 := main(); {7718#true} is VALID [2022-04-28 10:03:53,427 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-28 10:03:53,428 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-28 10:03:53,428 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-28 10:03:53,429 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-28 10:03:53,430 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-28 10:03:53,430 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-28 10:03:53,431 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-28 10:03:53,431 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-28 10:03:53,432 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-28 10:03:53,432 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-28 10:03:53,433 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-28 10:03:53,433 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-28 10:03:53,434 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-28 10:03:53,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {7719#false} ~cond := #in~cond; {7719#false} is VALID [2022-04-28 10:03:53,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {7719#false} assume 0 == ~cond; {7719#false} is VALID [2022-04-28 10:03:53,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {7719#false} assume !false; {7719#false} is VALID [2022-04-28 10:03:53,434 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-28 10:03:53,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:53,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682505844] [2022-04-28 10:03:53,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682505844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:53,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594175718] [2022-04-28 10:03:53,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:53,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:53,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:53,436 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-28 10:03:53,459 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-28 10:03:53,478 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:53,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:53,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:03:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:53,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:53,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {7718#true} call ULTIMATE.init(); {7718#true} is VALID [2022-04-28 10:03:53,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-28 10:03:53,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {7718#true} assume true; {7718#true} is VALID [2022-04-28 10:03:53,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7718#true} {7718#true} #50#return; {7718#true} is VALID [2022-04-28 10:03:53,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {7718#true} call #t~ret9 := main(); {7718#true} is VALID [2022-04-28 10:03:53,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-28 10:03:53,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-28 10:03:53,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-28 10:03:53,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-28 10:03:53,716 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-28 10:03:53,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-28 10:03:53,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-28 10:03:53,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-28 10:03:53,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-28 10:03:53,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-28 10:03:53,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-28 10:03:53,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-28 10:03:53,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-28 10:03:53,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {7719#false} ~cond := #in~cond; {7719#false} is VALID [2022-04-28 10:03:53,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {7719#false} assume 0 == ~cond; {7719#false} is VALID [2022-04-28 10:03:53,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {7719#false} assume !false; {7719#false} is VALID [2022-04-28 10:03:53,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-28 10:03:53,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:53,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {7719#false} assume !false; {7719#false} is VALID [2022-04-28 10:03:53,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {7719#false} assume 0 == ~cond; {7719#false} is VALID [2022-04-28 10:03:53,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {7719#false} ~cond := #in~cond; {7719#false} is VALID [2022-04-28 10:03:53,945 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-28 10:03:53,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {7810#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7719#false} is VALID [2022-04-28 10:03:53,946 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-28 10:03:53,947 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-28 10:03:53,947 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-28 10:03:53,948 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-28 10:03:53,948 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-28 10:03:53,949 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-28 10:03:53,949 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-28 10:03:53,950 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-28 10:03:53,951 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-28 10:03:53,951 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-28 10:03:53,952 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-28 10:03:53,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {7718#true} call #t~ret9 := main(); {7718#true} is VALID [2022-04-28 10:03:53,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7718#true} {7718#true} #50#return; {7718#true} is VALID [2022-04-28 10:03:53,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {7718#true} assume true; {7718#true} is VALID [2022-04-28 10:03:53,952 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-28 10:03:53,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {7718#true} call ULTIMATE.init(); {7718#true} is VALID [2022-04-28 10:03:53,952 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-28 10:03:53,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594175718] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:53,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:53,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:03:53,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:53,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [646646162] [2022-04-28 10:03:53,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [646646162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:53,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:53,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:03:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953046999] [2022-04-28 10:03:53,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:53,953 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-28 10:03:53,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:53,953 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-28 10:03:53,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:53,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:03:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:53,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:03:53,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:03:53,968 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-28 10:03:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:54,751 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-28 10:03:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:03:54,752 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-28 10:03:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:54,752 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-28 10:03:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2022-04-28 10:03:54,752 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-28 10:03:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2022-04-28 10:03:54,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 43 transitions. [2022-04-28 10:03:54,784 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-28 10:03:54,785 INFO L225 Difference]: With dead ends: 46 [2022-04-28 10:03:54,785 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 10:03:54,785 INFO L412 NwaCegarLoop]: 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-28 10:03:54,785 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:54,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 54 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:03:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 10:03:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-04-28 10:03:54,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:54,891 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-28 10:03:54,891 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-28 10:03:54,891 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-28 10:03:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:54,892 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 10:03:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-28 10:03:54,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:54,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:54,892 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-28 10:03:54,893 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-28 10:03:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:54,893 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 10:03:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-28 10:03:54,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:54,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:54,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:54,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:54,893 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-28 10:03:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-28 10:03:54,894 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2022-04-28 10:03:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:54,894 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-28 10:03:54,894 INFO L496 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-28 10:03:54,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-28 10:03:54,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 10:03:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:03:54,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:54,951 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:54,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 10:03:55,151 WARN L477 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-28 10:03:55,152 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1640923511, now seen corresponding path program 35 times [2022-04-28 10:03:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:55,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1780648348] [2022-04-28 10:03:55,155 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:55,155 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:55,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1640923511, now seen corresponding path program 36 times [2022-04-28 10:03:55,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:55,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864130702] [2022-04-28 10:03:55,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:55,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:55,326 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-28 10:03:55,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {8132#true} assume true; {8132#true} is VALID [2022-04-28 10:03:55,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8132#true} {8132#true} #50#return; {8132#true} is VALID [2022-04-28 10:03:55,327 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-28 10:03:55,327 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-28 10:03:55,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {8132#true} assume true; {8132#true} is VALID [2022-04-28 10:03:55,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8132#true} {8132#true} #50#return; {8132#true} is VALID [2022-04-28 10:03:55,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {8132#true} call #t~ret9 := main(); {8132#true} is VALID [2022-04-28 10:03:55,327 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-28 10:03:55,328 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-28 10:03:55,328 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-28 10:03:55,329 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-28 10:03:55,330 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-28 10:03:55,330 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-28 10:03:55,331 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-28 10:03:55,332 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-28 10:03:55,332 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-28 10:03:55,333 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-28 10:03:55,333 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-28 10:03:55,334 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-28 10:03:55,334 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-28 10:03:55,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {8133#false} ~cond := #in~cond; {8133#false} is VALID [2022-04-28 10:03:55,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {8133#false} assume 0 == ~cond; {8133#false} is VALID [2022-04-28 10:03:55,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {8133#false} assume !false; {8133#false} is VALID [2022-04-28 10:03:55,334 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-28 10:03:55,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:55,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864130702] [2022-04-28 10:03:55,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864130702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:55,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618227585] [2022-04-28 10:03:55,335 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:03:55,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:55,345 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-28 10:03:55,371 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-28 10:03:55,412 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:03:55,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:55,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:03:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:55,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:55,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {8132#true} call ULTIMATE.init(); {8132#true} is VALID [2022-04-28 10:03:55,614 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-28 10:03:55,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {8132#true} assume true; {8132#true} is VALID [2022-04-28 10:03:55,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8132#true} {8132#true} #50#return; {8132#true} is VALID [2022-04-28 10:03:55,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {8132#true} call #t~ret9 := main(); {8132#true} is VALID [2022-04-28 10:03:55,615 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-28 10:03:55,615 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-28 10:03:55,616 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-28 10:03:55,616 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-28 10:03:55,617 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-28 10:03:55,617 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-28 10:03:55,618 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-28 10:03:55,618 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-28 10:03:55,618 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-28 10:03:55,619 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-28 10:03:55,619 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-28 10:03:55,620 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-28 10:03:55,620 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-28 10:03:55,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {8133#false} ~cond := #in~cond; {8133#false} is VALID [2022-04-28 10:03:55,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {8133#false} assume 0 == ~cond; {8133#false} is VALID [2022-04-28 10:03:55,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {8133#false} assume !false; {8133#false} is VALID [2022-04-28 10:03:55,620 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-28 10:03:55,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:55,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {8133#false} assume !false; {8133#false} is VALID [2022-04-28 10:03:55,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {8133#false} assume 0 == ~cond; {8133#false} is VALID [2022-04-28 10:03:55,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {8133#false} ~cond := #in~cond; {8133#false} is VALID [2022-04-28 10:03:55,825 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-28 10:03:55,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {8224#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8133#false} is VALID [2022-04-28 10:03:55,827 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-28 10:03:55,827 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-28 10:03:55,828 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-28 10:03:55,828 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-28 10:03:55,829 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-28 10:03:55,829 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-28 10:03:55,830 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-28 10:03:55,830 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-28 10:03:55,831 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-28 10:03:55,832 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-28 10:03:55,832 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-28 10:03:55,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {8132#true} call #t~ret9 := main(); {8132#true} is VALID [2022-04-28 10:03:55,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8132#true} {8132#true} #50#return; {8132#true} is VALID [2022-04-28 10:03:55,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {8132#true} assume true; {8132#true} is VALID [2022-04-28 10:03:55,832 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-28 10:03:55,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {8132#true} call ULTIMATE.init(); {8132#true} is VALID [2022-04-28 10:03:55,832 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-28 10:03:55,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618227585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:55,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:55,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:03:55,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:55,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1780648348] [2022-04-28 10:03:55,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1780648348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:55,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:55,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:03:55,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959385943] [2022-04-28 10:03:55,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:55,834 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-28 10:03:55,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:55,834 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-28 10:03:55,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:55,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:03:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:55,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:03:55,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:03:55,851 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-28 10:03:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:56,714 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-28 10:03:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:03:56,714 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-28 10:03:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:56,714 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-28 10:03:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2022-04-28 10:03:56,715 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-28 10:03:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2022-04-28 10:03:56,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 48 transitions. [2022-04-28 10:03:56,764 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-28 10:03:56,764 INFO L225 Difference]: With dead ends: 50 [2022-04-28 10:03:56,764 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 10:03:56,765 INFO L412 NwaCegarLoop]: 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-28 10:03:56,765 INFO L413 NwaCegarLoop]: 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-28 10:03:56,766 INFO L414 NwaCegarLoop]: 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-28 10:03:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 10:03:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-04-28 10:03:56,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:56,861 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-28 10:03:56,861 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-28 10:03:56,861 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-28 10:03:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:56,862 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-28 10:03:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-28 10:03:56,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:56,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:56,863 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-28 10:03:56,863 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-28 10:03:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:56,863 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-28 10:03:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-28 10:03:56,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:56,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:56,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:56,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:56,864 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-28 10:03:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-28 10:03:56,864 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2022-04-28 10:03:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:56,865 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-28 10:03:56,865 INFO L496 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-28 10:03:56,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-28 10:03:56,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 10:03:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:03:56,926 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:56,926 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:56,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 10:03:57,127 WARN L477 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-28 10:03:57,127 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1056455926, now seen corresponding path program 37 times [2022-04-28 10:03:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:57,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105145105] [2022-04-28 10:03:57,129 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:57,130 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1056455926, now seen corresponding path program 38 times [2022-04-28 10:03:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076750806] [2022-04-28 10:03:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:57,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:57,280 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-28 10:03:57,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {8562#true} assume true; {8562#true} is VALID [2022-04-28 10:03:57,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8562#true} {8562#true} #50#return; {8562#true} is VALID [2022-04-28 10:03:57,281 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-28 10:03:57,281 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-28 10:03:57,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {8562#true} assume true; {8562#true} is VALID [2022-04-28 10:03:57,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8562#true} {8562#true} #50#return; {8562#true} is VALID [2022-04-28 10:03:57,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {8562#true} call #t~ret9 := main(); {8562#true} is VALID [2022-04-28 10:03:57,282 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-28 10:03:57,282 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-28 10:03:57,282 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-28 10:03:57,283 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-28 10:03:57,283 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-28 10:03:57,284 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-28 10:03:57,285 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-28 10:03:57,285 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-28 10:03:57,285 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-28 10:03:57,286 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-28 10:03:57,286 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-28 10:03:57,287 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-28 10:03:57,287 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-28 10:03:57,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {8563#false} ~cond := #in~cond; {8563#false} is VALID [2022-04-28 10:03:57,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {8563#false} assume 0 == ~cond; {8563#false} is VALID [2022-04-28 10:03:57,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {8563#false} assume !false; {8563#false} is VALID [2022-04-28 10:03:57,287 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-28 10:03:57,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:57,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076750806] [2022-04-28 10:03:57,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076750806] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:57,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332457929] [2022-04-28 10:03:57,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:57,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:57,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:57,288 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-28 10:03:57,289 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-28 10:03:57,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:57,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:57,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:03:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:57,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:57,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {8562#true} call ULTIMATE.init(); {8562#true} is VALID [2022-04-28 10:03:57,515 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-28 10:03:57,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {8562#true} assume true; {8562#true} is VALID [2022-04-28 10:03:57,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8562#true} {8562#true} #50#return; {8562#true} is VALID [2022-04-28 10:03:57,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {8562#true} call #t~ret9 := main(); {8562#true} is VALID [2022-04-28 10:03:57,515 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-28 10:03:57,516 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-28 10:03:57,516 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-28 10:03:57,517 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-28 10:03:57,517 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-28 10:03:57,518 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-28 10:03:57,518 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-28 10:03:57,519 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-28 10:03:57,519 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-28 10:03:57,520 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-28 10:03:57,520 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-28 10:03:57,521 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-28 10:03:57,521 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-28 10:03:57,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {8563#false} ~cond := #in~cond; {8563#false} is VALID [2022-04-28 10:03:57,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {8563#false} assume 0 == ~cond; {8563#false} is VALID [2022-04-28 10:03:57,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {8563#false} assume !false; {8563#false} is VALID [2022-04-28 10:03:57,521 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-28 10:03:57,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:57,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {8563#false} assume !false; {8563#false} is VALID [2022-04-28 10:03:57,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {8563#false} assume 0 == ~cond; {8563#false} is VALID [2022-04-28 10:03:57,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {8563#false} ~cond := #in~cond; {8563#false} is VALID [2022-04-28 10:03:57,732 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-28 10:03:57,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {8654#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8563#false} is VALID [2022-04-28 10:03:57,740 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-28 10:03:57,741 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-28 10:03:57,741 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-28 10:03:57,742 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-28 10:03:57,743 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-28 10:03:57,744 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-28 10:03:57,745 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-28 10:03:57,745 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-28 10:03:57,746 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-28 10:03:57,747 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-28 10:03:57,748 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-28 10:03:57,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {8562#true} call #t~ret9 := main(); {8562#true} is VALID [2022-04-28 10:03:57,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8562#true} {8562#true} #50#return; {8562#true} is VALID [2022-04-28 10:03:57,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {8562#true} assume true; {8562#true} is VALID [2022-04-28 10:03:57,748 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-28 10:03:57,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {8562#true} call ULTIMATE.init(); {8562#true} is VALID [2022-04-28 10:03:57,748 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-28 10:03:57,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332457929] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:57,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:57,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:03:57,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:57,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105145105] [2022-04-28 10:03:57,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105145105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:57,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:57,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:03:57,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998445629] [2022-04-28 10:03:57,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:57,749 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-28 10:03:57,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:57,750 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-28 10:03:57,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:57,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:03:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:57,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:03:57,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:03:57,765 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-28 10:03:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:58,671 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-28 10:03:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:03:58,672 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-28 10:03:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:58,672 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-28 10:03:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-28 10:03:58,673 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-28 10:03:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-28 10:03:58,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 51 transitions. [2022-04-28 10:03:58,721 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-28 10:03:58,721 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:03:58,721 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 10:03:58,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:03:58,723 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:58,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 77 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:03:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 10:03:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2022-04-28 10:03:58,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:58,840 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-28 10:03:58,840 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-28 10:03:58,840 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-28 10:03:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:58,840 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-04-28 10:03:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 10:03:58,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:58,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:58,841 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-28 10:03:58,841 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-28 10:03:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:58,842 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-04-28 10:03:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 10:03:58,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:58,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:58,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:58,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:58,842 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-28 10:03:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-28 10:03:58,845 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2022-04-28 10:03:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:58,845 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-28 10:03:58,845 INFO L496 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-28 10:03:58,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-28 10:03:58,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 10:03:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:03:58,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:58,912 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:58,937 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-28 10:03:59,112 WARN L477 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-28 10:03:59,112 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:59,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1040607849, now seen corresponding path program 15 times [2022-04-28 10:03:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:59,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [121977360] [2022-04-28 10:03:59,115 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:59,115 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1040607849, now seen corresponding path program 16 times [2022-04-28 10:03:59,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:59,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132074201] [2022-04-28 10:03:59,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:59,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:59,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:59,277 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-28 10:03:59,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {9000#true} assume true; {9000#true} is VALID [2022-04-28 10:03:59,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9000#true} {9000#true} #50#return; {9000#true} is VALID [2022-04-28 10:03:59,278 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-28 10:03:59,278 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-28 10:03:59,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {9000#true} assume true; {9000#true} is VALID [2022-04-28 10:03:59,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9000#true} {9000#true} #50#return; {9000#true} is VALID [2022-04-28 10:03:59,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {9000#true} call #t~ret9 := main(); {9000#true} is VALID [2022-04-28 10:03:59,278 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-28 10:03:59,279 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-28 10:03:59,279 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-28 10:03:59,280 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-28 10:03:59,281 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-28 10:03:59,281 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-28 10:03:59,282 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-28 10:03:59,283 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-28 10:03:59,283 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-28 10:03:59,284 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-28 10:03:59,284 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-28 10:03:59,285 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-28 10:03:59,285 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-28 10:03:59,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {9001#false} ~cond := #in~cond; {9001#false} is VALID [2022-04-28 10:03:59,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {9001#false} assume 0 == ~cond; {9001#false} is VALID [2022-04-28 10:03:59,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {9001#false} assume !false; {9001#false} is VALID [2022-04-28 10:03:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:59,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:59,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132074201] [2022-04-28 10:03:59,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132074201] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:59,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935307804] [2022-04-28 10:03:59,286 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:59,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:59,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:59,287 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-28 10:03:59,288 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-28 10:03:59,326 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:59,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:59,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:03:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:59,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:59,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {9000#true} call ULTIMATE.init(); {9000#true} is VALID [2022-04-28 10:03:59,538 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-28 10:03:59,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {9000#true} assume true; {9000#true} is VALID [2022-04-28 10:03:59,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9000#true} {9000#true} #50#return; {9000#true} is VALID [2022-04-28 10:03:59,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {9000#true} call #t~ret9 := main(); {9000#true} is VALID [2022-04-28 10:03:59,538 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-28 10:03:59,539 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-28 10:03:59,539 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-28 10:03:59,540 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-28 10:03:59,540 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-28 10:03:59,541 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-28 10:03:59,541 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-28 10:03:59,542 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-28 10:03:59,542 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-28 10:03:59,543 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-28 10:03:59,543 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-28 10:03:59,543 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-28 10:03:59,543 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-28 10:03:59,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {9001#false} ~cond := #in~cond; {9001#false} is VALID [2022-04-28 10:03:59,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {9001#false} assume 0 == ~cond; {9001#false} is VALID [2022-04-28 10:03:59,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {9001#false} assume !false; {9001#false} is VALID [2022-04-28 10:03:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:59,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:59,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {9001#false} assume !false; {9001#false} is VALID [2022-04-28 10:03:59,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {9001#false} assume 0 == ~cond; {9001#false} is VALID [2022-04-28 10:03:59,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {9001#false} ~cond := #in~cond; {9001#false} is VALID [2022-04-28 10:03:59,763 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-28 10:03:59,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {9092#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9001#false} is VALID [2022-04-28 10:03:59,764 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-28 10:03:59,764 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-28 10:03:59,765 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-28 10:03:59,765 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-28 10:03:59,766 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-28 10:03:59,766 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-28 10:03:59,767 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-28 10:03:59,768 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-28 10:03:59,768 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-28 10:03:59,769 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-28 10:03:59,769 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-28 10:03:59,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {9000#true} call #t~ret9 := main(); {9000#true} is VALID [2022-04-28 10:03:59,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9000#true} {9000#true} #50#return; {9000#true} is VALID [2022-04-28 10:03:59,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {9000#true} assume true; {9000#true} is VALID [2022-04-28 10:03:59,769 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-28 10:03:59,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {9000#true} call ULTIMATE.init(); {9000#true} is VALID [2022-04-28 10:03:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:59,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935307804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:59,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:59,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:03:59,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:59,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [121977360] [2022-04-28 10:03:59,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [121977360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:59,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:59,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:03:59,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762742118] [2022-04-28 10:03:59,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:59,771 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-28 10:03:59,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:59,771 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-28 10:03:59,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:59,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:03:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:03:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:03:59,785 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-28 10:04:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:00,777 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-28 10:04:00,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:04:00,777 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-28 10:04:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:00,777 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-28 10:04:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-28 10:04:00,778 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-28 10:04:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-28 10:04:00,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 55 transitions. [2022-04-28 10:04:00,836 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-28 10:04:00,836 INFO L225 Difference]: With dead ends: 58 [2022-04-28 10:04:00,836 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 10:04:00,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:04:00,837 INFO L413 NwaCegarLoop]: 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-28 10:04:00,838 INFO L414 NwaCegarLoop]: 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-28 10:04:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 10:04:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-04-28 10:04:00,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:00,938 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-28 10:04:00,939 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-28 10:04:00,939 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-28 10:04:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:00,940 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-28 10:04:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-28 10:04:00,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:00,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:00,940 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-28 10:04:00,940 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-28 10:04:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:00,941 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-28 10:04:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-28 10:04:00,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:00,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:00,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:00,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:00,942 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-28 10:04:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-28 10:04:00,942 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 21 [2022-04-28 10:04:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:00,943 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-28 10:04:00,943 INFO L496 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-28 10:04:00,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-28 10:04:01,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-28 10:04:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:04:01,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:01,021 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:01,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 10:04:01,221 WARN L477 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-28 10:04:01,221 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:01,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1527443477, now seen corresponding path program 39 times [2022-04-28 10:04:01,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:01,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1516019211] [2022-04-28 10:04:01,224 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:01,224 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:01,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1527443477, now seen corresponding path program 40 times [2022-04-28 10:04:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:01,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37843768] [2022-04-28 10:04:01,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:01,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:01,357 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-28 10:04:01,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {9460#true} assume true; {9460#true} is VALID [2022-04-28 10:04:01,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9460#true} {9460#true} #50#return; {9460#true} is VALID [2022-04-28 10:04:01,357 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-28 10:04:01,357 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-28 10:04:01,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {9460#true} assume true; {9460#true} is VALID [2022-04-28 10:04:01,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9460#true} {9460#true} #50#return; {9460#true} is VALID [2022-04-28 10:04:01,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {9460#true} call #t~ret9 := main(); {9460#true} is VALID [2022-04-28 10:04:01,358 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-28 10:04:01,358 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-28 10:04:01,359 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-28 10:04:01,359 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-28 10:04:01,360 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-28 10:04:01,375 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-28 10:04:01,376 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-28 10:04:01,376 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-28 10:04:01,377 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-28 10:04:01,378 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-28 10:04:01,378 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-28 10:04:01,379 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-28 10:04:01,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {9461#false} assume !(~z~0 % 4294967296 > 0); {9461#false} is VALID [2022-04-28 10:04:01,379 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-28 10:04:01,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {9461#false} ~cond := #in~cond; {9461#false} is VALID [2022-04-28 10:04:01,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {9461#false} assume 0 == ~cond; {9461#false} is VALID [2022-04-28 10:04:01,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {9461#false} assume !false; {9461#false} is VALID [2022-04-28 10:04:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:01,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:01,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37843768] [2022-04-28 10:04:01,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37843768] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:01,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855989737] [2022-04-28 10:04:01,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:01,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:01,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:01,381 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-28 10:04:01,383 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-28 10:04:01,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:01,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:01,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:04:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:01,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:01,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {9460#true} call ULTIMATE.init(); {9460#true} is VALID [2022-04-28 10:04:01,633 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-28 10:04:01,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {9460#true} assume true; {9460#true} is VALID [2022-04-28 10:04:01,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9460#true} {9460#true} #50#return; {9460#true} is VALID [2022-04-28 10:04:01,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {9460#true} call #t~ret9 := main(); {9460#true} is VALID [2022-04-28 10:04:01,634 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-28 10:04:01,634 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-28 10:04:01,635 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-28 10:04:01,636 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-28 10:04:01,636 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-28 10:04:01,637 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-28 10:04:01,637 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-28 10:04:01,638 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-28 10:04:01,639 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-28 10:04:01,639 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-28 10:04:01,640 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-28 10:04:01,641 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-28 10:04:01,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {9461#false} assume !(~z~0 % 4294967296 > 0); {9461#false} is VALID [2022-04-28 10:04:01,641 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-28 10:04:01,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {9461#false} ~cond := #in~cond; {9461#false} is VALID [2022-04-28 10:04:01,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {9461#false} assume 0 == ~cond; {9461#false} is VALID [2022-04-28 10:04:01,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {9461#false} assume !false; {9461#false} is VALID [2022-04-28 10:04:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:01,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:01,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {9461#false} assume !false; {9461#false} is VALID [2022-04-28 10:04:01,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {9461#false} assume 0 == ~cond; {9461#false} is VALID [2022-04-28 10:04:01,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {9461#false} ~cond := #in~cond; {9461#false} is VALID [2022-04-28 10:04:01,905 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-28 10:04:01,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {9461#false} assume !(~z~0 % 4294967296 > 0); {9461#false} is VALID [2022-04-28 10:04:01,907 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-28 10:04:01,908 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-28 10:04:01,909 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-28 10:04:01,909 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-28 10:04:01,910 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-28 10:04:01,911 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-28 10:04:01,911 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-28 10:04:01,912 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-28 10:04:01,913 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-28 10:04:01,913 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-28 10:04:01,914 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-28 10:04:01,915 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-28 10:04:01,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {9460#true} call #t~ret9 := main(); {9460#true} is VALID [2022-04-28 10:04:01,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9460#true} {9460#true} #50#return; {9460#true} is VALID [2022-04-28 10:04:01,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {9460#true} assume true; {9460#true} is VALID [2022-04-28 10:04:01,915 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-28 10:04:01,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {9460#true} call ULTIMATE.init(); {9460#true} is VALID [2022-04-28 10:04:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:01,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855989737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:01,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:01,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-04-28 10:04:01,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:01,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1516019211] [2022-04-28 10:04:01,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1516019211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:01,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:01,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:04:01,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683062877] [2022-04-28 10:04:01,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:01,917 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-28 10:04:01,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:01,917 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-28 10:04:01,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:01,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:04:01,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:01,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:04:01,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:04:01,943 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-28 10:04:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:02,528 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-28 10:04:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:04:02,528 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-28 10:04:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:02,529 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-28 10:04:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 33 transitions. [2022-04-28 10:04:02,529 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-28 10:04:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 33 transitions. [2022-04-28 10:04:02,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 33 transitions. [2022-04-28 10:04:02,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:02,562 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:04:02,562 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 10:04:02,562 INFO L412 NwaCegarLoop]: 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-28 10:04:02,563 INFO L413 NwaCegarLoop]: 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-28 10:04:02,563 INFO L414 NwaCegarLoop]: 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-28 10:04:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 10:04:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 10:04:02,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:02,644 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-28 10:04:02,644 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-28 10:04:02,644 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-28 10:04:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:02,645 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 10:04:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 10:04:02,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:02,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:02,645 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-28 10:04:02,645 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-28 10:04:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:02,646 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 10:04:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 10:04:02,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:02,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:02,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:02,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:02,647 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-28 10:04:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-28 10:04:02,647 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 22 [2022-04-28 10:04:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:02,647 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-28 10:04:02,647 INFO L496 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-28 10:04:02,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-28 10:04:02,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 10:04:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:04:02,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:02,707 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:02,723 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-28 10:04:02,908 WARN L477 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-28 10:04:02,908 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:02,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1603850228, now seen corresponding path program 41 times [2022-04-28 10:04:02,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:02,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328063811] [2022-04-28 10:04:02,911 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:02,911 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1603850228, now seen corresponding path program 42 times [2022-04-28 10:04:02,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:02,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598665029] [2022-04-28 10:04:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:03,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:03,086 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-28 10:04:03,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {9847#true} assume true; {9847#true} is VALID [2022-04-28 10:04:03,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9847#true} {9847#true} #50#return; {9847#true} is VALID [2022-04-28 10:04:03,087 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-28 10:04:03,087 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-28 10:04:03,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {9847#true} assume true; {9847#true} is VALID [2022-04-28 10:04:03,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9847#true} {9847#true} #50#return; {9847#true} is VALID [2022-04-28 10:04:03,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {9847#true} call #t~ret9 := main(); {9847#true} is VALID [2022-04-28 10:04:03,087 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-28 10:04:03,088 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-28 10:04:03,088 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-28 10:04:03,089 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-28 10:04:03,090 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-28 10:04:03,090 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-28 10:04:03,091 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-28 10:04:03,091 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-28 10:04:03,092 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-28 10:04:03,093 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-28 10:04:03,093 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-28 10:04:03,094 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-28 10:04:03,094 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-28 10:04:03,094 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-28 10:04:03,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {9848#false} ~cond := #in~cond; {9848#false} is VALID [2022-04-28 10:04:03,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {9848#false} assume 0 == ~cond; {9848#false} is VALID [2022-04-28 10:04:03,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {9848#false} assume !false; {9848#false} is VALID [2022-04-28 10:04:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:03,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598665029] [2022-04-28 10:04:03,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598665029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:03,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796459137] [2022-04-28 10:04:03,095 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:03,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:03,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:03,100 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-28 10:04:03,123 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-28 10:04:03,144 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:04:03,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:03,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:04:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:03,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:03,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {9847#true} call ULTIMATE.init(); {9847#true} is VALID [2022-04-28 10:04:03,360 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-28 10:04:03,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {9847#true} assume true; {9847#true} is VALID [2022-04-28 10:04:03,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9847#true} {9847#true} #50#return; {9847#true} is VALID [2022-04-28 10:04:03,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {9847#true} call #t~ret9 := main(); {9847#true} is VALID [2022-04-28 10:04:03,360 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-28 10:04:03,361 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-28 10:04:03,361 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-28 10:04:03,362 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-28 10:04:03,362 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-28 10:04:03,363 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-28 10:04:03,363 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-28 10:04:03,363 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-28 10:04:03,364 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-28 10:04:03,364 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-28 10:04:03,365 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-28 10:04:03,365 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-28 10:04:03,366 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-28 10:04:03,366 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-28 10:04:03,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {9848#false} ~cond := #in~cond; {9848#false} is VALID [2022-04-28 10:04:03,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {9848#false} assume 0 == ~cond; {9848#false} is VALID [2022-04-28 10:04:03,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {9848#false} assume !false; {9848#false} is VALID [2022-04-28 10:04:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:03,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:03,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {9848#false} assume !false; {9848#false} is VALID [2022-04-28 10:04:03,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {9848#false} assume 0 == ~cond; {9848#false} is VALID [2022-04-28 10:04:03,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {9848#false} ~cond := #in~cond; {9848#false} is VALID [2022-04-28 10:04:03,592 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-28 10:04:03,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {9943#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9848#false} is VALID [2022-04-28 10:04:03,593 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-28 10:04:03,594 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-28 10:04:03,594 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-28 10:04:03,595 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-28 10:04:03,595 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-28 10:04:03,595 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-28 10:04:03,596 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-28 10:04:03,597 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-28 10:04:03,597 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-28 10:04:03,598 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-28 10:04:03,599 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-28 10:04:03,599 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-28 10:04:03,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {9847#true} call #t~ret9 := main(); {9847#true} is VALID [2022-04-28 10:04:03,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9847#true} {9847#true} #50#return; {9847#true} is VALID [2022-04-28 10:04:03,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {9847#true} assume true; {9847#true} is VALID [2022-04-28 10:04:03,599 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-28 10:04:03,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {9847#true} call ULTIMATE.init(); {9847#true} is VALID [2022-04-28 10:04:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:03,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796459137] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:03,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:03,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:04:03,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328063811] [2022-04-28 10:04:03,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328063811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:03,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:03,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:04:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593210260] [2022-04-28 10:04:03,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:03,600 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-28 10:04:03,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:03,600 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-28 10:04:03,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:03,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:04:03,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:03,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:04:03,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:04:03,616 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-28 10:04:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:04,208 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-28 10:04:04,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:04:04,209 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-28 10:04:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:04,209 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-28 10:04:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2022-04-28 10:04:04,209 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-28 10:04:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2022-04-28 10:04:04,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 36 transitions. [2022-04-28 10:04:04,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:04,244 INFO L225 Difference]: With dead ends: 42 [2022-04-28 10:04:04,244 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 10:04:04,244 INFO L412 NwaCegarLoop]: 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-28 10:04:04,245 INFO L413 NwaCegarLoop]: 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-28 10:04:04,245 INFO L414 NwaCegarLoop]: 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-28 10:04:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 10:04:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-04-28 10:04:04,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:04,352 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-28 10:04:04,352 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-28 10:04:04,352 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-28 10:04:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:04,353 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 10:04:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-28 10:04:04,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:04,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:04,353 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-28 10:04:04,353 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-28 10:04:04,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:04,353 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 10:04:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-28 10:04:04,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:04,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:04,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:04,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:04,354 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-28 10:04:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-28 10:04:04,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2022-04-28 10:04:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:04,354 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-28 10:04:04,354 INFO L496 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-28 10:04:04,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-28 10:04:04,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 10:04:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:04:04,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:04,441 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:04,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 10:04:04,655 WARN L477 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-28 10:04:04,655 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:04,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash -636483637, now seen corresponding path program 43 times [2022-04-28 10:04:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:04,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655361953] [2022-04-28 10:04:04,658 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:04,658 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash -636483637, now seen corresponding path program 44 times [2022-04-28 10:04:04,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:04,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052784684] [2022-04-28 10:04:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:04,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:04,832 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-28 10:04:04,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {10251#true} assume true; {10251#true} is VALID [2022-04-28 10:04:04,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10251#true} {10251#true} #50#return; {10251#true} is VALID [2022-04-28 10:04:04,833 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-28 10:04:04,833 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-28 10:04:04,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {10251#true} assume true; {10251#true} is VALID [2022-04-28 10:04:04,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10251#true} {10251#true} #50#return; {10251#true} is VALID [2022-04-28 10:04:04,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {10251#true} call #t~ret9 := main(); {10251#true} is VALID [2022-04-28 10:04:04,834 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-28 10:04:04,834 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-28 10:04:04,835 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-28 10:04:04,836 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-28 10:04:04,837 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-28 10:04:04,837 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-28 10:04:04,838 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-28 10:04:04,838 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-28 10:04:04,839 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-28 10:04:04,840 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-28 10:04:04,840 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-28 10:04:04,841 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-28 10:04:04,842 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-28 10:04:04,842 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-28 10:04:04,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {10252#false} ~cond := #in~cond; {10252#false} is VALID [2022-04-28 10:04:04,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {10252#false} assume 0 == ~cond; {10252#false} is VALID [2022-04-28 10:04:04,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {10252#false} assume !false; {10252#false} is VALID [2022-04-28 10:04:04,842 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-28 10:04:04,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:04,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052784684] [2022-04-28 10:04:04,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052784684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:04,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325817436] [2022-04-28 10:04:04,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:04,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:04,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:04,844 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-28 10:04:04,845 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-28 10:04:04,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:04,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:04,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:04:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:04,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:05,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {10251#true} call ULTIMATE.init(); {10251#true} is VALID [2022-04-28 10:04:05,142 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-28 10:04:05,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {10251#true} assume true; {10251#true} is VALID [2022-04-28 10:04:05,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10251#true} {10251#true} #50#return; {10251#true} is VALID [2022-04-28 10:04:05,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {10251#true} call #t~ret9 := main(); {10251#true} is VALID [2022-04-28 10:04:05,143 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-28 10:04:05,143 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-28 10:04:05,144 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-28 10:04:05,144 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-28 10:04:05,145 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-28 10:04:05,145 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-28 10:04:05,146 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-28 10:04:05,146 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-28 10:04:05,146 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-28 10:04:05,147 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-28 10:04:05,147 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-28 10:04:05,148 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-28 10:04:05,148 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-28 10:04:05,148 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-28 10:04:05,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {10252#false} ~cond := #in~cond; {10252#false} is VALID [2022-04-28 10:04:05,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {10252#false} assume 0 == ~cond; {10252#false} is VALID [2022-04-28 10:04:05,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {10252#false} assume !false; {10252#false} is VALID [2022-04-28 10:04:05,149 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-28 10:04:05,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:05,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {10252#false} assume !false; {10252#false} is VALID [2022-04-28 10:04:05,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {10252#false} assume 0 == ~cond; {10252#false} is VALID [2022-04-28 10:04:05,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {10252#false} ~cond := #in~cond; {10252#false} is VALID [2022-04-28 10:04:05,386 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-28 10:04:05,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {10347#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10252#false} is VALID [2022-04-28 10:04:05,396 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-28 10:04:05,397 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-28 10:04:05,398 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-28 10:04:05,399 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-28 10:04:05,399 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-28 10:04:05,400 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-28 10:04:05,401 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-28 10:04:05,402 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-28 10:04:05,402 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-28 10:04:05,403 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-28 10:04:05,404 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-28 10:04:05,404 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-28 10:04:05,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {10251#true} call #t~ret9 := main(); {10251#true} is VALID [2022-04-28 10:04:05,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10251#true} {10251#true} #50#return; {10251#true} is VALID [2022-04-28 10:04:05,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {10251#true} assume true; {10251#true} is VALID [2022-04-28 10:04:05,405 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-28 10:04:05,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {10251#true} call ULTIMATE.init(); {10251#true} is VALID [2022-04-28 10:04:05,405 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-28 10:04:05,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325817436] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:05,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:05,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:04:05,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:05,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655361953] [2022-04-28 10:04:05,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655361953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:05,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:05,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:04:05,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085196776] [2022-04-28 10:04:05,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:05,406 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-28 10:04:05,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:05,407 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-28 10:04:05,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:05,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:04:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:05,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:04:05,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:04:05,425 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-28 10:04:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:06,187 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-28 10:04:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:04:06,187 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-28 10:04:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:06,187 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-28 10:04:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 44 transitions. [2022-04-28 10:04:06,188 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-28 10:04:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 44 transitions. [2022-04-28 10:04:06,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 44 transitions. [2022-04-28 10:04:06,223 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-28 10:04:06,223 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:04:06,223 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 10:04:06,224 INFO L412 NwaCegarLoop]: 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-28 10:04:06,224 INFO L413 NwaCegarLoop]: 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-28 10:04:06,225 INFO L414 NwaCegarLoop]: 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-28 10:04:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 10:04:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2022-04-28 10:04:06,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:06,342 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-28 10:04:06,342 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-28 10:04:06,342 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-28 10:04:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:06,343 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-28 10:04:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 10:04:06,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:06,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:06,343 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-28 10:04:06,343 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-28 10:04:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:06,344 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-28 10:04:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 10:04:06,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:06,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:06,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:06,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:06,344 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-28 10:04:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-28 10:04:06,344 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2022-04-28 10:04:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:06,344 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-28 10:04:06,345 INFO L496 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-28 10:04:06,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-28 10:04:06,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-28 10:04:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 10:04:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:04:06,412 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:06,412 INFO L195 NwaCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:06,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-28 10:04:06,613 WARN L477 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-28 10:04:06,613 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1575109588, now seen corresponding path program 45 times [2022-04-28 10:04:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:06,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1067385021] [2022-04-28 10:04:06,616 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:06,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:06,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1575109588, now seen corresponding path program 46 times [2022-04-28 10:04:06,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:06,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647326450] [2022-04-28 10:04:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:06,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:06,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:06,794 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-28 10:04:06,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {10681#true} assume true; {10681#true} is VALID [2022-04-28 10:04:06,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10681#true} {10681#true} #50#return; {10681#true} is VALID [2022-04-28 10:04:06,795 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-28 10:04:06,795 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-28 10:04:06,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {10681#true} assume true; {10681#true} is VALID [2022-04-28 10:04:06,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10681#true} {10681#true} #50#return; {10681#true} is VALID [2022-04-28 10:04:06,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {10681#true} call #t~ret9 := main(); {10681#true} is VALID [2022-04-28 10:04:06,795 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-28 10:04:06,796 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-28 10:04:06,796 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-28 10:04:06,797 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-28 10:04:06,797 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-28 10:04:06,798 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-28 10:04:06,798 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-28 10:04:06,799 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-28 10:04:06,799 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-28 10:04:06,800 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-28 10:04:06,800 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-28 10:04:06,801 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-28 10:04:06,801 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-28 10:04:06,801 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-28 10:04:06,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {10682#false} ~cond := #in~cond; {10682#false} is VALID [2022-04-28 10:04:06,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {10682#false} assume 0 == ~cond; {10682#false} is VALID [2022-04-28 10:04:06,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {10682#false} assume !false; {10682#false} is VALID [2022-04-28 10:04:06,801 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-28 10:04:06,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:06,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647326450] [2022-04-28 10:04:06,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647326450] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:06,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214035591] [2022-04-28 10:04:06,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:06,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:06,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:06,803 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-28 10:04:06,805 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-28 10:04:06,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:06,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:06,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:04:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:06,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:07,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {10681#true} call ULTIMATE.init(); {10681#true} is VALID [2022-04-28 10:04:07,103 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-28 10:04:07,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {10681#true} assume true; {10681#true} is VALID [2022-04-28 10:04:07,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10681#true} {10681#true} #50#return; {10681#true} is VALID [2022-04-28 10:04:07,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {10681#true} call #t~ret9 := main(); {10681#true} is VALID [2022-04-28 10:04:07,103 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-28 10:04:07,104 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-28 10:04:07,104 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-28 10:04:07,105 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-28 10:04:07,105 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-28 10:04:07,106 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-28 10:04:07,106 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-28 10:04:07,107 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-28 10:04:07,107 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-28 10:04:07,107 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-28 10:04:07,108 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-28 10:04:07,108 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-28 10:04:07,109 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-28 10:04:07,109 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-28 10:04:07,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {10682#false} ~cond := #in~cond; {10682#false} is VALID [2022-04-28 10:04:07,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {10682#false} assume 0 == ~cond; {10682#false} is VALID [2022-04-28 10:04:07,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {10682#false} assume !false; {10682#false} is VALID [2022-04-28 10:04:07,109 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-28 10:04:07,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:07,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {10682#false} assume !false; {10682#false} is VALID [2022-04-28 10:04:07,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {10682#false} assume 0 == ~cond; {10682#false} is VALID [2022-04-28 10:04:07,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {10682#false} ~cond := #in~cond; {10682#false} is VALID [2022-04-28 10:04:07,350 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-28 10:04:07,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {10777#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10682#false} is VALID [2022-04-28 10:04:07,352 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-28 10:04:07,352 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-28 10:04:07,353 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-28 10:04:07,353 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-28 10:04:07,354 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-28 10:04:07,355 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-28 10:04:07,355 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-28 10:04:07,356 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-28 10:04:07,356 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-28 10:04:07,357 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-28 10:04:07,358 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-28 10:04:07,358 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-28 10:04:07,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {10681#true} call #t~ret9 := main(); {10681#true} is VALID [2022-04-28 10:04:07,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10681#true} {10681#true} #50#return; {10681#true} is VALID [2022-04-28 10:04:07,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {10681#true} assume true; {10681#true} is VALID [2022-04-28 10:04:07,359 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-28 10:04:07,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {10681#true} call ULTIMATE.init(); {10681#true} is VALID [2022-04-28 10:04:07,359 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-28 10:04:07,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214035591] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:07,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:07,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:04:07,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:07,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1067385021] [2022-04-28 10:04:07,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1067385021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:07,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:07,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:04:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712929819] [2022-04-28 10:04:07,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:07,360 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-28 10:04:07,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:07,360 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-28 10:04:07,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:07,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:04:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:04:07,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:04:07,378 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-28 10:04:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:08,399 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 10:04:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:04:08,400 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-28 10:04:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:08,400 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-28 10:04:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 49 transitions. [2022-04-28 10:04:08,403 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-28 10:04:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 49 transitions. [2022-04-28 10:04:08,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 49 transitions. [2022-04-28 10:04:08,454 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-28 10:04:08,454 INFO L225 Difference]: With dead ends: 51 [2022-04-28 10:04:08,454 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:04:08,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:04:08,456 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:08,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 77 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:04:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2022-04-28 10:04:08,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:08,581 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-28 10:04:08,581 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-28 10:04:08,581 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-28 10:04:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:08,582 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-28 10:04:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-28 10:04:08,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:08,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:08,582 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-28 10:04:08,582 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-28 10:04:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:08,584 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-28 10:04:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-28 10:04:08,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:08,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:08,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:08,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:08,584 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-28 10:04:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-28 10:04:08,585 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2022-04-28 10:04:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:08,585 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-28 10:04:08,585 INFO L496 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-28 10:04:08,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-28 10:04:08,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 10:04:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:04:08,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:08,680 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:08,706 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-28 10:04:08,880 WARN L477 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-28 10:04:08,881 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2135390123, now seen corresponding path program 47 times [2022-04-28 10:04:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:08,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [520167112] [2022-04-28 10:04:08,884 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:08,884 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2135390123, now seen corresponding path program 48 times [2022-04-28 10:04:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:08,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168755884] [2022-04-28 10:04:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:09,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:09,044 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-28 10:04:09,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {11127#true} assume true; {11127#true} is VALID [2022-04-28 10:04:09,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11127#true} {11127#true} #50#return; {11127#true} is VALID [2022-04-28 10:04:09,045 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-28 10:04:09,045 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-28 10:04:09,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {11127#true} assume true; {11127#true} is VALID [2022-04-28 10:04:09,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11127#true} {11127#true} #50#return; {11127#true} is VALID [2022-04-28 10:04:09,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {11127#true} call #t~ret9 := main(); {11127#true} is VALID [2022-04-28 10:04:09,046 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-28 10:04:09,046 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-28 10:04:09,047 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-28 10:04:09,048 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-28 10:04:09,049 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-28 10:04:09,049 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-28 10:04:09,050 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-28 10:04:09,051 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-28 10:04:09,052 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-28 10:04:09,052 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-28 10:04:09,053 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-28 10:04:09,053 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-28 10:04:09,054 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-28 10:04:09,054 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-28 10:04:09,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {11128#false} ~cond := #in~cond; {11128#false} is VALID [2022-04-28 10:04:09,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {11128#false} assume 0 == ~cond; {11128#false} is VALID [2022-04-28 10:04:09,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {11128#false} assume !false; {11128#false} is VALID [2022-04-28 10:04:09,055 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-28 10:04:09,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:09,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168755884] [2022-04-28 10:04:09,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168755884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:09,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743353308] [2022-04-28 10:04:09,055 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:09,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:09,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:09,060 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-28 10:04:09,061 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-28 10:04:09,116 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:04:09,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:09,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:04:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:09,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:09,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {11127#true} call ULTIMATE.init(); {11127#true} is VALID [2022-04-28 10:04:09,397 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-28 10:04:09,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {11127#true} assume true; {11127#true} is VALID [2022-04-28 10:04:09,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11127#true} {11127#true} #50#return; {11127#true} is VALID [2022-04-28 10:04:09,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {11127#true} call #t~ret9 := main(); {11127#true} is VALID [2022-04-28 10:04:09,397 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-28 10:04:09,398 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-28 10:04:09,399 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-28 10:04:09,399 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-28 10:04:09,400 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-28 10:04:09,401 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-28 10:04:09,401 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-28 10:04:09,402 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-28 10:04:09,402 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-28 10:04:09,403 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-28 10:04:09,403 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-28 10:04:09,404 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-28 10:04:09,405 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-28 10:04:09,405 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-28 10:04:09,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {11128#false} ~cond := #in~cond; {11128#false} is VALID [2022-04-28 10:04:09,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {11128#false} assume 0 == ~cond; {11128#false} is VALID [2022-04-28 10:04:09,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {11128#false} assume !false; {11128#false} is VALID [2022-04-28 10:04:09,405 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-28 10:04:09,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:09,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {11128#false} assume !false; {11128#false} is VALID [2022-04-28 10:04:09,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {11128#false} assume 0 == ~cond; {11128#false} is VALID [2022-04-28 10:04:09,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {11128#false} ~cond := #in~cond; {11128#false} is VALID [2022-04-28 10:04:09,646 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-28 10:04:09,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {11223#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11128#false} is VALID [2022-04-28 10:04:09,648 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-28 10:04:09,648 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-28 10:04:09,649 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-28 10:04:09,649 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-28 10:04:09,650 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-28 10:04:09,651 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-28 10:04:09,651 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-28 10:04:09,652 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-28 10:04:09,652 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-28 10:04:09,653 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-28 10:04:09,654 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-28 10:04:09,654 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-28 10:04:09,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {11127#true} call #t~ret9 := main(); {11127#true} is VALID [2022-04-28 10:04:09,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11127#true} {11127#true} #50#return; {11127#true} is VALID [2022-04-28 10:04:09,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {11127#true} assume true; {11127#true} is VALID [2022-04-28 10:04:09,654 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-28 10:04:09,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {11127#true} call ULTIMATE.init(); {11127#true} is VALID [2022-04-28 10:04:09,654 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-28 10:04:09,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743353308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:09,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:09,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:04:09,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:09,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [520167112] [2022-04-28 10:04:09,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [520167112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:09,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:09,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:04:09,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61204187] [2022-04-28 10:04:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:09,655 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-28 10:04:09,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:09,655 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-28 10:04:09,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:09,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:04:09,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:04:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:04:09,670 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-28 10:04:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:10,616 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 10:04:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:04:10,616 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-28 10:04:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:10,617 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-28 10:04:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-28 10:04:10,617 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-28 10:04:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-28 10:04:10,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 52 transitions. [2022-04-28 10:04:10,672 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-28 10:04:10,673 INFO L225 Difference]: With dead ends: 54 [2022-04-28 10:04:10,673 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 10:04:10,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:04:10,675 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:10,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 77 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 10:04:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2022-04-28 10:04:10,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:10,806 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-28 10:04:10,806 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-28 10:04:10,806 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-28 10:04:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:10,807 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-28 10:04:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-04-28 10:04:10,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:10,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:10,807 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-28 10:04:10,807 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-28 10:04:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:10,808 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-28 10:04:10,808 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-04-28 10:04:10,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:10,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:10,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:10,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:10,809 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-28 10:04:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-28 10:04:10,809 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2022-04-28 10:04:10,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:10,809 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-28 10:04:10,809 INFO L496 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-28 10:04:10,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-28 10:04:10,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 10:04:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:04:10,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:10,907 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:10,931 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-28 10:04:11,116 WARN L477 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-28 10:04:11,116 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:11,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:11,116 INFO L85 PathProgramCache]: Analyzing trace with hash 38326348, now seen corresponding path program 17 times [2022-04-28 10:04:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:11,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1418908724] [2022-04-28 10:04:11,118 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:11,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:11,119 INFO L85 PathProgramCache]: Analyzing trace with hash 38326348, now seen corresponding path program 18 times [2022-04-28 10:04:11,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:11,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684900457] [2022-04-28 10:04:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:11,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:11,299 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-28 10:04:11,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {11581#true} assume true; {11581#true} is VALID [2022-04-28 10:04:11,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11581#true} {11581#true} #50#return; {11581#true} is VALID [2022-04-28 10:04:11,300 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-28 10:04:11,300 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-28 10:04:11,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {11581#true} assume true; {11581#true} is VALID [2022-04-28 10:04:11,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11581#true} {11581#true} #50#return; {11581#true} is VALID [2022-04-28 10:04:11,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {11581#true} call #t~ret9 := main(); {11581#true} is VALID [2022-04-28 10:04:11,300 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-28 10:04:11,301 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-28 10:04:11,301 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-28 10:04:11,302 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-28 10:04:11,303 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-28 10:04:11,303 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-28 10:04:11,304 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-28 10:04:11,305 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-28 10:04:11,305 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-28 10:04:11,306 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-28 10:04:11,306 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-28 10:04:11,307 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-28 10:04:11,307 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-28 10:04:11,307 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-28 10:04:11,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {11582#false} ~cond := #in~cond; {11582#false} is VALID [2022-04-28 10:04:11,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {11582#false} assume 0 == ~cond; {11582#false} is VALID [2022-04-28 10:04:11,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {11582#false} assume !false; {11582#false} is VALID [2022-04-28 10:04:11,308 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-28 10:04:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:11,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684900457] [2022-04-28 10:04:11,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684900457] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:11,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993826483] [2022-04-28 10:04:11,308 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:11,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:11,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:11,309 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-28 10:04:11,325 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-28 10:04:11,364 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:04:11,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:11,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:04:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:11,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:11,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {11581#true} call ULTIMATE.init(); {11581#true} is VALID [2022-04-28 10:04:11,597 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-28 10:04:11,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {11581#true} assume true; {11581#true} is VALID [2022-04-28 10:04:11,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11581#true} {11581#true} #50#return; {11581#true} is VALID [2022-04-28 10:04:11,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {11581#true} call #t~ret9 := main(); {11581#true} is VALID [2022-04-28 10:04:11,597 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-28 10:04:11,598 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-28 10:04:11,598 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-28 10:04:11,599 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-28 10:04:11,599 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-28 10:04:11,600 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-28 10:04:11,600 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-28 10:04:11,601 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-28 10:04:11,601 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-28 10:04:11,602 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-28 10:04:11,602 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-28 10:04:11,602 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-28 10:04:11,603 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-28 10:04:11,603 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-28 10:04:11,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {11582#false} ~cond := #in~cond; {11582#false} is VALID [2022-04-28 10:04:11,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {11582#false} assume 0 == ~cond; {11582#false} is VALID [2022-04-28 10:04:11,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {11582#false} assume !false; {11582#false} is VALID [2022-04-28 10:04:11,603 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-28 10:04:11,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:11,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {11582#false} assume !false; {11582#false} is VALID [2022-04-28 10:04:11,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {11582#false} assume 0 == ~cond; {11582#false} is VALID [2022-04-28 10:04:11,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {11582#false} ~cond := #in~cond; {11582#false} is VALID [2022-04-28 10:04:11,853 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-28 10:04:11,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {11677#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11582#false} is VALID [2022-04-28 10:04:11,854 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-28 10:04:11,854 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-28 10:04:11,855 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-28 10:04:11,855 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-28 10:04:11,856 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-28 10:04:11,857 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-28 10:04:11,857 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-28 10:04:11,858 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-28 10:04:11,858 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-28 10:04:11,859 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-28 10:04:11,864 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-28 10:04:11,864 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-28 10:04:11,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {11581#true} call #t~ret9 := main(); {11581#true} is VALID [2022-04-28 10:04:11,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11581#true} {11581#true} #50#return; {11581#true} is VALID [2022-04-28 10:04:11,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {11581#true} assume true; {11581#true} is VALID [2022-04-28 10:04:11,864 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-28 10:04:11,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {11581#true} call ULTIMATE.init(); {11581#true} is VALID [2022-04-28 10:04:11,865 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-28 10:04:11,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993826483] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:11,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:11,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:04:11,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:11,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1418908724] [2022-04-28 10:04:11,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1418908724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:11,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:11,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:04:11,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063258870] [2022-04-28 10:04:11,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:11,866 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-28 10:04:11,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:11,866 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-28 10:04:11,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:11,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:04:11,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:11,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:04:11,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:04:11,886 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-28 10:04:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:12,939 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-28 10:04:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:04:12,940 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-28 10:04:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:12,940 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-28 10:04:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-28 10:04:12,940 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-28 10:04:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-28 10:04:12,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-04-28 10:04:12,999 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-28 10:04:13,000 INFO L225 Difference]: With dead ends: 59 [2022-04-28 10:04:13,000 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 10:04:13,000 INFO L412 NwaCegarLoop]: 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-28 10:04:13,001 INFO L413 NwaCegarLoop]: 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-28 10:04:13,001 INFO L414 NwaCegarLoop]: 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-28 10:04:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 10:04:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2022-04-28 10:04:13,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:13,134 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-28 10:04:13,135 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-28 10:04:13,135 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-28 10:04:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:13,136 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 10:04:13,136 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 10:04:13,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:13,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:13,136 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-28 10:04:13,136 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-28 10:04:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:13,137 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 10:04:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 10:04:13,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:13,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:13,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:13,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:13,137 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-28 10:04:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-28 10:04:13,138 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 22 [2022-04-28 10:04:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:13,138 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-28 10:04:13,138 INFO L496 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-28 10:04:13,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-28 10:04:13,230 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-28 10:04:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-28 10:04:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:13,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:13,230 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:13,246 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-28 10:04:13,431 WARN L477 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-28 10:04:13,431 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1854745558, now seen corresponding path program 49 times [2022-04-28 10:04:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:13,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1659984144] [2022-04-28 10:04:13,434 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:13,434 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1854745558, now seen corresponding path program 50 times [2022-04-28 10:04:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:13,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057387811] [2022-04-28 10:04:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:13,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:13,653 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-28 10:04:13,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {12057#true} assume true; {12057#true} is VALID [2022-04-28 10:04:13,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12057#true} {12057#true} #50#return; {12057#true} is VALID [2022-04-28 10:04:13,654 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-28 10:04:13,654 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-28 10:04:13,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {12057#true} assume true; {12057#true} is VALID [2022-04-28 10:04:13,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12057#true} {12057#true} #50#return; {12057#true} is VALID [2022-04-28 10:04:13,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {12057#true} call #t~ret9 := main(); {12057#true} is VALID [2022-04-28 10:04:13,654 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-28 10:04:13,655 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-28 10:04:13,656 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-28 10:04:13,657 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-28 10:04:13,657 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-28 10:04:13,658 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-28 10:04:13,658 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-28 10:04:13,659 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-28 10:04:13,660 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-28 10:04:13,660 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-28 10:04:13,661 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-28 10:04:13,662 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-28 10:04:13,663 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-28 10:04:13,663 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-28 10:04:13,664 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-28 10:04:13,676 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-28 10:04:13,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {12070#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12058#false} is VALID [2022-04-28 10:04:13,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {12058#false} assume !false; {12058#false} is VALID [2022-04-28 10:04:13,677 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-28 10:04:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:13,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057387811] [2022-04-28 10:04:13,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057387811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:13,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269719945] [2022-04-28 10:04:13,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:13,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:13,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:13,679 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-28 10:04:13,702 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-28 10:04:13,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:13,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:13,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:04:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:13,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:13,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {12057#true} call ULTIMATE.init(); {12057#true} is VALID [2022-04-28 10:04:13,942 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-28 10:04:13,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {12057#true} assume true; {12057#true} is VALID [2022-04-28 10:04:13,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12057#true} {12057#true} #50#return; {12057#true} is VALID [2022-04-28 10:04:13,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {12057#true} call #t~ret9 := main(); {12057#true} is VALID [2022-04-28 10:04:13,943 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-28 10:04:13,943 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-28 10:04:13,944 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-28 10:04:13,944 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-28 10:04:13,945 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-28 10:04:13,946 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-28 10:04:13,946 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-28 10:04:13,946 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-28 10:04:13,947 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-28 10:04:13,947 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-28 10:04:13,948 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-28 10:04:13,948 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-28 10:04:13,949 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-28 10:04:13,949 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-28 10:04:13,950 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-28 10:04:13,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {12132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:13,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {12136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12058#false} is VALID [2022-04-28 10:04:13,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {12058#false} assume !false; {12058#false} is VALID [2022-04-28 10:04:13,951 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-28 10:04:13,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:14,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {12058#false} assume !false; {12058#false} is VALID [2022-04-28 10:04:14,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {12136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12058#false} is VALID [2022-04-28 10:04:14,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {12132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:14,140 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-28 10:04:14,140 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-28 10:04:14,141 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-28 10:04:14,142 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-28 10:04:14,143 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-28 10:04:14,144 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-28 10:04:14,145 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-28 10:04:14,145 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-28 10:04:14,145 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-28 10:04:14,146 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-28 10:04:14,147 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-28 10:04:14,149 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-28 10:04:14,150 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-28 10:04:14,151 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-28 10:04:14,151 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-28 10:04:14,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {12057#true} call #t~ret9 := main(); {12057#true} is VALID [2022-04-28 10:04:14,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12057#true} {12057#true} #50#return; {12057#true} is VALID [2022-04-28 10:04:14,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {12057#true} assume true; {12057#true} is VALID [2022-04-28 10:04:14,151 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-28 10:04:14,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {12057#true} call ULTIMATE.init(); {12057#true} is VALID [2022-04-28 10:04:14,152 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-28 10:04:14,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269719945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:14,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:14,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-28 10:04:14,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:14,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1659984144] [2022-04-28 10:04:14,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1659984144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:14,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:14,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:04:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638708934] [2022-04-28 10:04:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:14,153 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-28 10:04:14,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:14,153 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-28 10:04:14,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:14,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:04:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:14,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:04:14,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:04:14,171 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-28 10:04:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:14,756 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-28 10:04:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:04:14,756 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-28 10:04:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:14,756 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-28 10:04:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-28 10:04:14,757 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-28 10:04:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-28 10:04:14,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2022-04-28 10:04:14,792 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-28 10:04:14,792 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:04:14,792 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:04:14,793 INFO L412 NwaCegarLoop]: 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-28 10:04:14,793 INFO L413 NwaCegarLoop]: 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-28 10:04:14,793 INFO L414 NwaCegarLoop]: 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-28 10:04:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:04:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-04-28 10:04:14,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:14,925 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-28 10:04:14,925 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-28 10:04:14,925 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-28 10:04:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:14,926 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 10:04:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 10:04:14,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:14,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:14,926 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-28 10:04:14,927 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-28 10:04:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:14,927 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 10:04:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 10:04:14,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:14,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:14,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:14,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:14,927 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-28 10:04:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-28 10:04:14,928 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2022-04-28 10:04:14,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:14,928 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-28 10:04:14,928 INFO L496 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-28 10:04:14,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-28 10:04:15,018 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-28 10:04:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 10:04:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:15,018 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:15,018 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:15,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:15,219 WARN L477 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-28 10:04:15,219 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1778338807, now seen corresponding path program 51 times [2022-04-28 10:04:15,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:15,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996957234] [2022-04-28 10:04:15,221 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:15,221 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1778338807, now seen corresponding path program 52 times [2022-04-28 10:04:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:15,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943881136] [2022-04-28 10:04:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:15,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:15,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:15,409 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-28 10:04:15,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {12469#true} assume true; {12469#true} is VALID [2022-04-28 10:04:15,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12469#true} {12469#true} #50#return; {12469#true} is VALID [2022-04-28 10:04:15,410 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-28 10:04:15,410 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-28 10:04:15,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {12469#true} assume true; {12469#true} is VALID [2022-04-28 10:04:15,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12469#true} {12469#true} #50#return; {12469#true} is VALID [2022-04-28 10:04:15,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {12469#true} call #t~ret9 := main(); {12469#true} is VALID [2022-04-28 10:04:15,410 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-28 10:04:15,410 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-28 10:04:15,411 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-28 10:04:15,412 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-28 10:04:15,412 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-28 10:04:15,413 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-28 10:04:15,413 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-28 10:04:15,413 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-28 10:04:15,414 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-28 10:04:15,414 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-28 10:04:15,415 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-28 10:04:15,415 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-28 10:04:15,416 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-28 10:04:15,416 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-28 10:04:15,416 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-28 10:04:15,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {12470#false} ~cond := #in~cond; {12470#false} is VALID [2022-04-28 10:04:15,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {12470#false} assume 0 == ~cond; {12470#false} is VALID [2022-04-28 10:04:15,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {12470#false} assume !false; {12470#false} is VALID [2022-04-28 10:04:15,417 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-28 10:04:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:15,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943881136] [2022-04-28 10:04:15,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943881136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:15,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53701633] [2022-04-28 10:04:15,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:15,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:15,418 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-28 10:04:15,419 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-28 10:04:15,453 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:15,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:15,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:04:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:15,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:15,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {12469#true} call ULTIMATE.init(); {12469#true} is VALID [2022-04-28 10:04:15,705 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-28 10:04:15,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {12469#true} assume true; {12469#true} is VALID [2022-04-28 10:04:15,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12469#true} {12469#true} #50#return; {12469#true} is VALID [2022-04-28 10:04:15,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {12469#true} call #t~ret9 := main(); {12469#true} is VALID [2022-04-28 10:04:15,705 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-28 10:04:15,706 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-28 10:04:15,706 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-28 10:04:15,707 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-28 10:04:15,707 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-28 10:04:15,708 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-28 10:04:15,708 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-28 10:04:15,709 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-28 10:04:15,709 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-28 10:04:15,710 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-28 10:04:15,710 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-28 10:04:15,711 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-28 10:04:15,711 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-28 10:04:15,711 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-28 10:04:15,712 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-28 10:04:15,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {12470#false} ~cond := #in~cond; {12470#false} is VALID [2022-04-28 10:04:15,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {12470#false} assume 0 == ~cond; {12470#false} is VALID [2022-04-28 10:04:15,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {12470#false} assume !false; {12470#false} is VALID [2022-04-28 10:04:15,712 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-28 10:04:15,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:15,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {12470#false} assume !false; {12470#false} is VALID [2022-04-28 10:04:15,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {12470#false} assume 0 == ~cond; {12470#false} is VALID [2022-04-28 10:04:15,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {12470#false} ~cond := #in~cond; {12470#false} is VALID [2022-04-28 10:04:15,987 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-28 10:04:15,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {12569#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12470#false} is VALID [2022-04-28 10:04:15,989 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-28 10:04:15,990 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-28 10:04:15,990 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-28 10:04:15,991 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-28 10:04:15,991 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-28 10:04:15,992 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-28 10:04:15,992 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-28 10:04:15,993 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-28 10:04:15,994 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-28 10:04:15,994 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-28 10:04:15,995 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-28 10:04:15,995 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-28 10:04:15,996 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-28 10:04:15,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {12469#true} call #t~ret9 := main(); {12469#true} is VALID [2022-04-28 10:04:15,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12469#true} {12469#true} #50#return; {12469#true} is VALID [2022-04-28 10:04:15,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {12469#true} assume true; {12469#true} is VALID [2022-04-28 10:04:15,996 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-28 10:04:15,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {12469#true} call ULTIMATE.init(); {12469#true} is VALID [2022-04-28 10:04:15,996 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-28 10:04:15,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53701633] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:15,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:15,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:04:15,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:15,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996957234] [2022-04-28 10:04:15,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996957234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:15,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:15,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:15,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290379488] [2022-04-28 10:04:15,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:15,997 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-28 10:04:15,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:15,997 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-28 10:04:16,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:16,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:16,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:16,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:16,014 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-28 10:04:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:16,909 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-28 10:04:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:04:16,909 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-28 10:04:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:16,909 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-28 10:04:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 46 transitions. [2022-04-28 10:04:16,910 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-28 10:04:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 46 transitions. [2022-04-28 10:04:16,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 46 transitions. [2022-04-28 10:04:16,955 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-28 10:04:16,956 INFO L225 Difference]: With dead ends: 52 [2022-04-28 10:04:16,956 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:04:16,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=1528, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:04:16,957 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:16,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 59 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:04:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-04-28 10:04:17,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:17,134 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-28 10:04:17,134 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-28 10:04:17,134 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-28 10:04:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:17,135 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-28 10:04:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-28 10:04:17,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:17,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:17,135 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-28 10:04:17,135 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-28 10:04:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:17,136 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-28 10:04:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-28 10:04:17,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:17,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:17,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:17,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:17,137 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-28 10:04:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-28 10:04:17,137 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2022-04-28 10:04:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:17,137 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-28 10:04:17,137 INFO L496 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-28 10:04:17,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-28 10:04:17,272 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-28 10:04:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 10:04:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:17,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:17,272 INFO L195 NwaCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:17,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-28 10:04:17,483 WARN L477 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-28 10:04:17,483 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:17,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1549261898, now seen corresponding path program 53 times [2022-04-28 10:04:17,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:17,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [523380994] [2022-04-28 10:04:17,486 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:17,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:17,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1549261898, now seen corresponding path program 54 times [2022-04-28 10:04:17,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:17,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886662114] [2022-04-28 10:04:17,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:17,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:17,674 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-28 10:04:17,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {12937#true} assume true; {12937#true} is VALID [2022-04-28 10:04:17,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12937#true} {12937#true} #50#return; {12937#true} is VALID [2022-04-28 10:04:17,675 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-28 10:04:17,675 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-28 10:04:17,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {12937#true} assume true; {12937#true} is VALID [2022-04-28 10:04:17,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12937#true} {12937#true} #50#return; {12937#true} is VALID [2022-04-28 10:04:17,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {12937#true} call #t~ret9 := main(); {12937#true} is VALID [2022-04-28 10:04:17,675 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-28 10:04:17,676 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-28 10:04:17,677 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-28 10:04:17,677 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-28 10:04:17,678 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-28 10:04:17,679 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-28 10:04:17,679 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-28 10:04:17,680 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-28 10:04:17,680 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-28 10:04:17,681 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-28 10:04:17,681 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-28 10:04:17,682 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-28 10:04:17,683 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-28 10:04:17,683 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-28 10:04:17,684 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-28 10:04:17,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {12938#false} ~cond := #in~cond; {12938#false} is VALID [2022-04-28 10:04:17,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {12938#false} assume 0 == ~cond; {12938#false} is VALID [2022-04-28 10:04:17,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {12938#false} assume !false; {12938#false} is VALID [2022-04-28 10:04:17,684 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-28 10:04:17,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:17,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886662114] [2022-04-28 10:04:17,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886662114] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:17,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547485292] [2022-04-28 10:04:17,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:17,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:17,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:17,688 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-28 10:04:17,719 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-28 10:04:17,742 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:04:17,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:17,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:04:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:17,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:18,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {12937#true} call ULTIMATE.init(); {12937#true} is VALID [2022-04-28 10:04:18,017 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-28 10:04:18,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {12937#true} assume true; {12937#true} is VALID [2022-04-28 10:04:18,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12937#true} {12937#true} #50#return; {12937#true} is VALID [2022-04-28 10:04:18,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {12937#true} call #t~ret9 := main(); {12937#true} is VALID [2022-04-28 10:04:18,018 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-28 10:04:18,018 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-28 10:04:18,019 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-28 10:04:18,019 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-28 10:04:18,020 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-28 10:04:18,020 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-28 10:04:18,021 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-28 10:04:18,021 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-28 10:04:18,021 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-28 10:04:18,022 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-28 10:04:18,022 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-28 10:04:18,023 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-28 10:04:18,023 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-28 10:04:18,024 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-28 10:04:18,024 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-28 10:04:18,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {12938#false} ~cond := #in~cond; {12938#false} is VALID [2022-04-28 10:04:18,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {12938#false} assume 0 == ~cond; {12938#false} is VALID [2022-04-28 10:04:18,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {12938#false} assume !false; {12938#false} is VALID [2022-04-28 10:04:18,024 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-28 10:04:18,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:18,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {12938#false} assume !false; {12938#false} is VALID [2022-04-28 10:04:18,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {12938#false} assume 0 == ~cond; {12938#false} is VALID [2022-04-28 10:04:18,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {12938#false} ~cond := #in~cond; {12938#false} is VALID [2022-04-28 10:04:18,314 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-28 10:04:18,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {13037#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12938#false} is VALID [2022-04-28 10:04:18,315 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-28 10:04:18,316 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-28 10:04:18,316 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-28 10:04:18,317 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-28 10:04:18,317 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-28 10:04:18,318 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-28 10:04:18,318 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-28 10:04:18,319 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-28 10:04:18,320 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-28 10:04:18,320 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-28 10:04:18,321 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-28 10:04:18,321 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-28 10:04:18,322 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-28 10:04:18,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {12937#true} call #t~ret9 := main(); {12937#true} is VALID [2022-04-28 10:04:18,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12937#true} {12937#true} #50#return; {12937#true} is VALID [2022-04-28 10:04:18,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {12937#true} assume true; {12937#true} is VALID [2022-04-28 10:04:18,322 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-28 10:04:18,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {12937#true} call ULTIMATE.init(); {12937#true} is VALID [2022-04-28 10:04:18,322 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-28 10:04:18,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547485292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:18,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:18,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:04:18,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [523380994] [2022-04-28 10:04:18,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [523380994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:18,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:18,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:18,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587501940] [2022-04-28 10:04:18,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:18,323 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-28 10:04:18,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:18,324 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-28 10:04:18,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:18,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:18,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:18,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:18,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:18,343 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-28 10:04:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:19,459 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-28 10:04:19,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:04:19,459 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-28 10:04:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:19,460 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-28 10:04:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 52 transitions. [2022-04-28 10:04:19,460 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-28 10:04:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 52 transitions. [2022-04-28 10:04:19,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 52 transitions. [2022-04-28 10:04:19,502 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-28 10:04:19,502 INFO L225 Difference]: With dead ends: 57 [2022-04-28 10:04:19,502 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 10:04:19,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=1577, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 10:04:19,504 INFO L413 NwaCegarLoop]: 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-28 10:04:19,504 INFO L414 NwaCegarLoop]: 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-28 10:04:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 10:04:19,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2022-04-28 10:04:19,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:19,648 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-28 10:04:19,651 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-28 10:04:19,651 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-28 10:04:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:19,652 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-28 10:04:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-28 10:04:19,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:19,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:19,652 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-28 10:04:19,652 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-28 10:04:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:19,654 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-28 10:04:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-28 10:04:19,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:19,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:19,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:19,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:19,654 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-28 10:04:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-28 10:04:19,655 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2022-04-28 10:04:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:19,655 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-28 10:04:19,655 INFO L496 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-28 10:04:19,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-28 10:04:19,755 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-28 10:04:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 10:04:19,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:19,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:19,756 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:19,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-28 10:04:19,956 WARN L477 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-28 10:04:19,956 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1807079447, now seen corresponding path program 55 times [2022-04-28 10:04:19,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:19,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213520106] [2022-04-28 10:04:19,959 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:19,959 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:19,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1807079447, now seen corresponding path program 56 times [2022-04-28 10:04:19,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:19,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680123791] [2022-04-28 10:04:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:19,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:20,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:20,154 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-28 10:04:20,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 10:04:20,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13427#true} {13427#true} #50#return; {13427#true} is VALID [2022-04-28 10:04:20,155 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-28 10:04:20,155 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-28 10:04:20,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 10:04:20,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13427#true} {13427#true} #50#return; {13427#true} is VALID [2022-04-28 10:04:20,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {13427#true} call #t~ret9 := main(); {13427#true} is VALID [2022-04-28 10:04:20,156 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-28 10:04:20,156 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-28 10:04:20,157 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-28 10:04:20,158 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-28 10:04:20,158 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-28 10:04:20,159 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-28 10:04:20,163 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-28 10:04:20,164 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-28 10:04:20,165 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-28 10:04:20,165 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-28 10:04:20,166 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-28 10:04:20,166 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-28 10:04:20,167 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-28 10:04:20,167 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-28 10:04:20,167 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-28 10:04:20,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {13428#false} ~cond := #in~cond; {13428#false} is VALID [2022-04-28 10:04:20,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {13428#false} assume 0 == ~cond; {13428#false} is VALID [2022-04-28 10:04:20,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {13428#false} assume !false; {13428#false} is VALID [2022-04-28 10:04:20,168 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-28 10:04:20,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:20,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680123791] [2022-04-28 10:04:20,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680123791] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:20,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857865233] [2022-04-28 10:04:20,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:20,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:20,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:20,170 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-28 10:04:20,171 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-28 10:04:20,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:20,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:20,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:04:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:20,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:20,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {13427#true} call ULTIMATE.init(); {13427#true} is VALID [2022-04-28 10:04:20,435 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-28 10:04:20,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 10:04:20,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13427#true} {13427#true} #50#return; {13427#true} is VALID [2022-04-28 10:04:20,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {13427#true} call #t~ret9 := main(); {13427#true} is VALID [2022-04-28 10:04:20,436 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-28 10:04:20,436 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-28 10:04:20,437 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-28 10:04:20,437 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-28 10:04:20,438 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-28 10:04:20,438 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-28 10:04:20,439 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-28 10:04:20,439 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-28 10:04:20,440 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-28 10:04:20,440 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-28 10:04:20,440 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-28 10:04:20,441 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-28 10:04:20,441 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-28 10:04:20,442 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-28 10:04:20,442 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-28 10:04:20,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {13428#false} ~cond := #in~cond; {13428#false} is VALID [2022-04-28 10:04:20,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {13428#false} assume 0 == ~cond; {13428#false} is VALID [2022-04-28 10:04:20,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {13428#false} assume !false; {13428#false} is VALID [2022-04-28 10:04:20,442 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-28 10:04:20,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:20,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {13428#false} assume !false; {13428#false} is VALID [2022-04-28 10:04:20,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {13428#false} assume 0 == ~cond; {13428#false} is VALID [2022-04-28 10:04:20,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {13428#false} ~cond := #in~cond; {13428#false} is VALID [2022-04-28 10:04:20,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-28 10:04:20,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {13527#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13428#false} is VALID [2022-04-28 10:04:20,713 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-28 10:04:20,714 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-28 10:04:20,714 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-28 10:04:20,714 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-28 10:04:20,715 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-28 10:04:20,716 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-28 10:04:20,716 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-28 10:04:20,717 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-28 10:04:20,717 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-28 10:04:20,718 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-28 10:04:20,719 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-28 10:04:20,719 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-28 10:04:20,720 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-28 10:04:20,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {13427#true} call #t~ret9 := main(); {13427#true} is VALID [2022-04-28 10:04:20,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13427#true} {13427#true} #50#return; {13427#true} is VALID [2022-04-28 10:04:20,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 10:04:20,720 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-28 10:04:20,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {13427#true} call ULTIMATE.init(); {13427#true} is VALID [2022-04-28 10:04:20,720 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-28 10:04:20,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857865233] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:20,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:20,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:04:20,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:20,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213520106] [2022-04-28 10:04:20,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213520106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:20,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:20,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:20,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318239759] [2022-04-28 10:04:20,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:20,721 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-28 10:04:20,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:20,721 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-28 10:04:20,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:20,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:20,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:20,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:20,737 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-28 10:04:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:21,902 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 10:04:21,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:04:21,902 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-28 10:04:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:21,902 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-28 10:04:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-28 10:04:21,903 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-28 10:04:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-28 10:04:21,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 55 transitions. [2022-04-28 10:04:21,946 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-28 10:04:21,947 INFO L225 Difference]: With dead ends: 61 [2022-04-28 10:04:21,947 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 10:04:21,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:04:21,948 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:21,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 10:04:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 35. [2022-04-28 10:04:22,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:22,086 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-28 10:04:22,087 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-28 10:04:22,087 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-28 10:04:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:22,087 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-04-28 10:04:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2022-04-28 10:04:22,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:22,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:22,088 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-28 10:04:22,088 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-28 10:04:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:22,089 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-04-28 10:04:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2022-04-28 10:04:22,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:22,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:22,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:22,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:22,089 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-28 10:04:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-28 10:04:22,090 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2022-04-28 10:04:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:22,090 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-28 10:04:22,090 INFO L496 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-28 10:04:22,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-28 10:04:22,236 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-28 10:04:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 10:04:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:22,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:22,237 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:22,259 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-28 10:04:22,437 WARN L477 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-28 10:04:22,437 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1222611862, now seen corresponding path program 57 times [2022-04-28 10:04:22,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:22,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [394573521] [2022-04-28 10:04:22,440 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:22,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1222611862, now seen corresponding path program 58 times [2022-04-28 10:04:22,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:22,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385258417] [2022-04-28 10:04:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:22,622 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-28 10:04:22,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {13929#true} assume true; {13929#true} is VALID [2022-04-28 10:04:22,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13929#true} {13929#true} #50#return; {13929#true} is VALID [2022-04-28 10:04:22,623 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-28 10:04:22,623 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-28 10:04:22,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {13929#true} assume true; {13929#true} is VALID [2022-04-28 10:04:22,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13929#true} {13929#true} #50#return; {13929#true} is VALID [2022-04-28 10:04:22,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {13929#true} call #t~ret9 := main(); {13929#true} is VALID [2022-04-28 10:04:22,623 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-28 10:04:22,624 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-28 10:04:22,624 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-28 10:04:22,625 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-28 10:04:22,625 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-28 10:04:22,626 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-28 10:04:22,626 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-28 10:04:22,627 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-28 10:04:22,627 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-28 10:04:22,628 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-28 10:04:22,628 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-28 10:04:22,628 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-28 10:04:22,629 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-28 10:04:22,629 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-28 10:04:22,629 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-28 10:04:22,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {13930#false} ~cond := #in~cond; {13930#false} is VALID [2022-04-28 10:04:22,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {13930#false} assume 0 == ~cond; {13930#false} is VALID [2022-04-28 10:04:22,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {13930#false} assume !false; {13930#false} is VALID [2022-04-28 10:04:22,630 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-28 10:04:22,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:22,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385258417] [2022-04-28 10:04:22,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385258417] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:22,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184895192] [2022-04-28 10:04:22,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:22,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:22,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:22,631 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-28 10:04:22,631 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-28 10:04:22,661 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:22,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:22,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:04:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:22,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:22,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {13929#true} call ULTIMATE.init(); {13929#true} is VALID [2022-04-28 10:04:22,897 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-28 10:04:22,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {13929#true} assume true; {13929#true} is VALID [2022-04-28 10:04:22,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13929#true} {13929#true} #50#return; {13929#true} is VALID [2022-04-28 10:04:22,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {13929#true} call #t~ret9 := main(); {13929#true} is VALID [2022-04-28 10:04:22,897 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-28 10:04:22,898 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-28 10:04:22,898 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-28 10:04:22,899 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-28 10:04:22,899 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-28 10:04:22,900 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-28 10:04:22,900 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-28 10:04:22,901 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-28 10:04:22,901 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-28 10:04:22,902 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-28 10:04:22,902 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-28 10:04:22,902 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-28 10:04:22,903 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-28 10:04:22,903 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-28 10:04:22,903 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-28 10:04:22,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {13930#false} ~cond := #in~cond; {13930#false} is VALID [2022-04-28 10:04:22,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {13930#false} assume 0 == ~cond; {13930#false} is VALID [2022-04-28 10:04:22,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {13930#false} assume !false; {13930#false} is VALID [2022-04-28 10:04:22,904 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-28 10:04:22,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:23,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {13930#false} assume !false; {13930#false} is VALID [2022-04-28 10:04:23,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {13930#false} assume 0 == ~cond; {13930#false} is VALID [2022-04-28 10:04:23,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {13930#false} ~cond := #in~cond; {13930#false} is VALID [2022-04-28 10:04:23,217 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-28 10:04:23,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {14029#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13930#false} is VALID [2022-04-28 10:04:23,219 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-28 10:04:23,219 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-28 10:04:23,220 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-28 10:04:23,221 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-28 10:04:23,221 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-28 10:04:23,222 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-28 10:04:23,223 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-28 10:04:23,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-28 10:04:23,224 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-28 10:04:23,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-28 10:04:23,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-28 10:04:23,227 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-28 10:04:23,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-28 10:04:23,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {13929#true} call #t~ret9 := main(); {13929#true} is VALID [2022-04-28 10:04:23,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13929#true} {13929#true} #50#return; {13929#true} is VALID [2022-04-28 10:04:23,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {13929#true} assume true; {13929#true} is VALID [2022-04-28 10:04:23,228 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-28 10:04:23,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {13929#true} call ULTIMATE.init(); {13929#true} is VALID [2022-04-28 10:04:23,228 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-28 10:04:23,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184895192] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:23,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:23,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:04:23,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:23,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [394573521] [2022-04-28 10:04:23,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [394573521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:23,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:23,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:23,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207560701] [2022-04-28 10:04:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:23,229 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-28 10:04:23,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:23,229 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-28 10:04:23,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:23,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:23,248 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-28 10:04:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:24,524 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 10:04:24,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:04:24,524 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-28 10:04:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:24,524 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-28 10:04:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-28 10:04:24,525 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-28 10:04:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-28 10:04:24,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 58 transitions. [2022-04-28 10:04:24,580 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-28 10:04:24,581 INFO L225 Difference]: With dead ends: 64 [2022-04-28 10:04:24,581 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 10:04:24,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:04:24,582 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:24,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 86 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:24,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 10:04:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2022-04-28 10:04:24,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:24,722 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-28 10:04:24,722 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-28 10:04:24,722 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-28 10:04:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:24,723 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-28 10:04:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-04-28 10:04:24,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:24,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:24,723 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-28 10:04:24,723 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-28 10:04:24,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:24,724 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-28 10:04:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-04-28 10:04:24,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:24,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:24,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:24,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:24,725 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-28 10:04:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-28 10:04:24,725 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2022-04-28 10:04:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:24,725 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-28 10:04:24,725 INFO L496 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-28 10:04:24,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-28 10:04:24,869 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-28 10:04:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 10:04:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:24,869 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:24,869 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:24,894 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-28 10:04:25,069 WARN L477 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-28 10:04:25,070 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:25,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:25,070 INFO L85 PathProgramCache]: Analyzing trace with hash -874451913, now seen corresponding path program 19 times [2022-04-28 10:04:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:25,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106445366] [2022-04-28 10:04:25,072 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:25,072 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash -874451913, now seen corresponding path program 20 times [2022-04-28 10:04:25,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:25,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488980158] [2022-04-28 10:04:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:25,231 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-28 10:04:25,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {14439#true} assume true; {14439#true} is VALID [2022-04-28 10:04:25,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14439#true} {14439#true} #50#return; {14439#true} is VALID [2022-04-28 10:04:25,232 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-28 10:04:25,232 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-28 10:04:25,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {14439#true} assume true; {14439#true} is VALID [2022-04-28 10:04:25,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14439#true} {14439#true} #50#return; {14439#true} is VALID [2022-04-28 10:04:25,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {14439#true} call #t~ret9 := main(); {14439#true} is VALID [2022-04-28 10:04:25,233 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-28 10:04:25,233 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-28 10:04:25,233 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-28 10:04:25,234 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-28 10:04:25,235 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-28 10:04:25,235 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-28 10:04:25,236 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-28 10:04:25,236 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-28 10:04:25,237 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-28 10:04:25,237 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-28 10:04:25,237 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-28 10:04:25,238 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-28 10:04:25,238 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-28 10:04:25,239 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-28 10:04:25,239 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-28 10:04:25,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {14440#false} ~cond := #in~cond; {14440#false} is VALID [2022-04-28 10:04:25,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {14440#false} assume 0 == ~cond; {14440#false} is VALID [2022-04-28 10:04:25,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {14440#false} assume !false; {14440#false} is VALID [2022-04-28 10:04:25,239 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-28 10:04:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:25,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488980158] [2022-04-28 10:04:25,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488980158] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:25,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577164928] [2022-04-28 10:04:25,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:25,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:25,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:25,240 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-28 10:04:25,241 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-28 10:04:25,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:25,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:25,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:04:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:25,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:25,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {14439#true} call ULTIMATE.init(); {14439#true} is VALID [2022-04-28 10:04:25,486 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-28 10:04:25,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {14439#true} assume true; {14439#true} is VALID [2022-04-28 10:04:25,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14439#true} {14439#true} #50#return; {14439#true} is VALID [2022-04-28 10:04:25,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {14439#true} call #t~ret9 := main(); {14439#true} is VALID [2022-04-28 10:04:25,487 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-28 10:04:25,487 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-28 10:04:25,488 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-28 10:04:25,488 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-28 10:04:25,489 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-28 10:04:25,489 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-28 10:04:25,490 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-28 10:04:25,490 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-28 10:04:25,491 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-28 10:04:25,491 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-28 10:04:25,492 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-28 10:04:25,492 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-28 10:04:25,493 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-28 10:04:25,493 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-28 10:04:25,493 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-28 10:04:25,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {14440#false} ~cond := #in~cond; {14440#false} is VALID [2022-04-28 10:04:25,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {14440#false} assume 0 == ~cond; {14440#false} is VALID [2022-04-28 10:04:25,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {14440#false} assume !false; {14440#false} is VALID [2022-04-28 10:04:25,493 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-28 10:04:25,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:25,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {14440#false} assume !false; {14440#false} is VALID [2022-04-28 10:04:25,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {14440#false} assume 0 == ~cond; {14440#false} is VALID [2022-04-28 10:04:25,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {14440#false} ~cond := #in~cond; {14440#false} is VALID [2022-04-28 10:04:25,774 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-28 10:04:25,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {14539#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14440#false} is VALID [2022-04-28 10:04:25,774 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-28 10:04:25,774 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-28 10:04:25,775 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-28 10:04:25,776 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-28 10:04:25,776 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-28 10:04:25,777 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-28 10:04:25,778 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-28 10:04:25,778 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-28 10:04:25,779 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-28 10:04:25,779 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-28 10:04:25,780 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-28 10:04:25,781 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-28 10:04:25,781 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-28 10:04:25,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {14439#true} call #t~ret9 := main(); {14439#true} is VALID [2022-04-28 10:04:25,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14439#true} {14439#true} #50#return; {14439#true} is VALID [2022-04-28 10:04:25,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {14439#true} assume true; {14439#true} is VALID [2022-04-28 10:04:25,781 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-28 10:04:25,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {14439#true} call ULTIMATE.init(); {14439#true} is VALID [2022-04-28 10:04:25,781 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-28 10:04:25,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577164928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:25,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:25,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:04:25,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:25,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106445366] [2022-04-28 10:04:25,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106445366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:25,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:25,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291832284] [2022-04-28 10:04:25,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:25,782 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-28 10:04:25,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:25,782 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-28 10:04:25,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:25,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:25,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:25,797 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-28 10:04:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:27,171 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-28 10:04:27,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:04:27,171 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-28 10:04:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:27,171 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-28 10:04:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-28 10:04:27,172 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-28 10:04:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-28 10:04:27,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-28 10:04:27,219 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-28 10:04:27,220 INFO L225 Difference]: With dead ends: 69 [2022-04-28 10:04:27,220 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 10:04:27,220 INFO L412 NwaCegarLoop]: 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-28 10:04:27,221 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:27,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 94 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:04:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 10:04:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 37. [2022-04-28 10:04:27,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:27,368 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-28 10:04:27,368 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-28 10:04:27,369 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-28 10:04:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:27,370 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 10:04:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 10:04:27,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:27,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:27,370 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-28 10:04:27,370 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-28 10:04:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:27,371 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 10:04:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 10:04:27,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:27,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:27,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:27,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:27,372 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-28 10:04:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-28 10:04:27,372 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 23 [2022-04-28 10:04:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:27,372 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-28 10:04:27,372 INFO L496 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-28 10:04:27,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-28 10:04:27,494 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-28 10:04:27,494 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-28 10:04:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:27,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:27,495 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:27,510 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-28 10:04:27,695 WARN L477 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-28 10:04:27,695 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1697032524, now seen corresponding path program 59 times [2022-04-28 10:04:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:27,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820957265] [2022-04-28 10:04:27,698 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:27,698 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1697032524, now seen corresponding path program 60 times [2022-04-28 10:04:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:27,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737947695] [2022-04-28 10:04:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:27,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:27,892 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-28 10:04:27,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {14971#true} assume true; {14971#true} is VALID [2022-04-28 10:04:27,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14971#true} {14971#true} #50#return; {14971#true} is VALID [2022-04-28 10:04:27,893 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-28 10:04:27,893 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-28 10:04:27,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {14971#true} assume true; {14971#true} is VALID [2022-04-28 10:04:27,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14971#true} {14971#true} #50#return; {14971#true} is VALID [2022-04-28 10:04:27,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {14971#true} call #t~ret9 := main(); {14971#true} is VALID [2022-04-28 10:04:27,893 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-28 10:04:27,894 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-28 10:04:27,894 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-28 10:04:27,895 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-28 10:04:27,895 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-28 10:04:27,896 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-28 10:04:27,896 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-28 10:04:27,896 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-28 10:04:27,897 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-28 10:04:27,897 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-28 10:04:27,898 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-28 10:04:27,898 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-28 10:04:27,899 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-28 10:04:27,899 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-28 10:04:27,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {14972#false} assume !(~z~0 % 4294967296 > 0); {14972#false} is VALID [2022-04-28 10:04:27,900 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-28 10:04:27,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {14972#false} ~cond := #in~cond; {14972#false} is VALID [2022-04-28 10:04:27,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {14972#false} assume 0 == ~cond; {14972#false} is VALID [2022-04-28 10:04:27,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {14972#false} assume !false; {14972#false} is VALID [2022-04-28 10:04:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:27,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:27,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737947695] [2022-04-28 10:04:27,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737947695] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:27,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198962885] [2022-04-28 10:04:27,900 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:27,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:27,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:27,901 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-28 10:04:27,902 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-28 10:04:27,940 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:04:27,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:27,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:04:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:27,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:28,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {14971#true} call ULTIMATE.init(); {14971#true} is VALID [2022-04-28 10:04:28,180 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-28 10:04:28,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {14971#true} assume true; {14971#true} is VALID [2022-04-28 10:04:28,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14971#true} {14971#true} #50#return; {14971#true} is VALID [2022-04-28 10:04:28,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {14971#true} call #t~ret9 := main(); {14971#true} is VALID [2022-04-28 10:04:28,181 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-28 10:04:28,181 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-28 10:04:28,182 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-28 10:04:28,182 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-28 10:04:28,183 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-28 10:04:28,183 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-28 10:04:28,184 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-28 10:04:28,184 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-28 10:04:28,184 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-28 10:04:28,185 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-28 10:04:28,185 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-28 10:04:28,186 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-28 10:04:28,186 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-28 10:04:28,187 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-28 10:04:28,187 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-28 10:04:28,187 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-28 10:04:28,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {14972#false} ~cond := #in~cond; {14972#false} is VALID [2022-04-28 10:04:28,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {14972#false} assume 0 == ~cond; {14972#false} is VALID [2022-04-28 10:04:28,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {14972#false} assume !false; {14972#false} is VALID [2022-04-28 10:04:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:28,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:28,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {14972#false} assume !false; {14972#false} is VALID [2022-04-28 10:04:28,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {14972#false} assume 0 == ~cond; {14972#false} is VALID [2022-04-28 10:04:28,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {14972#false} ~cond := #in~cond; {14972#false} is VALID [2022-04-28 10:04:28,516 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-28 10:04:28,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {15074#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14972#false} is VALID [2022-04-28 10:04:28,517 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-28 10:04:28,518 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-28 10:04:28,518 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-28 10:04:28,519 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-28 10:04:28,520 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-28 10:04:28,521 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-28 10:04:28,521 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-28 10:04:28,521 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-28 10:04:28,522 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-28 10:04:28,523 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-28 10:04:28,523 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-28 10:04:28,524 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-28 10:04:28,524 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-28 10:04:28,525 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-28 10:04:28,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {14971#true} call #t~ret9 := main(); {14971#true} is VALID [2022-04-28 10:04:28,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14971#true} {14971#true} #50#return; {14971#true} is VALID [2022-04-28 10:04:28,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {14971#true} assume true; {14971#true} is VALID [2022-04-28 10:04:28,525 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-28 10:04:28,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {14971#true} call ULTIMATE.init(); {14971#true} is VALID [2022-04-28 10:04:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:28,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198962885] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:28,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:28,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2022-04-28 10:04:28,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:28,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820957265] [2022-04-28 10:04:28,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820957265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:28,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:28,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:28,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378670399] [2022-04-28 10:04:28,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:28,526 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-28 10:04:28,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:28,526 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-28 10:04:28,543 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-28 10:04:28,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:28,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:28,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:28,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:04:28,544 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-28 10:04:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:29,317 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 10:04:29,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:04:29,317 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-28 10:04:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:29,317 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-28 10:04:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2022-04-28 10:04:29,318 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-28 10:04:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2022-04-28 10:04:29,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 35 transitions. [2022-04-28 10:04:29,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:29,352 INFO L225 Difference]: With dead ends: 48 [2022-04-28 10:04:29,353 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 10:04:29,353 INFO L412 NwaCegarLoop]: 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-28 10:04:29,354 INFO L413 NwaCegarLoop]: 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-28 10:04:29,354 INFO L414 NwaCegarLoop]: 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-28 10:04:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 10:04:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 10:04:29,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:29,525 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-28 10:04:29,525 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-28 10:04:29,526 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-28 10:04:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:29,526 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 10:04:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 10:04:29,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:29,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:29,527 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-28 10:04:29,527 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-28 10:04:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:29,527 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 10:04:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 10:04:29,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:29,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:29,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:29,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:29,528 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-28 10:04:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-28 10:04:29,528 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 24 [2022-04-28 10:04:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:29,528 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-28 10:04:29,528 INFO L496 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-28 10:04:29,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-28 10:04:29,661 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-28 10:04:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 10:04:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:29,662 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:29,662 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:29,687 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-28 10:04:29,862 WARN L477 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-28 10:04:29,862 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash -671576757, now seen corresponding path program 61 times [2022-04-28 10:04:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:29,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1337164359] [2022-04-28 10:04:29,865 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:29,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:29,865 INFO L85 PathProgramCache]: Analyzing trace with hash -671576757, now seen corresponding path program 62 times [2022-04-28 10:04:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:29,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734287690] [2022-04-28 10:04:29,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:29,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:30,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:30,047 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-28 10:04:30,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {15406#true} assume true; {15406#true} is VALID [2022-04-28 10:04:30,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15406#true} {15406#true} #50#return; {15406#true} is VALID [2022-04-28 10:04:30,048 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-28 10:04:30,048 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-28 10:04:30,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {15406#true} assume true; {15406#true} is VALID [2022-04-28 10:04:30,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15406#true} {15406#true} #50#return; {15406#true} is VALID [2022-04-28 10:04:30,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {15406#true} call #t~ret9 := main(); {15406#true} is VALID [2022-04-28 10:04:30,048 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-28 10:04:30,049 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-28 10:04:30,049 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-28 10:04:30,050 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-28 10:04:30,050 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-28 10:04:30,051 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-28 10:04:30,051 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-28 10:04:30,052 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-28 10:04:30,052 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-28 10:04:30,053 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-28 10:04:30,053 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-28 10:04:30,054 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-28 10:04:30,054 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-28 10:04:30,055 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-28 10:04:30,055 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-28 10:04:30,055 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-28 10:04:30,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {15407#false} ~cond := #in~cond; {15407#false} is VALID [2022-04-28 10:04:30,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {15407#false} assume 0 == ~cond; {15407#false} is VALID [2022-04-28 10:04:30,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {15407#false} assume !false; {15407#false} is VALID [2022-04-28 10:04:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:30,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:30,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734287690] [2022-04-28 10:04:30,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734287690] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:30,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010507448] [2022-04-28 10:04:30,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:30,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:30,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:30,057 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-28 10:04:30,057 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-28 10:04:30,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:30,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:30,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:04:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:30,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:30,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {15406#true} call ULTIMATE.init(); {15406#true} is VALID [2022-04-28 10:04:30,320 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-28 10:04:30,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {15406#true} assume true; {15406#true} is VALID [2022-04-28 10:04:30,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15406#true} {15406#true} #50#return; {15406#true} is VALID [2022-04-28 10:04:30,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {15406#true} call #t~ret9 := main(); {15406#true} is VALID [2022-04-28 10:04:30,320 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-28 10:04:30,320 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-28 10:04:30,321 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-28 10:04:30,321 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-28 10:04:30,322 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-28 10:04:30,322 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-28 10:04:30,323 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-28 10:04:30,323 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-28 10:04:30,324 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-28 10:04:30,324 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-28 10:04:30,325 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-28 10:04:30,325 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-28 10:04:30,326 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-28 10:04:30,326 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-28 10:04:30,326 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-28 10:04:30,327 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-28 10:04:30,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {15407#false} ~cond := #in~cond; {15407#false} is VALID [2022-04-28 10:04:30,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {15407#false} assume 0 == ~cond; {15407#false} is VALID [2022-04-28 10:04:30,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {15407#false} assume !false; {15407#false} is VALID [2022-04-28 10:04:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:30,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:30,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {15407#false} assume !false; {15407#false} is VALID [2022-04-28 10:04:30,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {15407#false} assume 0 == ~cond; {15407#false} is VALID [2022-04-28 10:04:30,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {15407#false} ~cond := #in~cond; {15407#false} is VALID [2022-04-28 10:04:30,620 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-28 10:04:30,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {15510#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15407#false} is VALID [2022-04-28 10:04:30,621 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-28 10:04:30,622 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-28 10:04:30,623 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-28 10:04:30,623 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-28 10:04:30,624 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-28 10:04:30,624 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-28 10:04:30,625 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-28 10:04:30,625 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-28 10:04:30,626 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-28 10:04:30,626 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-28 10:04:30,627 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-28 10:04:30,628 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-28 10:04:30,629 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-28 10:04:30,629 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-28 10:04:30,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {15406#true} call #t~ret9 := main(); {15406#true} is VALID [2022-04-28 10:04:30,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15406#true} {15406#true} #50#return; {15406#true} is VALID [2022-04-28 10:04:30,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {15406#true} assume true; {15406#true} is VALID [2022-04-28 10:04:30,629 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-28 10:04:30,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {15406#true} call ULTIMATE.init(); {15406#true} is VALID [2022-04-28 10:04:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:30,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010507448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:30,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:30,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:04:30,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:30,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1337164359] [2022-04-28 10:04:30,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1337164359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:30,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:30,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:04:30,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226993006] [2022-04-28 10:04:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:30,630 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-28 10:04:30,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:30,630 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-28 10:04:30,651 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-28 10:04:30,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:04:30,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:30,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:04:30,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:04:30,653 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-28 10:04:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:31,388 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-28 10:04:31,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:04:31,388 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-28 10:04:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:31,389 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-28 10:04:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2022-04-28 10:04:31,389 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-28 10:04:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2022-04-28 10:04:31,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 38 transitions. [2022-04-28 10:04:31,418 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-28 10:04:31,419 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:04:31,419 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 10:04:31,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:04:31,419 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:31,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 10:04:31,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-04-28 10:04:31,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:31,571 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-28 10:04:31,571 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-28 10:04:31,571 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-28 10:04:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:31,572 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-28 10:04:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 10:04:31,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:31,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:31,572 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-28 10:04:31,572 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-28 10:04:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:31,573 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-28 10:04:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 10:04:31,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:31,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:31,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:31,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:31,573 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-28 10:04:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-28 10:04:31,574 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2022-04-28 10:04:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:31,574 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-28 10:04:31,574 INFO L496 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-28 10:04:31,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-28 10:04:31,742 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-28 10:04:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 10:04:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:31,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:31,743 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:31,765 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-28 10:04:31,943 WARN L477 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-28 10:04:31,944 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash -747983508, now seen corresponding path program 63 times [2022-04-28 10:04:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:31,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1955521985] [2022-04-28 10:04:31,948 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:31,948 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash -747983508, now seen corresponding path program 64 times [2022-04-28 10:04:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:31,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859693309] [2022-04-28 10:04:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:32,168 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-28 10:04:32,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {15858#true} assume true; {15858#true} is VALID [2022-04-28 10:04:32,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15858#true} {15858#true} #50#return; {15858#true} is VALID [2022-04-28 10:04:32,169 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-28 10:04:32,169 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-28 10:04:32,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {15858#true} assume true; {15858#true} is VALID [2022-04-28 10:04:32,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15858#true} {15858#true} #50#return; {15858#true} is VALID [2022-04-28 10:04:32,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {15858#true} call #t~ret9 := main(); {15858#true} is VALID [2022-04-28 10:04:32,169 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-28 10:04:32,170 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-28 10:04:32,170 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-28 10:04:32,171 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-28 10:04:32,172 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-28 10:04:32,172 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-28 10:04:32,173 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-28 10:04:32,174 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-28 10:04:32,174 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-28 10:04:32,174 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-28 10:04:32,175 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-28 10:04:32,176 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-28 10:04:32,176 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-28 10:04:32,177 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-28 10:04:32,178 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-28 10:04:32,178 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-28 10:04:32,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {15859#false} ~cond := #in~cond; {15859#false} is VALID [2022-04-28 10:04:32,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {15859#false} assume 0 == ~cond; {15859#false} is VALID [2022-04-28 10:04:32,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {15859#false} assume !false; {15859#false} is VALID [2022-04-28 10:04:32,178 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-28 10:04:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:32,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859693309] [2022-04-28 10:04:32,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859693309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:32,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418100292] [2022-04-28 10:04:32,179 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:32,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:32,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:32,184 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-28 10:04:32,211 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-28 10:04:32,224 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:32,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:32,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:04:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:32,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:32,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {15858#true} call ULTIMATE.init(); {15858#true} is VALID [2022-04-28 10:04:32,516 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-28 10:04:32,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {15858#true} assume true; {15858#true} is VALID [2022-04-28 10:04:32,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15858#true} {15858#true} #50#return; {15858#true} is VALID [2022-04-28 10:04:32,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {15858#true} call #t~ret9 := main(); {15858#true} is VALID [2022-04-28 10:04:32,519 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-28 10:04:32,520 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-28 10:04:32,521 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-28 10:04:32,521 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-28 10:04:32,522 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-28 10:04:32,523 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-28 10:04:32,523 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-28 10:04:32,524 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-28 10:04:32,524 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-28 10:04:32,525 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-28 10:04:32,526 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-28 10:04:32,526 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-28 10:04:32,527 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-28 10:04:32,528 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-28 10:04:32,528 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-28 10:04:32,528 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-28 10:04:32,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {15859#false} ~cond := #in~cond; {15859#false} is VALID [2022-04-28 10:04:32,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {15859#false} assume 0 == ~cond; {15859#false} is VALID [2022-04-28 10:04:32,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {15859#false} assume !false; {15859#false} is VALID [2022-04-28 10:04:32,529 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-28 10:04:32,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:32,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {15859#false} assume !false; {15859#false} is VALID [2022-04-28 10:04:32,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {15859#false} assume 0 == ~cond; {15859#false} is VALID [2022-04-28 10:04:32,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {15859#false} ~cond := #in~cond; {15859#false} is VALID [2022-04-28 10:04:32,871 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-28 10:04:32,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {15962#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15859#false} is VALID [2022-04-28 10:04:32,872 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-28 10:04:32,873 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-28 10:04:32,874 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-28 10:04:32,874 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-28 10:04:32,875 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-28 10:04:32,875 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-28 10:04:32,876 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-28 10:04:32,876 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-28 10:04:32,877 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-28 10:04:32,878 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-28 10:04:32,878 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-28 10:04:32,879 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-28 10:04:32,879 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-28 10:04:32,880 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-28 10:04:32,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {15858#true} call #t~ret9 := main(); {15858#true} is VALID [2022-04-28 10:04:32,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15858#true} {15858#true} #50#return; {15858#true} is VALID [2022-04-28 10:04:32,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {15858#true} assume true; {15858#true} is VALID [2022-04-28 10:04:32,880 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-28 10:04:32,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {15858#true} call ULTIMATE.init(); {15858#true} is VALID [2022-04-28 10:04:32,880 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-28 10:04:32,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418100292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:32,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:32,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:04:32,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:32,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1955521985] [2022-04-28 10:04:32,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1955521985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:32,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:32,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:04:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117028889] [2022-04-28 10:04:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:32,881 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-28 10:04:32,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:32,881 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-28 10:04:32,897 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-28 10:04:32,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:04:32,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:32,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:04:32,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:04:32,897 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-28 10:04:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:34,070 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 10:04:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:04:34,070 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-28 10:04:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:34,071 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-28 10:04:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2022-04-28 10:04:34,071 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-28 10:04:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2022-04-28 10:04:34,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 47 transitions. [2022-04-28 10:04:34,113 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-28 10:04:34,114 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:04:34,114 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 10:04:34,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=1745, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:04:34,115 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:34,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 84 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 10:04:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2022-04-28 10:04:34,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:34,288 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-28 10:04:34,288 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-28 10:04:34,288 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-28 10:04:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:34,289 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 10:04:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-04-28 10:04:34,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:34,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:34,289 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-28 10:04:34,289 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-28 10:04:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:34,289 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 10:04:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-04-28 10:04:34,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:34,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:34,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:34,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:34,290 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-28 10:04:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-28 10:04:34,290 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2022-04-28 10:04:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:34,290 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-28 10:04:34,290 INFO L496 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-28 10:04:34,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-28 10:04:34,423 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-28 10:04:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 10:04:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:34,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:34,424 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:34,439 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-28 10:04:34,627 WARN L477 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-28 10:04:34,627 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:34,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:34,628 INFO L85 PathProgramCache]: Analyzing trace with hash 219383083, now seen corresponding path program 65 times [2022-04-28 10:04:34,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:34,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1443342948] [2022-04-28 10:04:34,631 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:34,631 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:34,631 INFO L85 PathProgramCache]: Analyzing trace with hash 219383083, now seen corresponding path program 66 times [2022-04-28 10:04:34,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:34,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524215392] [2022-04-28 10:04:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:34,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:34,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:34,859 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-28 10:04:34,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {16342#true} assume true; {16342#true} is VALID [2022-04-28 10:04:34,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16342#true} {16342#true} #50#return; {16342#true} is VALID [2022-04-28 10:04:34,860 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-28 10:04:34,860 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-28 10:04:34,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {16342#true} assume true; {16342#true} is VALID [2022-04-28 10:04:34,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16342#true} {16342#true} #50#return; {16342#true} is VALID [2022-04-28 10:04:34,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {16342#true} call #t~ret9 := main(); {16342#true} is VALID [2022-04-28 10:04:34,860 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-28 10:04:34,861 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-28 10:04:34,862 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-28 10:04:34,862 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-28 10:04:34,863 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-28 10:04:34,864 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-28 10:04:34,864 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-28 10:04:34,865 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-28 10:04:34,865 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-28 10:04:34,866 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-28 10:04:34,866 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-28 10:04:34,867 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-28 10:04:34,868 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-28 10:04:34,868 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-28 10:04:34,869 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-28 10:04:34,869 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-28 10:04:34,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {16343#false} ~cond := #in~cond; {16343#false} is VALID [2022-04-28 10:04:34,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {16343#false} assume 0 == ~cond; {16343#false} is VALID [2022-04-28 10:04:34,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {16343#false} assume !false; {16343#false} is VALID [2022-04-28 10:04:34,870 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-28 10:04:34,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:34,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524215392] [2022-04-28 10:04:34,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524215392] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:34,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521912673] [2022-04-28 10:04:34,870 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:34,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:34,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:34,872 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-28 10:04:34,902 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-28 10:04:34,930 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:04:34,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:34,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:04:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:34,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:35,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {16342#true} call ULTIMATE.init(); {16342#true} is VALID [2022-04-28 10:04:35,163 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-28 10:04:35,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {16342#true} assume true; {16342#true} is VALID [2022-04-28 10:04:35,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16342#true} {16342#true} #50#return; {16342#true} is VALID [2022-04-28 10:04:35,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {16342#true} call #t~ret9 := main(); {16342#true} is VALID [2022-04-28 10:04:35,164 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-28 10:04:35,164 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-28 10:04:35,165 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-28 10:04:35,165 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-28 10:04:35,166 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-28 10:04:35,166 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-28 10:04:35,167 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-28 10:04:35,167 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-28 10:04:35,168 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-28 10:04:35,168 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-28 10:04:35,168 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-28 10:04:35,169 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-28 10:04:35,169 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-28 10:04:35,170 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-28 10:04:35,170 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-28 10:04:35,170 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-28 10:04:35,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {16343#false} ~cond := #in~cond; {16343#false} is VALID [2022-04-28 10:04:35,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {16343#false} assume 0 == ~cond; {16343#false} is VALID [2022-04-28 10:04:35,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {16343#false} assume !false; {16343#false} is VALID [2022-04-28 10:04:35,171 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-28 10:04:35,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:35,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {16343#false} assume !false; {16343#false} is VALID [2022-04-28 10:04:35,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {16343#false} assume 0 == ~cond; {16343#false} is VALID [2022-04-28 10:04:35,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {16343#false} ~cond := #in~cond; {16343#false} is VALID [2022-04-28 10:04:35,490 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-28 10:04:35,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {16446#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16343#false} is VALID [2022-04-28 10:04:35,491 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-28 10:04:35,491 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-28 10:04:35,492 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-28 10:04:35,493 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-28 10:04:35,493 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-28 10:04:35,493 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-28 10:04:35,494 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-28 10:04:35,495 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-28 10:04:35,495 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-28 10:04:35,496 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-28 10:04:35,496 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-28 10:04:35,497 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-28 10:04:35,498 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-28 10:04:35,498 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-28 10:04:35,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {16342#true} call #t~ret9 := main(); {16342#true} is VALID [2022-04-28 10:04:35,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16342#true} {16342#true} #50#return; {16342#true} is VALID [2022-04-28 10:04:35,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {16342#true} assume true; {16342#true} is VALID [2022-04-28 10:04:35,498 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-28 10:04:35,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {16342#true} call ULTIMATE.init(); {16342#true} is VALID [2022-04-28 10:04:35,498 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-28 10:04:35,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521912673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:35,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:35,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:04:35,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:35,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1443342948] [2022-04-28 10:04:35,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1443342948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:35,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:35,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:04:35,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663498137] [2022-04-28 10:04:35,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:35,502 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-28 10:04:35,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:35,502 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-28 10:04:35,518 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-28 10:04:35,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:04:35,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:35,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:04:35,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:04:35,519 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-28 10:04:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:36,840 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 10:04:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:04:36,840 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-28 10:04:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:36,841 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-28 10:04:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2022-04-28 10:04:36,842 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-28 10:04:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2022-04-28 10:04:36,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 53 transitions. [2022-04-28 10:04:36,893 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-28 10:04:36,894 INFO L225 Difference]: With dead ends: 58 [2022-04-28 10:04:36,894 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 10:04:36,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=454, Invalid=1802, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:04:36,897 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:36,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 82 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 10:04:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2022-04-28 10:04:37,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:37,102 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-28 10:04:37,102 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-28 10:04:37,102 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-28 10:04:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:37,103 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-28 10:04:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-28 10:04:37,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:37,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:37,104 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-28 10:04:37,104 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-28 10:04:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:37,104 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-28 10:04:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-28 10:04:37,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:37,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:37,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:37,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:37,105 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-28 10:04:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-28 10:04:37,105 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2022-04-28 10:04:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:37,106 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-28 10:04:37,106 INFO L496 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-28 10:04:37,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-28 10:04:37,276 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-28 10:04:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 10:04:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:37,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:37,277 INFO L195 NwaCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:37,302 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-28 10:04:37,477 WARN L477 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-28 10:04:37,477 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:37,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash -719242868, now seen corresponding path program 67 times [2022-04-28 10:04:37,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:37,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [61071085] [2022-04-28 10:04:37,480 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:37,480 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -719242868, now seen corresponding path program 68 times [2022-04-28 10:04:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:37,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576635532] [2022-04-28 10:04:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:37,688 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-28 10:04:37,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {16848#true} assume true; {16848#true} is VALID [2022-04-28 10:04:37,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16848#true} {16848#true} #50#return; {16848#true} is VALID [2022-04-28 10:04:37,689 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-28 10:04:37,689 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-28 10:04:37,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {16848#true} assume true; {16848#true} is VALID [2022-04-28 10:04:37,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16848#true} {16848#true} #50#return; {16848#true} is VALID [2022-04-28 10:04:37,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {16848#true} call #t~ret9 := main(); {16848#true} is VALID [2022-04-28 10:04:37,689 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-28 10:04:37,690 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-28 10:04:37,691 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-28 10:04:37,691 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-28 10:04:37,692 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-28 10:04:37,693 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-28 10:04:37,693 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-28 10:04:37,694 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-28 10:04:37,695 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-28 10:04:37,695 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-28 10:04:37,696 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-28 10:04:37,696 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-28 10:04:37,697 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-28 10:04:37,697 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-28 10:04:37,698 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-28 10:04:37,698 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-28 10:04:37,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {16849#false} ~cond := #in~cond; {16849#false} is VALID [2022-04-28 10:04:37,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {16849#false} assume 0 == ~cond; {16849#false} is VALID [2022-04-28 10:04:37,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {16849#false} assume !false; {16849#false} is VALID [2022-04-28 10:04:37,698 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-28 10:04:37,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:37,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576635532] [2022-04-28 10:04:37,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576635532] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:37,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926432711] [2022-04-28 10:04:37,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:37,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:37,704 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-28 10:04:37,727 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-28 10:04:37,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:37,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:37,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:04:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:37,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:37,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {16848#true} call ULTIMATE.init(); {16848#true} is VALID [2022-04-28 10:04:37,983 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-28 10:04:37,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {16848#true} assume true; {16848#true} is VALID [2022-04-28 10:04:37,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16848#true} {16848#true} #50#return; {16848#true} is VALID [2022-04-28 10:04:37,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {16848#true} call #t~ret9 := main(); {16848#true} is VALID [2022-04-28 10:04:37,983 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-28 10:04:37,983 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-28 10:04:37,984 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-28 10:04:37,985 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-28 10:04:37,985 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-28 10:04:37,986 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-28 10:04:37,986 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-28 10:04:37,987 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-28 10:04:37,987 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-28 10:04:37,988 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-28 10:04:37,988 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-28 10:04:37,988 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-28 10:04:37,989 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-28 10:04:37,989 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-28 10:04:37,990 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-28 10:04:37,990 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-28 10:04:37,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {16849#false} ~cond := #in~cond; {16849#false} is VALID [2022-04-28 10:04:37,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {16849#false} assume 0 == ~cond; {16849#false} is VALID [2022-04-28 10:04:37,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {16849#false} assume !false; {16849#false} is VALID [2022-04-28 10:04:37,990 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-28 10:04:37,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:38,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {16849#false} assume !false; {16849#false} is VALID [2022-04-28 10:04:38,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {16849#false} assume 0 == ~cond; {16849#false} is VALID [2022-04-28 10:04:38,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {16849#false} ~cond := #in~cond; {16849#false} is VALID [2022-04-28 10:04:38,305 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-28 10:04:38,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {16952#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16849#false} is VALID [2022-04-28 10:04:38,307 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-28 10:04:38,307 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-28 10:04:38,308 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-28 10:04:38,308 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-28 10:04:38,309 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-28 10:04:38,309 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-28 10:04:38,310 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-28 10:04:38,311 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-28 10:04:38,311 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-28 10:04:38,312 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-28 10:04:38,312 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-28 10:04:38,313 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-28 10:04:38,314 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-28 10:04:38,314 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-28 10:04:38,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {16848#true} call #t~ret9 := main(); {16848#true} is VALID [2022-04-28 10:04:38,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16848#true} {16848#true} #50#return; {16848#true} is VALID [2022-04-28 10:04:38,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {16848#true} assume true; {16848#true} is VALID [2022-04-28 10:04:38,314 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-28 10:04:38,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {16848#true} call ULTIMATE.init(); {16848#true} is VALID [2022-04-28 10:04:38,314 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-28 10:04:38,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926432711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:38,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:38,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:04:38,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:38,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [61071085] [2022-04-28 10:04:38,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [61071085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:38,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:38,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:04:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215151372] [2022-04-28 10:04:38,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:38,315 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-28 10:04:38,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:38,315 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-28 10:04:38,331 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-28 10:04:38,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:04:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:38,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:04:38,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:04:38,332 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-28 10:04:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:39,733 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-04-28 10:04:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:04:39,733 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-28 10:04:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:39,733 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-28 10:04:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 56 transitions. [2022-04-28 10:04:39,734 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-28 10:04:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 56 transitions. [2022-04-28 10:04:39,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 56 transitions. [2022-04-28 10:04:39,780 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-28 10:04:39,781 INFO L225 Difference]: With dead ends: 62 [2022-04-28 10:04:39,781 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 10:04:39,781 INFO L412 NwaCegarLoop]: 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-28 10:04:39,782 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:39,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 91 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:04:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 10:04:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2022-04-28 10:04:39,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:39,951 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-28 10:04:39,951 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-28 10:04:39,951 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-28 10:04:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:39,952 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 10:04:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 10:04:39,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:39,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:39,952 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-28 10:04:39,952 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-28 10:04:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:39,953 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 10:04:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 10:04:39,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:39,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:39,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:39,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:39,954 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-28 10:04:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-28 10:04:39,954 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2022-04-28 10:04:39,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:39,954 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-28 10:04:39,954 INFO L496 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-28 10:04:39,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-28 10:04:40,105 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-28 10:04:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 10:04:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:40,105 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:40,105 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:40,122 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-28 10:04:40,311 WARN L477 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-28 10:04:40,311 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:40,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:40,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1303710453, now seen corresponding path program 69 times [2022-04-28 10:04:40,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:40,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [523456784] [2022-04-28 10:04:40,314 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:40,314 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:40,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1303710453, now seen corresponding path program 70 times [2022-04-28 10:04:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:40,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301148545] [2022-04-28 10:04:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:40,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:40,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:40,524 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-28 10:04:40,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {17366#true} assume true; {17366#true} is VALID [2022-04-28 10:04:40,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17366#true} {17366#true} #50#return; {17366#true} is VALID [2022-04-28 10:04:40,525 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-28 10:04:40,525 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-28 10:04:40,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {17366#true} assume true; {17366#true} is VALID [2022-04-28 10:04:40,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17366#true} {17366#true} #50#return; {17366#true} is VALID [2022-04-28 10:04:40,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {17366#true} call #t~ret9 := main(); {17366#true} is VALID [2022-04-28 10:04:40,525 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-28 10:04:40,526 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-28 10:04:40,526 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-28 10:04:40,527 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-28 10:04:40,528 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-28 10:04:40,528 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-28 10:04:40,529 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-28 10:04:40,530 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-28 10:04:40,530 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-28 10:04:40,531 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-28 10:04:40,531 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-28 10:04:40,532 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-28 10:04:40,532 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-28 10:04:40,532 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-28 10:04:40,533 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-28 10:04:40,533 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-28 10:04:40,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {17367#false} ~cond := #in~cond; {17367#false} is VALID [2022-04-28 10:04:40,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {17367#false} assume 0 == ~cond; {17367#false} is VALID [2022-04-28 10:04:40,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {17367#false} assume !false; {17367#false} is VALID [2022-04-28 10:04:40,533 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-28 10:04:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:40,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301148545] [2022-04-28 10:04:40,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301148545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:40,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730708553] [2022-04-28 10:04:40,533 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:40,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:40,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:40,535 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-28 10:04:40,537 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-28 10:04:40,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:40,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:40,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:04:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:40,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:40,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {17366#true} call ULTIMATE.init(); {17366#true} is VALID [2022-04-28 10:04:40,797 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-28 10:04:40,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {17366#true} assume true; {17366#true} is VALID [2022-04-28 10:04:40,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17366#true} {17366#true} #50#return; {17366#true} is VALID [2022-04-28 10:04:40,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {17366#true} call #t~ret9 := main(); {17366#true} is VALID [2022-04-28 10:04:40,798 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-28 10:04:40,798 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-28 10:04:40,799 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-28 10:04:40,799 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-28 10:04:40,800 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-28 10:04:40,800 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-28 10:04:40,801 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-28 10:04:40,801 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-28 10:04:40,802 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-28 10:04:40,802 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-28 10:04:40,803 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-28 10:04:40,803 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-28 10:04:40,803 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-28 10:04:40,804 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-28 10:04:40,804 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-28 10:04:40,804 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-28 10:04:40,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {17367#false} ~cond := #in~cond; {17367#false} is VALID [2022-04-28 10:04:40,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {17367#false} assume 0 == ~cond; {17367#false} is VALID [2022-04-28 10:04:40,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {17367#false} assume !false; {17367#false} is VALID [2022-04-28 10:04:40,805 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-28 10:04:40,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:41,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {17367#false} assume !false; {17367#false} is VALID [2022-04-28 10:04:41,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {17367#false} assume 0 == ~cond; {17367#false} is VALID [2022-04-28 10:04:41,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {17367#false} ~cond := #in~cond; {17367#false} is VALID [2022-04-28 10:04:41,184 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-28 10:04:41,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {17470#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17367#false} is VALID [2022-04-28 10:04:41,186 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-28 10:04:41,186 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-28 10:04:41,186 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-28 10:04:41,187 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-28 10:04:41,188 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-28 10:04:41,189 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-28 10:04:41,190 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-28 10:04:41,190 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-28 10:04:41,191 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-28 10:04:41,192 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-28 10:04:41,193 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-28 10:04:41,194 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-28 10:04:41,194 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-28 10:04:41,195 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-28 10:04:41,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {17366#true} call #t~ret9 := main(); {17366#true} is VALID [2022-04-28 10:04:41,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17366#true} {17366#true} #50#return; {17366#true} is VALID [2022-04-28 10:04:41,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {17366#true} assume true; {17366#true} is VALID [2022-04-28 10:04:41,195 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-28 10:04:41,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {17366#true} call ULTIMATE.init(); {17366#true} is VALID [2022-04-28 10:04:41,195 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-28 10:04:41,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730708553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:41,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:41,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:04:41,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:41,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [523456784] [2022-04-28 10:04:41,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [523456784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:41,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:41,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:04:41,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698028656] [2022-04-28 10:04:41,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:41,197 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-28 10:04:41,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:41,197 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-28 10:04:41,215 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-28 10:04:41,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:04:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:04:41,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:04:41,215 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-28 10:04:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:42,667 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 10:04:42,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:04:42,667 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-28 10:04:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:42,667 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-28 10:04:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 59 transitions. [2022-04-28 10:04:42,668 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-28 10:04:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 59 transitions. [2022-04-28 10:04:42,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 59 transitions. [2022-04-28 10:04:42,714 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-28 10:04:42,715 INFO L225 Difference]: With dead ends: 65 [2022-04-28 10:04:42,715 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 10:04:42,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:04:42,716 INFO L413 NwaCegarLoop]: 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-28 10:04:42,716 INFO L414 NwaCegarLoop]: 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-28 10:04:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 10:04:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-04-28 10:04:42,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:42,873 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-28 10:04:42,873 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-28 10:04:42,873 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-28 10:04:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:42,874 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 10:04:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 10:04:42,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:42,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:42,874 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-28 10:04:42,874 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-28 10:04:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:42,875 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 10:04:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 10:04:42,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:42,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:42,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:42,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:42,875 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-28 10:04:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-28 10:04:42,876 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2022-04-28 10:04:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:42,876 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-28 10:04:42,876 INFO L496 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-28 10:04:42,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-28 10:04:43,017 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-28 10:04:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 10:04:43,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:43,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:43,017 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:43,040 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-28 10:04:43,231 WARN L477 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-28 10:04:43,231 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash 894193068, now seen corresponding path program 21 times [2022-04-28 10:04:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:43,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1219592210] [2022-04-28 10:04:43,234 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:43,234 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash 894193068, now seen corresponding path program 22 times [2022-04-28 10:04:43,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:43,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043990270] [2022-04-28 10:04:43,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:43,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:43,421 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-28 10:04:43,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-28 10:04:43,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17892#true} {17892#true} #50#return; {17892#true} is VALID [2022-04-28 10:04:43,422 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-28 10:04:43,422 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-28 10:04:43,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-28 10:04:43,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #50#return; {17892#true} is VALID [2022-04-28 10:04:43,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret9 := main(); {17892#true} is VALID [2022-04-28 10:04:43,422 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-28 10:04:43,423 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-28 10:04:43,423 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-28 10:04:43,424 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-28 10:04:43,424 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-28 10:04:43,425 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-28 10:04:43,425 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-28 10:04:43,426 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-28 10:04:43,426 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-28 10:04:43,427 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-28 10:04:43,427 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-28 10:04:43,428 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-28 10:04:43,428 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-28 10:04:43,428 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-28 10:04:43,429 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-28 10:04:43,429 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-28 10:04:43,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-28 10:04:43,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-28 10:04:43,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-28 10:04:43,429 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-28 10:04:43,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:43,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043990270] [2022-04-28 10:04:43,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043990270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:43,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342884606] [2022-04-28 10:04:43,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:43,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:43,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:43,430 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-28 10:04:43,436 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-28 10:04:43,470 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:43,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:43,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:04:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:43,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:43,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-28 10:04:43,729 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-28 10:04:43,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-28 10:04:43,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #50#return; {17892#true} is VALID [2022-04-28 10:04:43,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret9 := main(); {17892#true} is VALID [2022-04-28 10:04:43,729 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-28 10:04:43,730 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-28 10:04:43,730 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-28 10:04:43,731 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-28 10:04:43,732 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-28 10:04:43,733 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-28 10:04:43,733 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-28 10:04:43,734 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-28 10:04:43,735 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-28 10:04:43,735 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-28 10:04:43,736 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-28 10:04:43,737 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-28 10:04:43,737 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-28 10:04:43,738 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-28 10:04:43,738 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-28 10:04:43,738 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-28 10:04:43,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-28 10:04:43,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-28 10:04:43,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-28 10:04:43,739 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-28 10:04:43,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:44,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-28 10:04:44,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-28 10:04:44,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-28 10:04:44,085 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-28 10:04:44,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {17996#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17893#false} is VALID [2022-04-28 10:04:44,085 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-28 10:04:44,085 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-28 10:04:44,086 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-28 10:04:44,087 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-28 10:04:44,087 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-28 10:04:44,088 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-28 10:04:44,088 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-28 10:04:44,089 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-28 10:04:44,090 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-28 10:04:44,090 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-28 10:04:44,091 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-28 10:04:44,091 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-28 10:04:44,092 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-28 10:04:44,092 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-28 10:04:44,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret9 := main(); {17892#true} is VALID [2022-04-28 10:04:44,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #50#return; {17892#true} is VALID [2022-04-28 10:04:44,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-28 10:04:44,093 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-28 10:04:44,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-28 10:04:44,093 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-28 10:04:44,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342884606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:44,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:44,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:04:44,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:44,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1219592210] [2022-04-28 10:04:44,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1219592210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:44,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:44,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:04:44,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991057018] [2022-04-28 10:04:44,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:44,094 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-28 10:04:44,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:44,094 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-28 10:04:44,109 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-28 10:04:44,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:04:44,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:44,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:04:44,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:04:44,110 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-28 10:04:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:45,690 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 10:04:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:04:45,690 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-28 10:04:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:45,690 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-28 10:04:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-04-28 10:04:45,691 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-28 10:04:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-04-28 10:04:45,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 63 transitions. [2022-04-28 10:04:45,743 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-28 10:04:45,743 INFO L225 Difference]: With dead ends: 70 [2022-04-28 10:04:45,743 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 10:04:45,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:04:45,744 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:45,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 99 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:04:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 10:04:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2022-04-28 10:04:45,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:45,909 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-28 10:04:45,909 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-28 10:04:45,909 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-28 10:04:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:45,912 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 10:04:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 10:04:45,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:45,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:45,912 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-28 10:04:45,912 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-28 10:04:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:45,913 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 10:04:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 10:04:45,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:45,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:45,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:45,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:45,913 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-28 10:04:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-04-28 10:04:45,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2022-04-28 10:04:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:45,914 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-04-28 10:04:45,914 INFO L496 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-28 10:04:45,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 45 transitions. [2022-04-28 10:04:46,061 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-28 10:04:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-28 10:04:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:04:46,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:46,062 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:46,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-28 10:04:46,262 WARN L477 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-28 10:04:46,262 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:46,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:46,262 INFO L85 PathProgramCache]: Analyzing trace with hash 690452087, now seen corresponding path program 71 times [2022-04-28 10:04:46,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:46,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005152169] [2022-04-28 10:04:46,265 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:46,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash 690452087, now seen corresponding path program 72 times [2022-04-28 10:04:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:46,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115040294] [2022-04-28 10:04:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:46,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:46,905 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-28 10:04:46,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {18440#true} assume true; {18440#true} is VALID [2022-04-28 10:04:46,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18440#true} {18440#true} #50#return; {18440#true} is VALID [2022-04-28 10:04:46,906 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-28 10:04:46,906 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-28 10:04:46,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {18440#true} assume true; {18440#true} is VALID [2022-04-28 10:04:46,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18440#true} {18440#true} #50#return; {18440#true} is VALID [2022-04-28 10:04:46,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {18440#true} call #t~ret9 := main(); {18440#true} is VALID [2022-04-28 10:04:46,908 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-28 10:04:46,909 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-28 10:04:46,910 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-28 10:04:46,911 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-28 10:04:46,913 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-28 10:04:46,914 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-28 10:04:46,915 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-28 10:04:46,916 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-28 10:04:46,917 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-28 10:04:46,918 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-28 10:04:46,920 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-28 10:04:46,921 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-28 10:04:46,923 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-28 10:04:46,924 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-28 10:04:46,926 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-28 10:04:46,927 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-28 10:04:46,928 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-28 10:04:46,928 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-28 10:04:46,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {18460#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18441#false} is VALID [2022-04-28 10:04:46,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {18441#false} assume !false; {18441#false} is VALID [2022-04-28 10:04:46,929 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-28 10:04:46,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:46,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115040294] [2022-04-28 10:04:46,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115040294] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:46,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417752956] [2022-04-28 10:04:46,929 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:46,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:46,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:46,932 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-28 10:04:46,965 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-28 10:04:46,995 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:04:46,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:46,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:04:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:47,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:47,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {18440#true} call ULTIMATE.init(); {18440#true} is VALID [2022-04-28 10:04:47,280 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-28 10:04:47,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {18440#true} assume true; {18440#true} is VALID [2022-04-28 10:04:47,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18440#true} {18440#true} #50#return; {18440#true} is VALID [2022-04-28 10:04:47,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {18440#true} call #t~ret9 := main(); {18440#true} is VALID [2022-04-28 10:04:47,281 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-28 10:04:47,281 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-28 10:04:47,282 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-28 10:04:47,282 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-28 10:04:47,283 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-28 10:04:47,283 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-28 10:04:47,284 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-28 10:04:47,284 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-28 10:04:47,285 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-28 10:04:47,285 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-28 10:04:47,286 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-28 10:04:47,286 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-28 10:04:47,287 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-28 10:04:47,287 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-28 10:04:47,288 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-28 10:04:47,288 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-28 10:04:47,289 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-28 10:04:47,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {18534#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18538#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:47,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {18538#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18441#false} is VALID [2022-04-28 10:04:47,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {18441#false} assume !false; {18441#false} is VALID [2022-04-28 10:04:47,289 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-28 10:04:47,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:47,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {18441#false} assume !false; {18441#false} is VALID [2022-04-28 10:04:47,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {18538#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18441#false} is VALID [2022-04-28 10:04:47,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {18534#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18538#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:47,623 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-28 10:04:47,623 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-28 10:04:47,624 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-28 10:04:47,625 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-28 10:04:47,626 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-28 10:04:47,627 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-28 10:04:47,628 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-28 10:04:47,629 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-28 10:04:47,629 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-28 10:04:47,630 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-28 10:04:47,630 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-28 10:04:47,631 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-28 10:04:47,632 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-28 10:04:47,633 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-28 10:04:47,634 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-28 10:04:47,635 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-28 10:04:47,635 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-28 10:04:47,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {18440#true} call #t~ret9 := main(); {18440#true} is VALID [2022-04-28 10:04:47,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18440#true} {18440#true} #50#return; {18440#true} is VALID [2022-04-28 10:04:47,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {18440#true} assume true; {18440#true} is VALID [2022-04-28 10:04:47,636 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-28 10:04:47,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {18440#true} call ULTIMATE.init(); {18440#true} is VALID [2022-04-28 10:04:47,636 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-28 10:04:47,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417752956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:47,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:47,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 34 [2022-04-28 10:04:47,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:47,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005152169] [2022-04-28 10:04:47,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005152169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:47,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:47,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:04:47,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243340982] [2022-04-28 10:04:47,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:47,637 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-28 10:04:47,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:47,637 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-28 10:04:47,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:47,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:04:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:04:47,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:04:47,672 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-28 10:04:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:49,502 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-28 10:04:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:04:49,502 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-28 10:04:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:49,502 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-28 10:04:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 36 transitions. [2022-04-28 10:04:49,503 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-28 10:04:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 36 transitions. [2022-04-28 10:04:49,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 36 transitions. [2022-04-28 10:04:49,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:49,541 INFO L225 Difference]: With dead ends: 49 [2022-04-28 10:04:49,541 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 10:04:49,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=206, Invalid=2146, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:04:49,542 INFO L413 NwaCegarLoop]: 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-28 10:04:49,542 INFO L414 NwaCegarLoop]: 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-28 10:04:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 10:04:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-04-28 10:04:49,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:49,748 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-28 10:04:49,748 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-28 10:04:49,748 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-28 10:04:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:49,749 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 10:04:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 10:04:49,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:49,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:49,749 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-28 10:04:49,749 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-28 10:04:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:49,750 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 10:04:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 10:04:49,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:49,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:49,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:49,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:49,750 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-28 10:04:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-28 10:04:49,751 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-28 10:04:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:49,751 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-28 10:04:49,751 INFO L496 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-28 10:04:49,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-28 10:04:49,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:49,937 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:04:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:04:49,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:49,937 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:49,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-28 10:04:50,137 WARN L477 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-28 10:04:50,138 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:50,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1678157194, now seen corresponding path program 73 times [2022-04-28 10:04:50,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:50,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [616904024] [2022-04-28 10:04:50,141 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:50,141 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1678157194, now seen corresponding path program 74 times [2022-04-28 10:04:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:50,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106021675] [2022-04-28 10:04:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:50,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:50,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:50,358 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-28 10:04:50,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {18920#true} assume true; {18920#true} is VALID [2022-04-28 10:04:50,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18920#true} {18920#true} #50#return; {18920#true} is VALID [2022-04-28 10:04:50,358 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-28 10:04:50,359 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-28 10:04:50,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {18920#true} assume true; {18920#true} is VALID [2022-04-28 10:04:50,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18920#true} {18920#true} #50#return; {18920#true} is VALID [2022-04-28 10:04:50,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {18920#true} call #t~ret9 := main(); {18920#true} is VALID [2022-04-28 10:04:50,362 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-28 10:04:50,362 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-28 10:04:50,363 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-28 10:04:50,363 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-28 10:04:50,364 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-28 10:04:50,364 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-28 10:04:50,365 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-28 10:04:50,365 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-28 10:04:50,365 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-28 10:04:50,366 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-28 10:04:50,366 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-28 10:04:50,367 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-28 10:04:50,367 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-28 10:04:50,368 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-28 10:04:50,368 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-28 10:04:50,369 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-28 10:04:50,369 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-28 10:04:50,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {18921#false} ~cond := #in~cond; {18921#false} is VALID [2022-04-28 10:04:50,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {18921#false} assume 0 == ~cond; {18921#false} is VALID [2022-04-28 10:04:50,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {18921#false} assume !false; {18921#false} is VALID [2022-04-28 10:04:50,369 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-28 10:04:50,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:50,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106021675] [2022-04-28 10:04:50,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106021675] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:50,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268066370] [2022-04-28 10:04:50,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:50,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:50,370 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-28 10:04:50,371 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-28 10:04:50,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:50,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:50,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:04:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:50,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:50,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {18920#true} call ULTIMATE.init(); {18920#true} is VALID [2022-04-28 10:04:50,662 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-28 10:04:50,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {18920#true} assume true; {18920#true} is VALID [2022-04-28 10:04:50,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18920#true} {18920#true} #50#return; {18920#true} is VALID [2022-04-28 10:04:50,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {18920#true} call #t~ret9 := main(); {18920#true} is VALID [2022-04-28 10:04:50,663 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-28 10:04:50,663 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-28 10:04:50,664 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-28 10:04:50,665 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-28 10:04:50,665 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-28 10:04:50,666 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-28 10:04:50,666 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-28 10:04:50,667 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-28 10:04:50,667 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-28 10:04:50,667 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-28 10:04:50,668 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-28 10:04:50,668 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-28 10:04:50,669 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-28 10:04:50,669 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-28 10:04:50,670 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-28 10:04:50,670 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-28 10:04:50,670 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-28 10:04:50,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {18921#false} ~cond := #in~cond; {18921#false} is VALID [2022-04-28 10:04:50,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {18921#false} assume 0 == ~cond; {18921#false} is VALID [2022-04-28 10:04:50,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {18921#false} assume !false; {18921#false} is VALID [2022-04-28 10:04:50,671 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-28 10:04:50,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:51,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {18921#false} assume !false; {18921#false} is VALID [2022-04-28 10:04:51,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {18921#false} assume 0 == ~cond; {18921#false} is VALID [2022-04-28 10:04:51,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {18921#false} ~cond := #in~cond; {18921#false} is VALID [2022-04-28 10:04:51,044 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-28 10:04:51,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {19028#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18921#false} is VALID [2022-04-28 10:04:51,045 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-28 10:04:51,046 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-28 10:04:51,047 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-28 10:04:51,047 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-28 10:04:51,048 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-28 10:04:51,049 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-28 10:04:51,049 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-28 10:04:51,050 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-28 10:04:51,050 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-28 10:04:51,051 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-28 10:04:51,052 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-28 10:04:51,052 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-28 10:04:51,053 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-28 10:04:51,054 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-28 10:04:51,054 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-28 10:04:51,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {18920#true} call #t~ret9 := main(); {18920#true} is VALID [2022-04-28 10:04:51,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18920#true} {18920#true} #50#return; {18920#true} is VALID [2022-04-28 10:04:51,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {18920#true} assume true; {18920#true} is VALID [2022-04-28 10:04:51,054 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-28 10:04:51,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {18920#true} call ULTIMATE.init(); {18920#true} is VALID [2022-04-28 10:04:51,054 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-28 10:04:51,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268066370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:51,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:51,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:04:51,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:51,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [616904024] [2022-04-28 10:04:51,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [616904024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:51,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:51,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:04:51,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324904320] [2022-04-28 10:04:51,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:51,055 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-28 10:04:51,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:51,056 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-28 10:04:51,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:51,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:04:51,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:51,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:04:51,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:04:51,074 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-28 10:04:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:52,383 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 10:04:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:04:52,383 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-28 10:04:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:52,383 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-28 10:04:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-28 10:04:52,383 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-28 10:04:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-28 10:04:52,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 49 transitions. [2022-04-28 10:04:52,420 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-28 10:04:52,420 INFO L225 Difference]: With dead ends: 58 [2022-04-28 10:04:52,420 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 10:04:52,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=473, Invalid=2077, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:04:52,421 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:52,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 74 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 10:04:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-04-28 10:04:52,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:52,625 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-28 10:04:52,625 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-28 10:04:52,626 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-28 10:04:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:52,626 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-28 10:04:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-28 10:04:52,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:52,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:52,626 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-28 10:04:52,626 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-28 10:04:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:52,627 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-28 10:04:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-28 10:04:52,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:52,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:52,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:52,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:52,627 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-28 10:04:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-28 10:04:52,628 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-28 10:04:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:52,628 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-28 10:04:52,628 INFO L496 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-28 10:04:52,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-28 10:04:52,841 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-28 10:04:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:04:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:04:52,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:52,842 INFO L195 NwaCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:52,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-04-28 10:04:53,042 WARN L477 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-28 10:04:53,042 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:53,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1754563945, now seen corresponding path program 75 times [2022-04-28 10:04:53,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:53,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [793286669] [2022-04-28 10:04:53,045 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:53,045 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1754563945, now seen corresponding path program 76 times [2022-04-28 10:04:53,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:53,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419403199] [2022-04-28 10:04:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:53,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:53,300 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-28 10:04:53,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {19442#true} assume true; {19442#true} is VALID [2022-04-28 10:04:53,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19442#true} {19442#true} #50#return; {19442#true} is VALID [2022-04-28 10:04:53,300 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-28 10:04:53,300 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-28 10:04:53,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {19442#true} assume true; {19442#true} is VALID [2022-04-28 10:04:53,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19442#true} {19442#true} #50#return; {19442#true} is VALID [2022-04-28 10:04:53,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {19442#true} call #t~ret9 := main(); {19442#true} is VALID [2022-04-28 10:04:53,301 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-28 10:04:53,302 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-28 10:04:53,302 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-28 10:04:53,303 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-28 10:04:53,304 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-28 10:04:53,304 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-28 10:04:53,305 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-28 10:04:53,306 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-28 10:04:53,306 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-28 10:04:53,307 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-28 10:04:53,307 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-28 10:04:53,308 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-28 10:04:53,308 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-28 10:04:53,309 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-28 10:04:53,310 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-28 10:04:53,310 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-28 10:04:53,310 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-28 10:04:53,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {19443#false} ~cond := #in~cond; {19443#false} is VALID [2022-04-28 10:04:53,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {19443#false} assume 0 == ~cond; {19443#false} is VALID [2022-04-28 10:04:53,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {19443#false} assume !false; {19443#false} is VALID [2022-04-28 10:04:53,311 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-28 10:04:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:53,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419403199] [2022-04-28 10:04:53,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419403199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:53,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108875987] [2022-04-28 10:04:53,311 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:53,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:53,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:53,324 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-28 10:04:53,327 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-28 10:04:53,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:53,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:53,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:04:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:53,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:53,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {19442#true} call ULTIMATE.init(); {19442#true} is VALID [2022-04-28 10:04:53,610 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-28 10:04:53,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {19442#true} assume true; {19442#true} is VALID [2022-04-28 10:04:53,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19442#true} {19442#true} #50#return; {19442#true} is VALID [2022-04-28 10:04:53,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {19442#true} call #t~ret9 := main(); {19442#true} is VALID [2022-04-28 10:04:53,610 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-28 10:04:53,611 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-28 10:04:53,611 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-28 10:04:53,612 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-28 10:04:53,612 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-28 10:04:53,613 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-28 10:04:53,613 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-28 10:04:53,614 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-28 10:04:53,614 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-28 10:04:53,614 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-28 10:04:53,615 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-28 10:04:53,615 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-28 10:04:53,616 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-28 10:04:53,616 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-28 10:04:53,617 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-28 10:04:53,617 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-28 10:04:53,617 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-28 10:04:53,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {19443#false} ~cond := #in~cond; {19443#false} is VALID [2022-04-28 10:04:53,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {19443#false} assume 0 == ~cond; {19443#false} is VALID [2022-04-28 10:04:53,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {19443#false} assume !false; {19443#false} is VALID [2022-04-28 10:04:53,617 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-28 10:04:53,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:53,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {19443#false} assume !false; {19443#false} is VALID [2022-04-28 10:04:53,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {19443#false} assume 0 == ~cond; {19443#false} is VALID [2022-04-28 10:04:53,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {19443#false} ~cond := #in~cond; {19443#false} is VALID [2022-04-28 10:04:53,977 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-28 10:04:53,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {19550#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {19443#false} is VALID [2022-04-28 10:04:53,978 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-28 10:04:53,979 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-28 10:04:53,979 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-28 10:04:53,980 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-28 10:04:53,980 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-28 10:04:53,980 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-28 10:04:53,981 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-28 10:04:53,982 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-28 10:04:53,982 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-28 10:04:53,983 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-28 10:04:53,984 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-28 10:04:53,984 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-28 10:04:53,985 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-28 10:04:53,986 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-28 10:04:53,986 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-28 10:04:53,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {19442#true} call #t~ret9 := main(); {19442#true} is VALID [2022-04-28 10:04:53,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19442#true} {19442#true} #50#return; {19442#true} is VALID [2022-04-28 10:04:53,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {19442#true} assume true; {19442#true} is VALID [2022-04-28 10:04:53,986 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-28 10:04:53,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {19442#true} call ULTIMATE.init(); {19442#true} is VALID [2022-04-28 10:04:53,986 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-28 10:04:53,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108875987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:53,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:53,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:04:53,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:53,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [793286669] [2022-04-28 10:04:53,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [793286669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:53,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:53,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:04:53,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526209209] [2022-04-28 10:04:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:53,987 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-28 10:04:53,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:53,987 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-28 10:04:54,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:54,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:04:54,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:54,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:04:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:04:54,005 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-28 10:04:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:55,539 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-28 10:04:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:04:55,539 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-28 10:04:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:55,540 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-28 10:04:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 56 transitions. [2022-04-28 10:04:55,540 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-28 10:04:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 56 transitions. [2022-04-28 10:04:55,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 56 transitions. [2022-04-28 10:04:55,583 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-28 10:04:55,584 INFO L225 Difference]: With dead ends: 64 [2022-04-28 10:04:55,584 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 10:04:55,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:04:55,585 INFO L413 NwaCegarLoop]: 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-28 10:04:55,585 INFO L414 NwaCegarLoop]: 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-28 10:04:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 10:04:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-04-28 10:04:55,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:55,808 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-28 10:04:55,808 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-28 10:04:55,808 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-28 10:04:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:55,808 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 10:04:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 10:04:55,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:55,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:55,809 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-28 10:04:55,809 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-28 10:04:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:55,809 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 10:04:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 10:04:55,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:55,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:55,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:55,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:55,810 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-28 10:04:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-28 10:04:55,810 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-28 10:04:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:55,810 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-28 10:04:55,810 INFO L496 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-28 10:04:55,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-28 10:04:56,005 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-28 10:04:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:04:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:04:56,006 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:56,006 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:56,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-04-28 10:04:56,206 WARN L477 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-28 10:04:56,206 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash -787197354, now seen corresponding path program 77 times [2022-04-28 10:04:56,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:56,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1769156456] [2022-04-28 10:04:56,212 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:56,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:56,212 INFO L85 PathProgramCache]: Analyzing trace with hash -787197354, now seen corresponding path program 78 times [2022-04-28 10:04:56,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:56,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447937044] [2022-04-28 10:04:56,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:56,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:56,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:56,446 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-28 10:04:56,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {19992#true} assume true; {19992#true} is VALID [2022-04-28 10:04:56,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19992#true} {19992#true} #50#return; {19992#true} is VALID [2022-04-28 10:04:56,447 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-28 10:04:56,447 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-28 10:04:56,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {19992#true} assume true; {19992#true} is VALID [2022-04-28 10:04:56,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19992#true} {19992#true} #50#return; {19992#true} is VALID [2022-04-28 10:04:56,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {19992#true} call #t~ret9 := main(); {19992#true} is VALID [2022-04-28 10:04:56,448 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-28 10:04:56,448 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-28 10:04:56,449 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-28 10:04:56,450 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-28 10:04:56,450 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-28 10:04:56,451 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-28 10:04:56,452 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-28 10:04:56,452 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-28 10:04:56,453 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-28 10:04:56,454 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-28 10:04:56,454 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-28 10:04:56,455 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-28 10:04:56,455 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-28 10:04:56,456 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-28 10:04:56,457 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-28 10:04:56,457 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-28 10:04:56,457 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-28 10:04:56,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {19993#false} ~cond := #in~cond; {19993#false} is VALID [2022-04-28 10:04:56,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {19993#false} assume 0 == ~cond; {19993#false} is VALID [2022-04-28 10:04:56,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {19993#false} assume !false; {19993#false} is VALID [2022-04-28 10:04:56,458 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-28 10:04:56,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:56,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447937044] [2022-04-28 10:04:56,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447937044] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:56,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288953262] [2022-04-28 10:04:56,458 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:56,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:56,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:56,459 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-28 10:04:56,465 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-28 10:04:56,530 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:04:56,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:56,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:04:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:56,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:56,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {19992#true} call ULTIMATE.init(); {19992#true} is VALID [2022-04-28 10:04:56,783 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-28 10:04:56,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {19992#true} assume true; {19992#true} is VALID [2022-04-28 10:04:56,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19992#true} {19992#true} #50#return; {19992#true} is VALID [2022-04-28 10:04:56,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {19992#true} call #t~ret9 := main(); {19992#true} is VALID [2022-04-28 10:04:56,784 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-28 10:04:56,784 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-28 10:04:56,785 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-28 10:04:56,785 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-28 10:04:56,786 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-28 10:04:56,786 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-28 10:04:56,787 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-28 10:04:56,787 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-28 10:04:56,788 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-28 10:04:56,788 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-28 10:04:56,789 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-28 10:04:56,789 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-28 10:04:56,789 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-28 10:04:56,790 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-28 10:04:56,790 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-28 10:04:56,791 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-28 10:04:56,791 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-28 10:04:56,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {19993#false} ~cond := #in~cond; {19993#false} is VALID [2022-04-28 10:04:56,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {19993#false} assume 0 == ~cond; {19993#false} is VALID [2022-04-28 10:04:56,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {19993#false} assume !false; {19993#false} is VALID [2022-04-28 10:04:56,791 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-28 10:04:56,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:57,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {19993#false} assume !false; {19993#false} is VALID [2022-04-28 10:04:57,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {19993#false} assume 0 == ~cond; {19993#false} is VALID [2022-04-28 10:04:57,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {19993#false} ~cond := #in~cond; {19993#false} is VALID [2022-04-28 10:04:57,148 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-28 10:04:57,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {20100#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {19993#false} is VALID [2022-04-28 10:04:57,150 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-28 10:04:57,151 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-28 10:04:57,152 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-28 10:04:57,152 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-28 10:04:57,152 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-28 10:04:57,153 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-28 10:04:57,154 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-28 10:04:57,168 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-28 10:04:57,169 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-28 10:04:57,170 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-28 10:04:57,170 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-28 10:04:57,171 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-28 10:04:57,172 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-28 10:04:57,173 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-28 10:04:57,173 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-28 10:04:57,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {19992#true} call #t~ret9 := main(); {19992#true} is VALID [2022-04-28 10:04:57,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19992#true} {19992#true} #50#return; {19992#true} is VALID [2022-04-28 10:04:57,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {19992#true} assume true; {19992#true} is VALID [2022-04-28 10:04:57,174 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-28 10:04:57,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {19992#true} call ULTIMATE.init(); {19992#true} is VALID [2022-04-28 10:04:57,174 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-28 10:04:57,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288953262] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:57,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:57,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:04:57,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:57,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1769156456] [2022-04-28 10:04:57,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1769156456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:57,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:57,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:04:57,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964521084] [2022-04-28 10:04:57,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:57,175 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-28 10:04:57,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:57,175 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-28 10:04:57,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:57,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:04:57,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:04:57,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:04:57,197 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-28 10:04:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:58,888 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 10:04:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:04:58,888 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-28 10:04:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:58,888 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-28 10:04:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-28 10:04:58,889 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-28 10:04:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-28 10:04:58,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2022-04-28 10:04:58,935 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-28 10:04:58,935 INFO L225 Difference]: With dead ends: 69 [2022-04-28 10:04:58,936 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 10:04:58,936 INFO L412 NwaCegarLoop]: 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-28 10:04:58,936 INFO L413 NwaCegarLoop]: 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-28 10:04:58,937 INFO L414 NwaCegarLoop]: 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-28 10:04:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 10:04:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 39. [2022-04-28 10:04:59,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:59,155 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-28 10:04:59,155 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-28 10:04:59,155 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-28 10:04:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:59,156 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 10:04:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 10:04:59,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:59,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:59,157 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-28 10:04:59,157 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-28 10:04:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:59,158 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 10:04:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 10:04:59,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:59,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:59,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:59,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:59,158 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-28 10:04:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-28 10:04:59,159 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-28 10:04:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:59,159 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-28 10:04:59,159 INFO L496 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-28 10:04:59,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-28 10:04:59,371 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-28 10:04:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:04:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:04:59,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:59,372 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:59,388 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-28 10:04:59,572 WARN L477 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-28 10:04:59,572 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1725823305, now seen corresponding path program 79 times [2022-04-28 10:04:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:59,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1017619473] [2022-04-28 10:04:59,576 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:59,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1725823305, now seen corresponding path program 80 times [2022-04-28 10:04:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:59,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832524175] [2022-04-28 10:04:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:59,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:59,791 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-28 10:04:59,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {20560#true} assume true; {20560#true} is VALID [2022-04-28 10:04:59,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20560#true} {20560#true} #50#return; {20560#true} is VALID [2022-04-28 10:04:59,792 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-28 10:04:59,792 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-28 10:04:59,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {20560#true} assume true; {20560#true} is VALID [2022-04-28 10:04:59,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20560#true} {20560#true} #50#return; {20560#true} is VALID [2022-04-28 10:04:59,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {20560#true} call #t~ret9 := main(); {20560#true} is VALID [2022-04-28 10:04:59,792 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-28 10:04:59,793 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-28 10:04:59,793 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-28 10:04:59,794 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-28 10:04:59,794 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-28 10:04:59,795 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-28 10:04:59,795 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-28 10:04:59,796 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-28 10:04:59,796 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-28 10:04:59,797 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-28 10:04:59,797 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-28 10:04:59,798 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-28 10:04:59,798 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-28 10:04:59,798 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-28 10:04:59,799 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-28 10:04:59,799 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-28 10:04:59,799 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-28 10:04:59,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {20561#false} ~cond := #in~cond; {20561#false} is VALID [2022-04-28 10:04:59,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {20561#false} assume 0 == ~cond; {20561#false} is VALID [2022-04-28 10:04:59,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {20561#false} assume !false; {20561#false} is VALID [2022-04-28 10:04:59,800 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-28 10:04:59,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:59,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832524175] [2022-04-28 10:04:59,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832524175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:59,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847768376] [2022-04-28 10:04:59,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:59,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:59,801 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-28 10:04:59,801 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-28 10:04:59,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:59,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:59,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:04:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:59,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:00,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {20560#true} call ULTIMATE.init(); {20560#true} is VALID [2022-04-28 10:05:00,072 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-28 10:05:00,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {20560#true} assume true; {20560#true} is VALID [2022-04-28 10:05:00,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20560#true} {20560#true} #50#return; {20560#true} is VALID [2022-04-28 10:05:00,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {20560#true} call #t~ret9 := main(); {20560#true} is VALID [2022-04-28 10:05:00,073 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-28 10:05:00,073 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-28 10:05:00,074 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-28 10:05:00,074 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-28 10:05:00,075 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-28 10:05:00,075 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-28 10:05:00,076 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-28 10:05:00,076 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-28 10:05:00,077 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-28 10:05:00,077 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-28 10:05:00,078 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-28 10:05:00,078 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-28 10:05:00,078 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-28 10:05:00,079 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-28 10:05:00,079 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-28 10:05:00,080 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-28 10:05:00,080 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-28 10:05:00,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {20561#false} ~cond := #in~cond; {20561#false} is VALID [2022-04-28 10:05:00,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {20561#false} assume 0 == ~cond; {20561#false} is VALID [2022-04-28 10:05:00,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {20561#false} assume !false; {20561#false} is VALID [2022-04-28 10:05:00,080 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-28 10:05:00,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:00,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {20561#false} assume !false; {20561#false} is VALID [2022-04-28 10:05:00,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {20561#false} assume 0 == ~cond; {20561#false} is VALID [2022-04-28 10:05:00,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {20561#false} ~cond := #in~cond; {20561#false} is VALID [2022-04-28 10:05:00,431 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-28 10:05:00,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {20668#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20561#false} is VALID [2022-04-28 10:05:00,432 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-28 10:05:00,433 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-28 10:05:00,433 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-28 10:05:00,433 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-28 10:05:00,434 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-28 10:05:00,435 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-28 10:05:00,435 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-28 10:05:00,436 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-28 10:05:00,436 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-28 10:05:00,437 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-28 10:05:00,438 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-28 10:05:00,438 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-28 10:05:00,439 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-28 10:05:00,439 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-28 10:05:00,440 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-28 10:05:00,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {20560#true} call #t~ret9 := main(); {20560#true} is VALID [2022-04-28 10:05:00,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20560#true} {20560#true} #50#return; {20560#true} is VALID [2022-04-28 10:05:00,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {20560#true} assume true; {20560#true} is VALID [2022-04-28 10:05:00,440 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-28 10:05:00,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {20560#true} call ULTIMATE.init(); {20560#true} is VALID [2022-04-28 10:05:00,440 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-28 10:05:00,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847768376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:00,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:00,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:05:00,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:00,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1017619473] [2022-04-28 10:05:00,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1017619473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:00,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:00,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:05:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793374432] [2022-04-28 10:05:00,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:00,441 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-28 10:05:00,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:00,441 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-28 10:05:00,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:00,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:05:00,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:00,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:05:00,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:05:00,458 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-28 10:05:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:02,252 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-28 10:05:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:05:02,252 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-28 10:05:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:02,252 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-28 10:05:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 62 transitions. [2022-04-28 10:05:02,253 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-28 10:05:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 62 transitions. [2022-04-28 10:05:02,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 62 transitions. [2022-04-28 10:05:02,303 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-28 10:05:02,304 INFO L225 Difference]: With dead ends: 73 [2022-04-28 10:05:02,304 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 10:05:02,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:05:02,305 INFO L413 NwaCegarLoop]: 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-28 10:05:02,305 INFO L414 NwaCegarLoop]: 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-28 10:05:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 10:05:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2022-04-28 10:05:02,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:02,534 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-28 10:05:02,534 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-28 10:05:02,534 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-28 10:05:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:02,535 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-04-28 10:05:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-04-28 10:05:02,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:02,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:02,535 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-28 10:05:02,535 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-28 10:05:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:02,538 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-04-28 10:05:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-04-28 10:05:02,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:02,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:02,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:02,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:02,539 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-28 10:05:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-28 10:05:02,540 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-28 10:05:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:02,540 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-28 10:05:02,540 INFO L496 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-28 10:05:02,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-28 10:05:02,743 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-28 10:05:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:05:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:05:02,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:02,744 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:02,766 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-28 10:05:02,966 WARN L477 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-28 10:05:02,966 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:02,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1984676406, now seen corresponding path program 81 times [2022-04-28 10:05:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:02,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1401279512] [2022-04-28 10:05:02,968 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:02,968 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1984676406, now seen corresponding path program 82 times [2022-04-28 10:05:02,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:02,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820396455] [2022-04-28 10:05:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:02,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:03,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:03,204 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-28 10:05:03,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {21138#true} assume true; {21138#true} is VALID [2022-04-28 10:05:03,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21138#true} {21138#true} #50#return; {21138#true} is VALID [2022-04-28 10:05:03,205 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-28 10:05:03,205 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-28 10:05:03,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {21138#true} assume true; {21138#true} is VALID [2022-04-28 10:05:03,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21138#true} {21138#true} #50#return; {21138#true} is VALID [2022-04-28 10:05:03,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {21138#true} call #t~ret9 := main(); {21138#true} is VALID [2022-04-28 10:05:03,205 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-28 10:05:03,206 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-28 10:05:03,206 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-28 10:05:03,207 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-28 10:05:03,208 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-28 10:05:03,208 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-28 10:05:03,209 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-28 10:05:03,210 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-28 10:05:03,210 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-28 10:05:03,211 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-28 10:05:03,211 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-28 10:05:03,212 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-28 10:05:03,213 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-28 10:05:03,213 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-28 10:05:03,214 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-28 10:05:03,214 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-28 10:05:03,214 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-28 10:05:03,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {21139#false} ~cond := #in~cond; {21139#false} is VALID [2022-04-28 10:05:03,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {21139#false} assume 0 == ~cond; {21139#false} is VALID [2022-04-28 10:05:03,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {21139#false} assume !false; {21139#false} is VALID [2022-04-28 10:05:03,215 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-28 10:05:03,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:03,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820396455] [2022-04-28 10:05:03,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820396455] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:03,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515495657] [2022-04-28 10:05:03,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:03,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:03,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:03,220 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-28 10:05:03,221 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-28 10:05:03,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:03,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:03,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:05:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:03,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:03,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {21138#true} call ULTIMATE.init(); {21138#true} is VALID [2022-04-28 10:05:03,506 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-28 10:05:03,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {21138#true} assume true; {21138#true} is VALID [2022-04-28 10:05:03,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21138#true} {21138#true} #50#return; {21138#true} is VALID [2022-04-28 10:05:03,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {21138#true} call #t~ret9 := main(); {21138#true} is VALID [2022-04-28 10:05:03,506 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-28 10:05:03,507 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-28 10:05:03,507 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-28 10:05:03,508 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-28 10:05:03,509 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-28 10:05:03,509 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-28 10:05:03,510 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-28 10:05:03,510 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-28 10:05:03,511 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-28 10:05:03,511 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-28 10:05:03,512 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-28 10:05:03,512 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-28 10:05:03,512 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-28 10:05:03,513 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-28 10:05:03,513 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-28 10:05:03,514 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-28 10:05:03,514 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-28 10:05:03,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {21139#false} ~cond := #in~cond; {21139#false} is VALID [2022-04-28 10:05:03,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {21139#false} assume 0 == ~cond; {21139#false} is VALID [2022-04-28 10:05:03,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {21139#false} assume !false; {21139#false} is VALID [2022-04-28 10:05:03,514 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-28 10:05:03,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:03,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {21139#false} assume !false; {21139#false} is VALID [2022-04-28 10:05:03,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {21139#false} assume 0 == ~cond; {21139#false} is VALID [2022-04-28 10:05:03,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {21139#false} ~cond := #in~cond; {21139#false} is VALID [2022-04-28 10:05:03,875 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-28 10:05:03,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {21246#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21139#false} is VALID [2022-04-28 10:05:03,876 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-28 10:05:03,877 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-28 10:05:03,877 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-28 10:05:03,878 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-28 10:05:03,878 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-28 10:05:03,879 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-28 10:05:03,880 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-28 10:05:03,880 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-28 10:05:03,881 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-28 10:05:03,881 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-28 10:05:03,882 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-28 10:05:03,883 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-28 10:05:03,883 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-28 10:05:03,884 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-28 10:05:03,884 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-28 10:05:03,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {21138#true} call #t~ret9 := main(); {21138#true} is VALID [2022-04-28 10:05:03,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21138#true} {21138#true} #50#return; {21138#true} is VALID [2022-04-28 10:05:03,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {21138#true} assume true; {21138#true} is VALID [2022-04-28 10:05:03,884 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-28 10:05:03,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {21138#true} call ULTIMATE.init(); {21138#true} is VALID [2022-04-28 10:05:03,885 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-28 10:05:03,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515495657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:03,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:03,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:05:03,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:03,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1401279512] [2022-04-28 10:05:03,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1401279512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:03,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:03,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:05:03,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68931603] [2022-04-28 10:05:03,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:03,885 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-28 10:05:03,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:03,886 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-28 10:05:03,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:03,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:05:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:03,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:05:03,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:05:03,918 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-28 10:05:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:05,881 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2022-04-28 10:05:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:05:05,881 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-28 10:05:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:05,881 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-28 10:05:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-28 10:05:05,882 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-28 10:05:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-28 10:05:05,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-04-28 10:05:05,936 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-28 10:05:05,936 INFO L225 Difference]: With dead ends: 76 [2022-04-28 10:05:05,937 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 10:05:05,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:05:05,937 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 49 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:05,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 105 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:05:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 10:05:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2022-04-28 10:05:06,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:06,191 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-28 10:05:06,191 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-28 10:05:06,191 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-28 10:05:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:06,192 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-28 10:05:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-28 10:05:06,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:06,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:06,192 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-28 10:05:06,192 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-28 10:05:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:06,193 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-28 10:05:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-28 10:05:06,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:06,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:06,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:06,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:06,193 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-28 10:05:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-28 10:05:06,193 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-28 10:05:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:06,193 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-28 10:05:06,193 INFO L496 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-28 10:05:06,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-28 10:05:06,447 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-28 10:05:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:05:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:05:06,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:06,448 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:06,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-04-28 10:05:06,648 WARN L477 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-28 10:05:06,648 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:06,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:06,649 INFO L85 PathProgramCache]: Analyzing trace with hash -112387369, now seen corresponding path program 23 times [2022-04-28 10:05:06,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:06,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [897237736] [2022-04-28 10:05:06,651 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:06,651 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash -112387369, now seen corresponding path program 24 times [2022-04-28 10:05:06,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:06,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917995607] [2022-04-28 10:05:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:06,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:06,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:06,863 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-28 10:05:06,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {21724#true} assume true; {21724#true} is VALID [2022-04-28 10:05:06,864 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21724#true} {21724#true} #50#return; {21724#true} is VALID [2022-04-28 10:05:06,864 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-28 10:05:06,864 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-28 10:05:06,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {21724#true} assume true; {21724#true} is VALID [2022-04-28 10:05:06,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21724#true} {21724#true} #50#return; {21724#true} is VALID [2022-04-28 10:05:06,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {21724#true} call #t~ret9 := main(); {21724#true} is VALID [2022-04-28 10:05:06,865 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-28 10:05:06,865 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-28 10:05:06,865 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-28 10:05:06,866 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-28 10:05:06,866 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-28 10:05:06,867 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-28 10:05:06,867 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-28 10:05:06,868 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-28 10:05:06,868 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-28 10:05:06,869 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-28 10:05:06,869 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-28 10:05:06,870 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-28 10:05:06,870 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-28 10:05:06,871 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-28 10:05:06,871 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-28 10:05:06,872 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-28 10:05:06,872 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-28 10:05:06,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {21725#false} ~cond := #in~cond; {21725#false} is VALID [2022-04-28 10:05:06,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {21725#false} assume 0 == ~cond; {21725#false} is VALID [2022-04-28 10:05:06,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {21725#false} assume !false; {21725#false} is VALID [2022-04-28 10:05:06,872 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-28 10:05:06,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:06,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917995607] [2022-04-28 10:05:06,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917995607] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:06,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334813474] [2022-04-28 10:05:06,872 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:06,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:06,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:06,876 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-28 10:05:06,879 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-28 10:05:06,938 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:05:06,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:06,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:05:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:06,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:07,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {21724#true} call ULTIMATE.init(); {21724#true} is VALID [2022-04-28 10:05:07,201 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-28 10:05:07,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {21724#true} assume true; {21724#true} is VALID [2022-04-28 10:05:07,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21724#true} {21724#true} #50#return; {21724#true} is VALID [2022-04-28 10:05:07,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {21724#true} call #t~ret9 := main(); {21724#true} is VALID [2022-04-28 10:05:07,201 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-28 10:05:07,202 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-28 10:05:07,202 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-28 10:05:07,203 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-28 10:05:07,204 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-28 10:05:07,205 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-28 10:05:07,205 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-28 10:05:07,206 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-28 10:05:07,207 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-28 10:05:07,207 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-28 10:05:07,208 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-28 10:05:07,208 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-28 10:05:07,209 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-28 10:05:07,210 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-28 10:05:07,210 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-28 10:05:07,211 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-28 10:05:07,211 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-28 10:05:07,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {21725#false} ~cond := #in~cond; {21725#false} is VALID [2022-04-28 10:05:07,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {21725#false} assume 0 == ~cond; {21725#false} is VALID [2022-04-28 10:05:07,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {21725#false} assume !false; {21725#false} is VALID [2022-04-28 10:05:07,211 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-28 10:05:07,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:07,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {21725#false} assume !false; {21725#false} is VALID [2022-04-28 10:05:07,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {21725#false} assume 0 == ~cond; {21725#false} is VALID [2022-04-28 10:05:07,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {21725#false} ~cond := #in~cond; {21725#false} is VALID [2022-04-28 10:05:07,586 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-28 10:05:07,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {21832#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21725#false} is VALID [2022-04-28 10:05:07,587 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-28 10:05:07,587 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-28 10:05:07,588 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-28 10:05:07,589 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-28 10:05:07,589 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-28 10:05:07,590 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-28 10:05:07,591 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-28 10:05:07,591 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-28 10:05:07,592 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-28 10:05:07,592 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-28 10:05:07,593 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-28 10:05:07,594 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-28 10:05:07,594 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-28 10:05:07,595 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-28 10:05:07,595 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-28 10:05:07,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {21724#true} call #t~ret9 := main(); {21724#true} is VALID [2022-04-28 10:05:07,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21724#true} {21724#true} #50#return; {21724#true} is VALID [2022-04-28 10:05:07,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {21724#true} assume true; {21724#true} is VALID [2022-04-28 10:05:07,595 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-28 10:05:07,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {21724#true} call ULTIMATE.init(); {21724#true} is VALID [2022-04-28 10:05:07,596 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-28 10:05:07,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334813474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:07,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:07,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:05:07,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:07,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [897237736] [2022-04-28 10:05:07,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [897237736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:07,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:07,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:05:07,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702611410] [2022-04-28 10:05:07,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:07,596 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-28 10:05:07,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:07,597 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-28 10:05:07,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:07,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:05:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:07,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:05:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:05:07,613 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-28 10:05:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:09,661 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-28 10:05:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:05:09,661 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-28 10:05:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:09,661 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-28 10:05:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 69 transitions. [2022-04-28 10:05:09,662 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-28 10:05:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 69 transitions. [2022-04-28 10:05:09,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 69 transitions. [2022-04-28 10:05:09,720 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-28 10:05:09,721 INFO L225 Difference]: With dead ends: 81 [2022-04-28 10:05:09,721 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 10:05:09,721 INFO L412 NwaCegarLoop]: 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-28 10:05:09,722 INFO L413 NwaCegarLoop]: 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-28 10:05:09,722 INFO L414 NwaCegarLoop]: 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-28 10:05:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 10:05:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 41. [2022-04-28 10:05:09,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:09,949 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-28 10:05:09,949 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-28 10:05:09,950 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-28 10:05:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:09,950 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 10:05:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 10:05:09,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:09,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:09,951 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-28 10:05:09,951 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-28 10:05:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:09,952 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 10:05:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 10:05:09,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:09,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:09,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:09,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:09,952 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-28 10:05:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-28 10:05:09,953 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 25 [2022-04-28 10:05:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:09,953 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-28 10:05:09,953 INFO L496 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-28 10:05:09,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-28 10:05:10,173 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-28 10:05:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-28 10:05:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:05:10,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:10,174 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:10,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-28 10:05:10,374 WARN L477 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-28 10:05:10,374 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:10,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:10,374 INFO L85 PathProgramCache]: Analyzing trace with hash -36326709, now seen corresponding path program 83 times [2022-04-28 10:05:10,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:10,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864554107] [2022-04-28 10:05:10,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:10,377 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash -36326709, now seen corresponding path program 84 times [2022-04-28 10:05:10,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:10,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306294355] [2022-04-28 10:05:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:10,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:10,617 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-28 10:05:10,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {22332#true} assume true; {22332#true} is VALID [2022-04-28 10:05:10,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22332#true} {22332#true} #50#return; {22332#true} is VALID [2022-04-28 10:05:10,617 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-28 10:05:10,618 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-28 10:05:10,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {22332#true} assume true; {22332#true} is VALID [2022-04-28 10:05:10,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22332#true} {22332#true} #50#return; {22332#true} is VALID [2022-04-28 10:05:10,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {22332#true} call #t~ret9 := main(); {22332#true} is VALID [2022-04-28 10:05:10,618 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-28 10:05:10,619 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-28 10:05:10,619 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-28 10:05:10,620 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-28 10:05:10,621 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-28 10:05:10,621 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-28 10:05:10,622 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-28 10:05:10,622 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-28 10:05:10,623 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-28 10:05:10,623 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-28 10:05:10,624 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-28 10:05:10,625 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-28 10:05:10,625 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-28 10:05:10,626 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-28 10:05:10,627 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-28 10:05:10,627 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-28 10:05:10,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {22333#false} assume !(~z~0 % 4294967296 > 0); {22333#false} is VALID [2022-04-28 10:05:10,627 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-28 10:05:10,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {22333#false} ~cond := #in~cond; {22333#false} is VALID [2022-04-28 10:05:10,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {22333#false} assume 0 == ~cond; {22333#false} is VALID [2022-04-28 10:05:10,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {22333#false} assume !false; {22333#false} is VALID [2022-04-28 10:05:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:10,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:10,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306294355] [2022-04-28 10:05:10,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306294355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:10,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412781653] [2022-04-28 10:05:10,628 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:10,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:10,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:10,632 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-28 10:05:10,665 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-28 10:05:10,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:05:10,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:10,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:05:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:10,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:10,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {22332#true} call ULTIMATE.init(); {22332#true} is VALID [2022-04-28 10:05:10,987 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-28 10:05:10,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {22332#true} assume true; {22332#true} is VALID [2022-04-28 10:05:10,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22332#true} {22332#true} #50#return; {22332#true} is VALID [2022-04-28 10:05:10,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {22332#true} call #t~ret9 := main(); {22332#true} is VALID [2022-04-28 10:05:10,987 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-28 10:05:10,988 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-28 10:05:10,988 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-28 10:05:10,989 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-28 10:05:10,989 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-28 10:05:10,990 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-28 10:05:10,990 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-28 10:05:10,991 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-28 10:05:10,991 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-28 10:05:10,991 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-28 10:05:10,992 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-28 10:05:10,992 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-28 10:05:10,993 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-28 10:05:10,993 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-28 10:05:10,994 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-28 10:05:10,994 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-28 10:05:10,995 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-28 10:05:10,995 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-28 10:05:10,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {22333#false} ~cond := #in~cond; {22333#false} is VALID [2022-04-28 10:05:10,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {22333#false} assume 0 == ~cond; {22333#false} is VALID [2022-04-28 10:05:10,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {22333#false} assume !false; {22333#false} is VALID [2022-04-28 10:05:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:10,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:11,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {22333#false} assume !false; {22333#false} is VALID [2022-04-28 10:05:11,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {22333#false} assume 0 == ~cond; {22333#false} is VALID [2022-04-28 10:05:11,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {22333#false} ~cond := #in~cond; {22333#false} is VALID [2022-04-28 10:05:11,368 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-28 10:05:11,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {22443#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22333#false} is VALID [2022-04-28 10:05:11,370 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-28 10:05:11,371 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-28 10:05:11,372 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-28 10:05:11,372 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-28 10:05:11,373 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-28 10:05:11,374 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-28 10:05:11,374 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-28 10:05:11,375 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-28 10:05:11,375 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-28 10:05:11,376 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-28 10:05:11,376 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-28 10:05:11,377 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-28 10:05:11,377 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-28 10:05:11,378 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-28 10:05:11,379 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-28 10:05:11,379 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-28 10:05:11,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {22332#true} call #t~ret9 := main(); {22332#true} is VALID [2022-04-28 10:05:11,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22332#true} {22332#true} #50#return; {22332#true} is VALID [2022-04-28 10:05:11,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {22332#true} assume true; {22332#true} is VALID [2022-04-28 10:05:11,379 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-28 10:05:11,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {22332#true} call ULTIMATE.init(); {22332#true} is VALID [2022-04-28 10:05:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:11,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412781653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:11,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:11,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2022-04-28 10:05:11,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:11,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864554107] [2022-04-28 10:05:11,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864554107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:11,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:11,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:05:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250803677] [2022-04-28 10:05:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:11,380 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-28 10:05:11,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:11,381 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-28 10:05:11,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:11,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:05:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:05:11,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:05:11,398 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-28 10:05:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:12,419 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 10:05:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:05:12,419 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-28 10:05:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:12,419 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-28 10:05:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-28 10:05:12,419 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-28 10:05:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-28 10:05:12,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 37 transitions. [2022-04-28 10:05:12,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:12,448 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:05:12,448 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:05:12,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:05:12,448 INFO L413 NwaCegarLoop]: 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-28 10:05:12,448 INFO L414 NwaCegarLoop]: 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-28 10:05:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:05:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 10:05:12,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:12,652 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-28 10:05:12,652 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-28 10:05:12,652 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-28 10:05:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:12,653 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-28 10:05:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:05:12,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:12,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:12,653 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-28 10:05:12,653 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-28 10:05:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:12,653 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-28 10:05:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:05:12,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:12,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:12,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:12,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:12,654 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-28 10:05:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-28 10:05:12,654 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-28 10:05:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:12,654 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-28 10:05:12,654 INFO L496 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-28 10:05:12,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-28 10:05:12,842 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-28 10:05:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 10:05:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:05:12,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:12,843 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:12,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-04-28 10:05:13,043 WARN L477 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-28 10:05:13,044 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash -448770388, now seen corresponding path program 85 times [2022-04-28 10:05:13,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:13,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [173607353] [2022-04-28 10:05:13,046 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:13,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash -448770388, now seen corresponding path program 86 times [2022-04-28 10:05:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:13,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132618542] [2022-04-28 10:05:13,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:13,302 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-28 10:05:13,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {22813#true} assume true; {22813#true} is VALID [2022-04-28 10:05:13,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22813#true} {22813#true} #50#return; {22813#true} is VALID [2022-04-28 10:05:13,303 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-28 10:05:13,303 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-28 10:05:13,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {22813#true} assume true; {22813#true} is VALID [2022-04-28 10:05:13,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22813#true} {22813#true} #50#return; {22813#true} is VALID [2022-04-28 10:05:13,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {22813#true} call #t~ret9 := main(); {22813#true} is VALID [2022-04-28 10:05:13,303 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-28 10:05:13,304 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-28 10:05:13,304 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-28 10:05:13,305 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-28 10:05:13,305 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-28 10:05:13,306 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-28 10:05:13,306 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-28 10:05:13,307 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-28 10:05:13,307 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-28 10:05:13,308 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-28 10:05:13,308 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-28 10:05:13,309 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-28 10:05:13,309 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-28 10:05:13,309 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-28 10:05:13,310 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-28 10:05:13,311 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-28 10:05:13,311 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-28 10:05:13,311 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-28 10:05:13,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {22814#false} ~cond := #in~cond; {22814#false} is VALID [2022-04-28 10:05:13,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {22814#false} assume 0 == ~cond; {22814#false} is VALID [2022-04-28 10:05:13,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {22814#false} assume !false; {22814#false} is VALID [2022-04-28 10:05:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:13,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:13,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132618542] [2022-04-28 10:05:13,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132618542] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:13,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745840797] [2022-04-28 10:05:13,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:13,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:13,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:13,313 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-28 10:05:13,313 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-28 10:05:13,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:13,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:13,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:05:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:13,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:13,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {22813#true} call ULTIMATE.init(); {22813#true} is VALID [2022-04-28 10:05:13,604 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-28 10:05:13,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {22813#true} assume true; {22813#true} is VALID [2022-04-28 10:05:13,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22813#true} {22813#true} #50#return; {22813#true} is VALID [2022-04-28 10:05:13,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {22813#true} call #t~ret9 := main(); {22813#true} is VALID [2022-04-28 10:05:13,604 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-28 10:05:13,605 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-28 10:05:13,605 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-28 10:05:13,606 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-28 10:05:13,606 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-28 10:05:13,607 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-28 10:05:13,607 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-28 10:05:13,608 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-28 10:05:13,608 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-28 10:05:13,608 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-28 10:05:13,609 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-28 10:05:13,609 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-28 10:05:13,610 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-28 10:05:13,610 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-28 10:05:13,611 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-28 10:05:13,611 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-28 10:05:13,612 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-28 10:05:13,612 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-28 10:05:13,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {22814#false} ~cond := #in~cond; {22814#false} is VALID [2022-04-28 10:05:13,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {22814#false} assume 0 == ~cond; {22814#false} is VALID [2022-04-28 10:05:13,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {22814#false} assume !false; {22814#false} is VALID [2022-04-28 10:05:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:13,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:13,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {22814#false} assume !false; {22814#false} is VALID [2022-04-28 10:05:13,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {22814#false} assume 0 == ~cond; {22814#false} is VALID [2022-04-28 10:05:13,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {22814#false} ~cond := #in~cond; {22814#false} is VALID [2022-04-28 10:05:13,990 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-28 10:05:13,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {22925#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22814#false} is VALID [2022-04-28 10:05:13,991 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-28 10:05:13,991 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-28 10:05:13,992 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-28 10:05:13,993 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-28 10:05:13,994 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-28 10:05:13,994 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-28 10:05:13,995 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-28 10:05:13,995 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-28 10:05:13,996 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-28 10:05:13,996 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-28 10:05:13,997 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-28 10:05:13,997 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-28 10:05:13,998 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-28 10:05:13,999 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-28 10:05:13,999 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-28 10:05:14,000 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-28 10:05:14,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {22813#true} call #t~ret9 := main(); {22813#true} is VALID [2022-04-28 10:05:14,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22813#true} {22813#true} #50#return; {22813#true} is VALID [2022-04-28 10:05:14,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {22813#true} assume true; {22813#true} is VALID [2022-04-28 10:05:14,000 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-28 10:05:14,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {22813#true} call ULTIMATE.init(); {22813#true} is VALID [2022-04-28 10:05:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:14,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745840797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:14,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:14,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:05:14,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:14,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [173607353] [2022-04-28 10:05:14,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [173607353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:14,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:14,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:05:14,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907759550] [2022-04-28 10:05:14,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:14,001 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-28 10:05:14,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:14,001 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-28 10:05:14,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:14,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:05:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:14,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:05:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:05:14,036 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-28 10:05:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:15,060 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-28 10:05:15,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:05:15,060 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-28 10:05:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:15,060 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-28 10:05:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-04-28 10:05:15,061 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-28 10:05:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-04-28 10:05:15,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 40 transitions. [2022-04-28 10:05:15,091 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-28 10:05:15,091 INFO L225 Difference]: With dead ends: 52 [2022-04-28 10:05:15,091 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:05:15,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=410, Invalid=1942, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:05:15,092 INFO L413 NwaCegarLoop]: 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-28 10:05:15,092 INFO L414 NwaCegarLoop]: 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-28 10:05:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:05:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-04-28 10:05:15,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:15,323 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-28 10:05:15,323 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-28 10:05:15,323 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-28 10:05:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:15,324 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-28 10:05:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-28 10:05:15,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:15,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:15,324 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-28 10:05:15,324 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-28 10:05:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:15,325 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-28 10:05:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-28 10:05:15,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:15,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:15,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:15,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:15,325 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-28 10:05:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-28 10:05:15,325 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-28 10:05:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:15,325 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-28 10:05:15,325 INFO L496 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-28 10:05:15,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-28 10:05:15,542 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-28 10:05:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 10:05:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:05:15,542 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:15,542 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:15,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-04-28 10:05:15,742 WARN L477 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-28 10:05:15,743 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:15,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1477587627, now seen corresponding path program 87 times [2022-04-28 10:05:15,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:15,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236780676] [2022-04-28 10:05:15,745 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:15,745 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1477587627, now seen corresponding path program 88 times [2022-04-28 10:05:15,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:15,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005559069] [2022-04-28 10:05:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:16,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:16,017 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-28 10:05:16,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {23313#true} assume true; {23313#true} is VALID [2022-04-28 10:05:16,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23313#true} {23313#true} #50#return; {23313#true} is VALID [2022-04-28 10:05:16,017 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-28 10:05:16,017 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-28 10:05:16,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {23313#true} assume true; {23313#true} is VALID [2022-04-28 10:05:16,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23313#true} {23313#true} #50#return; {23313#true} is VALID [2022-04-28 10:05:16,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {23313#true} call #t~ret9 := main(); {23313#true} is VALID [2022-04-28 10:05:16,018 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-28 10:05:16,018 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-28 10:05:16,019 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-28 10:05:16,020 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-28 10:05:16,021 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-28 10:05:16,021 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-28 10:05:16,022 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-28 10:05:16,022 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-28 10:05:16,023 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-28 10:05:16,024 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-28 10:05:16,024 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-28 10:05:16,025 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-28 10:05:16,025 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-28 10:05:16,026 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-28 10:05:16,027 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-28 10:05:16,027 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-28 10:05:16,028 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-28 10:05:16,028 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-28 10:05:16,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {23314#false} ~cond := #in~cond; {23314#false} is VALID [2022-04-28 10:05:16,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {23314#false} assume 0 == ~cond; {23314#false} is VALID [2022-04-28 10:05:16,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {23314#false} assume !false; {23314#false} is VALID [2022-04-28 10:05:16,028 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-28 10:05:16,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:16,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005559069] [2022-04-28 10:05:16,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005559069] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:16,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073639262] [2022-04-28 10:05:16,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:16,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:16,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:16,036 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-28 10:05:16,037 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-28 10:05:16,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:16,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:16,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:05:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:16,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:16,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {23313#true} call ULTIMATE.init(); {23313#true} is VALID [2022-04-28 10:05:16,353 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-28 10:05:16,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {23313#true} assume true; {23313#true} is VALID [2022-04-28 10:05:16,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23313#true} {23313#true} #50#return; {23313#true} is VALID [2022-04-28 10:05:16,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {23313#true} call #t~ret9 := main(); {23313#true} is VALID [2022-04-28 10:05:16,353 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-28 10:05:16,354 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-28 10:05:16,354 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-28 10:05:16,355 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-28 10:05:16,355 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-28 10:05:16,356 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-28 10:05:16,356 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-28 10:05:16,357 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-28 10:05:16,357 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-28 10:05:16,358 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-28 10:05:16,358 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-28 10:05:16,358 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-28 10:05:16,359 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-28 10:05:16,359 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-28 10:05:16,360 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-28 10:05:16,360 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-28 10:05:16,361 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-28 10:05:16,361 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-28 10:05:16,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {23314#false} ~cond := #in~cond; {23314#false} is VALID [2022-04-28 10:05:16,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {23314#false} assume 0 == ~cond; {23314#false} is VALID [2022-04-28 10:05:16,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {23314#false} assume !false; {23314#false} is VALID [2022-04-28 10:05:16,361 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-28 10:05:16,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:16,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {23314#false} assume !false; {23314#false} is VALID [2022-04-28 10:05:16,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {23314#false} assume 0 == ~cond; {23314#false} is VALID [2022-04-28 10:05:16,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {23314#false} ~cond := #in~cond; {23314#false} is VALID [2022-04-28 10:05:16,742 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-28 10:05:16,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {23425#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23314#false} is VALID [2022-04-28 10:05:16,744 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-28 10:05:16,744 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-28 10:05:16,745 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-28 10:05:16,745 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-28 10:05:16,746 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-28 10:05:16,746 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-28 10:05:16,747 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-28 10:05:16,747 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-28 10:05:16,748 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-28 10:05:16,749 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-28 10:05:16,749 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-28 10:05:16,750 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-28 10:05:16,750 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-28 10:05:16,751 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-28 10:05:16,752 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-28 10:05:16,752 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-28 10:05:16,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {23313#true} call #t~ret9 := main(); {23313#true} is VALID [2022-04-28 10:05:16,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23313#true} {23313#true} #50#return; {23313#true} is VALID [2022-04-28 10:05:16,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {23313#true} assume true; {23313#true} is VALID [2022-04-28 10:05:16,752 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-28 10:05:16,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {23313#true} call ULTIMATE.init(); {23313#true} is VALID [2022-04-28 10:05:16,752 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-28 10:05:16,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073639262] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:16,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:16,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:05:16,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:16,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236780676] [2022-04-28 10:05:16,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236780676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:16,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:16,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:05:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144977351] [2022-04-28 10:05:16,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:16,753 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-28 10:05:16,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:16,753 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-28 10:05:16,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:16,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:05:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:16,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:05:16,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:05:16,771 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-28 10:05:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:18,200 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-28 10:05:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:05:18,200 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-28 10:05:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:18,201 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-28 10:05:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2022-04-28 10:05:18,201 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-28 10:05:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2022-04-28 10:05:18,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 50 transitions. [2022-04-28 10:05:18,246 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-28 10:05:18,246 INFO L225 Difference]: With dead ends: 59 [2022-04-28 10:05:18,246 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 10:05:18,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=532, Invalid=2330, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:05:18,247 INFO L413 NwaCegarLoop]: 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-28 10:05:18,247 INFO L414 NwaCegarLoop]: 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-28 10:05:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 10:05:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-04-28 10:05:18,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:18,481 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-28 10:05:18,481 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-28 10:05:18,481 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-28 10:05:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:18,482 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 10:05:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 10:05:18,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:18,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:18,482 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-28 10:05:18,482 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-28 10:05:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:18,482 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 10:05:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 10:05:18,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:18,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:18,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:18,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:18,483 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-28 10:05:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-28 10:05:18,483 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-28 10:05:18,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:18,484 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-28 10:05:18,484 INFO L496 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-28 10:05:18,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-28 10:05:18,734 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-28 10:05:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 10:05:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:05:18,734 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:18,734 INFO L195 NwaCegarLoop]: trace histogram [9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:18,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-28 10:05:18,935 WARN L477 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-28 10:05:18,935 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1401180876, now seen corresponding path program 89 times [2022-04-28 10:05:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:18,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [506517051] [2022-04-28 10:05:18,937 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:18,937 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:18,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1401180876, now seen corresponding path program 90 times [2022-04-28 10:05:18,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:18,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83976150] [2022-04-28 10:05:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:19,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:19,179 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-28 10:05:19,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {23851#true} assume true; {23851#true} is VALID [2022-04-28 10:05:19,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23851#true} {23851#true} #50#return; {23851#true} is VALID [2022-04-28 10:05:19,179 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-28 10:05:19,179 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-28 10:05:19,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {23851#true} assume true; {23851#true} is VALID [2022-04-28 10:05:19,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23851#true} {23851#true} #50#return; {23851#true} is VALID [2022-04-28 10:05:19,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {23851#true} call #t~ret9 := main(); {23851#true} is VALID [2022-04-28 10:05:19,180 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-28 10:05:19,180 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-28 10:05:19,181 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-28 10:05:19,181 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-28 10:05:19,182 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-28 10:05:19,182 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-28 10:05:19,183 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-28 10:05:19,183 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-28 10:05:19,184 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-28 10:05:19,184 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-28 10:05:19,184 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-28 10:05:19,185 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-28 10:05:19,185 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-28 10:05:19,186 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-28 10:05:19,186 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-28 10:05:19,187 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-28 10:05:19,187 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-28 10:05:19,187 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-28 10:05:19,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {23852#false} ~cond := #in~cond; {23852#false} is VALID [2022-04-28 10:05:19,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {23852#false} assume 0 == ~cond; {23852#false} is VALID [2022-04-28 10:05:19,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {23852#false} assume !false; {23852#false} is VALID [2022-04-28 10:05:19,188 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-28 10:05:19,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:19,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83976150] [2022-04-28 10:05:19,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83976150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:19,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621778742] [2022-04-28 10:05:19,188 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:19,190 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-28 10:05:19,191 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-28 10:05:19,270 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:05:19,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:19,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:05:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:19,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:19,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {23851#true} call ULTIMATE.init(); {23851#true} is VALID [2022-04-28 10:05:19,512 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-28 10:05:19,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {23851#true} assume true; {23851#true} is VALID [2022-04-28 10:05:19,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23851#true} {23851#true} #50#return; {23851#true} is VALID [2022-04-28 10:05:19,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {23851#true} call #t~ret9 := main(); {23851#true} is VALID [2022-04-28 10:05:19,513 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-28 10:05:19,513 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-28 10:05:19,514 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-28 10:05:19,514 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-28 10:05:19,515 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-28 10:05:19,515 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-28 10:05:19,516 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-28 10:05:19,516 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-28 10:05:19,517 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-28 10:05:19,517 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-28 10:05:19,517 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-28 10:05:19,518 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-28 10:05:19,518 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-28 10:05:19,519 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-28 10:05:19,519 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-28 10:05:19,520 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-28 10:05:19,520 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-28 10:05:19,520 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-28 10:05:19,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {23852#false} ~cond := #in~cond; {23852#false} is VALID [2022-04-28 10:05:19,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {23852#false} assume 0 == ~cond; {23852#false} is VALID [2022-04-28 10:05:19,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {23852#false} assume !false; {23852#false} is VALID [2022-04-28 10:05:19,520 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-28 10:05:19,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:19,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {23852#false} assume !false; {23852#false} is VALID [2022-04-28 10:05:19,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {23852#false} assume 0 == ~cond; {23852#false} is VALID [2022-04-28 10:05:19,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {23852#false} ~cond := #in~cond; {23852#false} is VALID [2022-04-28 10:05:19,904 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-28 10:05:19,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {23963#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23852#false} is VALID [2022-04-28 10:05:19,905 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-28 10:05:19,906 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-28 10:05:19,907 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-28 10:05:19,907 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-28 10:05:19,908 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-28 10:05:19,908 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-28 10:05:19,909 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-28 10:05:19,909 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-28 10:05:19,910 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-28 10:05:19,910 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-28 10:05:19,911 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-28 10:05:19,912 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-28 10:05:19,912 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-28 10:05:19,913 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-28 10:05:19,914 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-28 10:05:19,914 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-28 10:05:19,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {23851#true} call #t~ret9 := main(); {23851#true} is VALID [2022-04-28 10:05:19,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23851#true} {23851#true} #50#return; {23851#true} is VALID [2022-04-28 10:05:19,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {23851#true} assume true; {23851#true} is VALID [2022-04-28 10:05:19,914 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-28 10:05:19,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {23851#true} call ULTIMATE.init(); {23851#true} is VALID [2022-04-28 10:05:19,914 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-28 10:05:19,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621778742] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:19,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:19,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:05:19,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:19,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [506517051] [2022-04-28 10:05:19,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [506517051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:19,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:19,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:05:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881542337] [2022-04-28 10:05:19,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:19,915 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-28 10:05:19,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:19,915 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-28 10:05:19,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:19,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:05:19,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:19,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:05:19,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:05:19,933 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-28 10:05:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:21,774 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-28 10:05:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:05:21,774 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-28 10:05:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:21,774 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-28 10:05:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2022-04-28 10:05:21,775 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-28 10:05:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2022-04-28 10:05:21,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 57 transitions. [2022-04-28 10:05:21,818 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-28 10:05:21,819 INFO L225 Difference]: With dead ends: 65 [2022-04-28 10:05:21,819 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 10:05:21,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=600, Invalid=2480, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:05:21,820 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:21,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 97 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:05:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 10:05:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2022-04-28 10:05:22,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:22,067 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-28 10:05:22,067 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-28 10:05:22,067 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-28 10:05:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:22,068 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-28 10:05:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-04-28 10:05:22,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:22,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:22,068 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-28 10:05:22,068 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-28 10:05:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:22,069 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-28 10:05:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-04-28 10:05:22,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:22,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:22,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:22,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:22,069 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-28 10:05:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-28 10:05:22,070 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-28 10:05:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:22,070 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-28 10:05:22,070 INFO L496 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-28 10:05:22,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-28 10:05:22,338 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-28 10:05:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 10:05:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:05:22,338 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:22,338 INFO L195 NwaCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:22,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-04-28 10:05:22,539 WARN L477 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-28 10:05:22,539 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:22,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1926419829, now seen corresponding path program 91 times [2022-04-28 10:05:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:22,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772387535] [2022-04-28 10:05:22,542 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:22,542 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1926419829, now seen corresponding path program 92 times [2022-04-28 10:05:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:22,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863440017] [2022-04-28 10:05:22,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:22,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:22,815 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-28 10:05:22,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {24417#true} assume true; {24417#true} is VALID [2022-04-28 10:05:22,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24417#true} {24417#true} #50#return; {24417#true} is VALID [2022-04-28 10:05:22,816 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-28 10:05:22,816 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-28 10:05:22,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {24417#true} assume true; {24417#true} is VALID [2022-04-28 10:05:22,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24417#true} {24417#true} #50#return; {24417#true} is VALID [2022-04-28 10:05:22,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {24417#true} call #t~ret9 := main(); {24417#true} is VALID [2022-04-28 10:05:22,817 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-28 10:05:22,817 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-28 10:05:22,818 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-28 10:05:22,819 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-28 10:05:22,819 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-28 10:05:22,820 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-28 10:05:22,821 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-28 10:05:22,821 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-28 10:05:22,822 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-28 10:05:22,822 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-28 10:05:22,823 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-28 10:05:22,824 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-28 10:05:22,824 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-28 10:05:22,825 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-28 10:05:22,825 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-28 10:05:22,826 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-28 10:05:22,826 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-28 10:05:22,827 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-28 10:05:22,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {24418#false} ~cond := #in~cond; {24418#false} is VALID [2022-04-28 10:05:22,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {24418#false} assume 0 == ~cond; {24418#false} is VALID [2022-04-28 10:05:22,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {24418#false} assume !false; {24418#false} is VALID [2022-04-28 10:05:22,827 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-28 10:05:22,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:22,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863440017] [2022-04-28 10:05:22,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863440017] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:22,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686566179] [2022-04-28 10:05:22,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:22,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:22,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:22,829 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-28 10:05:22,830 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-28 10:05:22,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:22,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:22,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:05:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:22,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:23,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {24417#true} call ULTIMATE.init(); {24417#true} is VALID [2022-04-28 10:05:23,177 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-28 10:05:23,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {24417#true} assume true; {24417#true} is VALID [2022-04-28 10:05:23,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24417#true} {24417#true} #50#return; {24417#true} is VALID [2022-04-28 10:05:23,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {24417#true} call #t~ret9 := main(); {24417#true} is VALID [2022-04-28 10:05:23,177 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-28 10:05:23,178 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-28 10:05:23,178 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-28 10:05:23,179 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-28 10:05:23,179 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-28 10:05:23,180 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-28 10:05:23,180 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-28 10:05:23,181 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-28 10:05:23,181 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-28 10:05:23,182 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-28 10:05:23,182 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-28 10:05:23,183 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-28 10:05:23,183 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-28 10:05:23,183 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-28 10:05:23,184 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-28 10:05:23,184 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-28 10:05:23,185 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-28 10:05:23,185 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-28 10:05:23,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {24418#false} ~cond := #in~cond; {24418#false} is VALID [2022-04-28 10:05:23,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {24418#false} assume 0 == ~cond; {24418#false} is VALID [2022-04-28 10:05:23,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {24418#false} assume !false; {24418#false} is VALID [2022-04-28 10:05:23,185 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-28 10:05:23,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:23,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {24418#false} assume !false; {24418#false} is VALID [2022-04-28 10:05:23,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {24418#false} assume 0 == ~cond; {24418#false} is VALID [2022-04-28 10:05:23,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {24418#false} ~cond := #in~cond; {24418#false} is VALID [2022-04-28 10:05:23,587 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-28 10:05:23,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {24529#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24418#false} is VALID [2022-04-28 10:05:23,589 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-28 10:05:23,590 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-28 10:05:23,590 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-28 10:05:23,590 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-28 10:05:23,591 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-28 10:05:23,591 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-28 10:05:23,592 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-28 10:05:23,593 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-28 10:05:23,593 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-28 10:05:23,594 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-28 10:05:23,595 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-28 10:05:23,595 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-28 10:05:23,596 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-28 10:05:23,596 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-28 10:05:23,597 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-28 10:05:23,597 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-28 10:05:23,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {24417#true} call #t~ret9 := main(); {24417#true} is VALID [2022-04-28 10:05:23,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24417#true} {24417#true} #50#return; {24417#true} is VALID [2022-04-28 10:05:23,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {24417#true} assume true; {24417#true} is VALID [2022-04-28 10:05:23,598 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-28 10:05:23,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {24417#true} call ULTIMATE.init(); {24417#true} is VALID [2022-04-28 10:05:23,598 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-28 10:05:23,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686566179] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:23,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:23,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:05:23,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:23,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772387535] [2022-04-28 10:05:23,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772387535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:23,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:23,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:05:23,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372585647] [2022-04-28 10:05:23,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:23,599 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-28 10:05:23,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:23,599 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-28 10:05:23,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:23,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:05:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:23,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:05:23,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:05:23,617 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-28 10:05:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:25,575 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-04-28 10:05:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:05:25,576 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-28 10:05:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:25,576 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-28 10:05:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2022-04-28 10:05:25,577 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-28 10:05:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2022-04-28 10:05:25,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 61 transitions. [2022-04-28 10:05:25,626 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-28 10:05:25,627 INFO L225 Difference]: With dead ends: 70 [2022-04-28 10:05:25,627 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 10:05:25,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:05:25,627 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:25,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 100 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:05:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 10:05:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2022-04-28 10:05:25,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:25,875 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-28 10:05:25,875 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-28 10:05:25,876 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-28 10:05:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:25,876 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 10:05:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 10:05:25,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:25,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:25,876 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-28 10:05:25,877 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-28 10:05:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:25,877 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 10:05:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 10:05:25,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:25,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:25,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:25,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:25,877 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-28 10:05:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-28 10:05:25,878 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-28 10:05:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:25,878 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-28 10:05:25,878 INFO L496 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-28 10:05:25,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-28 10:05:26,165 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-28 10:05:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 10:05:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:05:26,165 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:26,165 INFO L195 NwaCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:26,181 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-28 10:05:26,366 WARN L477 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-28 10:05:26,366 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:26,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1429921516, now seen corresponding path program 93 times [2022-04-28 10:05:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:26,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [834602615] [2022-04-28 10:05:26,369 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:26,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:26,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1429921516, now seen corresponding path program 94 times [2022-04-28 10:05:26,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:26,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521369670] [2022-04-28 10:05:26,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:26,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:26,607 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-28 10:05:26,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-28 10:05:26,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25001#true} {25001#true} #50#return; {25001#true} is VALID [2022-04-28 10:05:26,608 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-28 10:05:26,608 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-28 10:05:26,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-28 10:05:26,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25001#true} {25001#true} #50#return; {25001#true} is VALID [2022-04-28 10:05:26,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {25001#true} call #t~ret9 := main(); {25001#true} is VALID [2022-04-28 10:05:26,608 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-28 10:05:26,609 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-28 10:05:26,609 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-28 10:05:26,610 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-28 10:05:26,610 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-28 10:05:26,611 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-28 10:05:26,611 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-28 10:05:26,612 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-28 10:05:26,612 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-28 10:05:26,613 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-28 10:05:26,613 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-28 10:05:26,614 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-28 10:05:26,614 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-28 10:05:26,614 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-28 10:05:26,615 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-28 10:05:26,615 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-28 10:05:26,616 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-28 10:05:26,616 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-28 10:05:26,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {25002#false} ~cond := #in~cond; {25002#false} is VALID [2022-04-28 10:05:26,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {25002#false} assume 0 == ~cond; {25002#false} is VALID [2022-04-28 10:05:26,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {25002#false} assume !false; {25002#false} is VALID [2022-04-28 10:05:26,616 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-28 10:05:26,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:26,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521369670] [2022-04-28 10:05:26,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521369670] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:26,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104947931] [2022-04-28 10:05:26,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:26,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:26,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:26,617 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-28 10:05:26,618 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-28 10:05:26,650 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:26,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:26,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:05:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:26,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:26,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {25001#true} call ULTIMATE.init(); {25001#true} is VALID [2022-04-28 10:05:26,904 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-28 10:05:26,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-28 10:05:26,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25001#true} {25001#true} #50#return; {25001#true} is VALID [2022-04-28 10:05:26,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {25001#true} call #t~ret9 := main(); {25001#true} is VALID [2022-04-28 10:05:26,904 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-28 10:05:26,904 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-28 10:05:26,905 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-28 10:05:26,905 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-28 10:05:26,906 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-28 10:05:26,906 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-28 10:05:26,907 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-28 10:05:26,907 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-28 10:05:26,908 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-28 10:05:26,908 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-28 10:05:26,909 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-28 10:05:26,909 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-28 10:05:26,910 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-28 10:05:26,910 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-28 10:05:26,911 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-28 10:05:26,911 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-28 10:05:26,912 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-28 10:05:26,912 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-28 10:05:26,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {25002#false} ~cond := #in~cond; {25002#false} is VALID [2022-04-28 10:05:26,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {25002#false} assume 0 == ~cond; {25002#false} is VALID [2022-04-28 10:05:26,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {25002#false} assume !false; {25002#false} is VALID [2022-04-28 10:05:26,912 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-28 10:05:26,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:27,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {25002#false} assume !false; {25002#false} is VALID [2022-04-28 10:05:27,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {25002#false} assume 0 == ~cond; {25002#false} is VALID [2022-04-28 10:05:27,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {25002#false} ~cond := #in~cond; {25002#false} is VALID [2022-04-28 10:05:27,308 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-28 10:05:27,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {25113#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25002#false} is VALID [2022-04-28 10:05:27,309 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-28 10:05:27,309 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-28 10:05:27,310 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-28 10:05:27,310 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-28 10:05:27,311 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-28 10:05:27,311 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-28 10:05:27,312 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-28 10:05:27,313 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-28 10:05:27,313 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-28 10:05:27,314 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-28 10:05:27,314 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-28 10:05:27,315 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-28 10:05:27,316 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-28 10:05:27,316 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-28 10:05:27,317 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-28 10:05:27,317 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-28 10:05:27,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {25001#true} call #t~ret9 := main(); {25001#true} is VALID [2022-04-28 10:05:27,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25001#true} {25001#true} #50#return; {25001#true} is VALID [2022-04-28 10:05:27,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-28 10:05:27,317 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-28 10:05:27,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {25001#true} call ULTIMATE.init(); {25001#true} is VALID [2022-04-28 10:05:27,318 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-28 10:05:27,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104947931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:27,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:27,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:05:27,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:27,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [834602615] [2022-04-28 10:05:27,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [834602615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:27,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:27,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:05:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111180696] [2022-04-28 10:05:27,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:27,318 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-28 10:05:27,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:27,319 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-28 10:05:27,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:27,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:05:27,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:27,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:05:27,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:05:27,350 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-28 10:05:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:29,336 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-04-28 10:05:29,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:05:29,336 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-28 10:05:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:29,336 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-28 10:05:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 63 transitions. [2022-04-28 10:05:29,337 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-28 10:05:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 63 transitions. [2022-04-28 10:05:29,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 63 transitions. [2022-04-28 10:05:29,386 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-28 10:05:29,386 INFO L225 Difference]: With dead ends: 74 [2022-04-28 10:05:29,386 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 10:05:29,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:05:29,387 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:29,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 100 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:05:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 10:05:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 40. [2022-04-28 10:05:29,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:29,634 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-28 10:05:29,634 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-28 10:05:29,634 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-28 10:05:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:29,635 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-04-28 10:05:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-04-28 10:05:29,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:29,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:29,635 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-28 10:05:29,635 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-28 10:05:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:29,635 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-04-28 10:05:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-04-28 10:05:29,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:29,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:29,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:29,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:29,636 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-28 10:05:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-28 10:05:29,636 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-28 10:05:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:29,636 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-28 10:05:29,636 INFO L496 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-28 10:05:29,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-28 10:05:29,901 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-28 10:05:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 10:05:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:05:29,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:29,902 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:29,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-04-28 10:05:30,102 WARN L477 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-28 10:05:30,103 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:30,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash 845453931, now seen corresponding path program 95 times [2022-04-28 10:05:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:30,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2088204462] [2022-04-28 10:05:30,105 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:30,105 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash 845453931, now seen corresponding path program 96 times [2022-04-28 10:05:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:30,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717788364] [2022-04-28 10:05:30,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:30,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:30,332 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-28 10:05:30,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {25595#true} assume true; {25595#true} is VALID [2022-04-28 10:05:30,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25595#true} {25595#true} #50#return; {25595#true} is VALID [2022-04-28 10:05:30,332 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-28 10:05:30,332 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-28 10:05:30,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {25595#true} assume true; {25595#true} is VALID [2022-04-28 10:05:30,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25595#true} {25595#true} #50#return; {25595#true} is VALID [2022-04-28 10:05:30,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {25595#true} call #t~ret9 := main(); {25595#true} is VALID [2022-04-28 10:05:30,333 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-28 10:05:30,333 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-28 10:05:30,334 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-28 10:05:30,334 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-28 10:05:30,335 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-28 10:05:30,335 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-28 10:05:30,336 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-28 10:05:30,336 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-28 10:05:30,337 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-28 10:05:30,337 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-28 10:05:30,338 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-28 10:05:30,338 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-28 10:05:30,339 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-28 10:05:30,339 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-28 10:05:30,339 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-28 10:05:30,340 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-28 10:05:30,340 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-28 10:05:30,340 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-28 10:05:30,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {25596#false} ~cond := #in~cond; {25596#false} is VALID [2022-04-28 10:05:30,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {25596#false} assume 0 == ~cond; {25596#false} is VALID [2022-04-28 10:05:30,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {25596#false} assume !false; {25596#false} is VALID [2022-04-28 10:05:30,341 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-28 10:05:30,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:30,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717788364] [2022-04-28 10:05:30,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717788364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:30,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53848992] [2022-04-28 10:05:30,341 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:30,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:30,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:30,342 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-28 10:05:30,342 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-28 10:05:30,404 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:05:30,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:30,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:05:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:30,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:30,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {25595#true} call ULTIMATE.init(); {25595#true} is VALID [2022-04-28 10:05:30,660 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-28 10:05:30,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {25595#true} assume true; {25595#true} is VALID [2022-04-28 10:05:30,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25595#true} {25595#true} #50#return; {25595#true} is VALID [2022-04-28 10:05:30,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {25595#true} call #t~ret9 := main(); {25595#true} is VALID [2022-04-28 10:05:30,660 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-28 10:05:30,660 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-28 10:05:30,661 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-28 10:05:30,661 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-28 10:05:30,662 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-28 10:05:30,662 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-28 10:05:30,663 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-28 10:05:30,663 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-28 10:05:30,664 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-28 10:05:30,664 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-28 10:05:30,665 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-28 10:05:30,665 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-28 10:05:30,666 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-28 10:05:30,666 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-28 10:05:30,667 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-28 10:05:30,667 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-28 10:05:30,668 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-28 10:05:30,668 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-28 10:05:30,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {25596#false} ~cond := #in~cond; {25596#false} is VALID [2022-04-28 10:05:30,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {25596#false} assume 0 == ~cond; {25596#false} is VALID [2022-04-28 10:05:30,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {25596#false} assume !false; {25596#false} is VALID [2022-04-28 10:05:30,668 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-28 10:05:30,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:31,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {25596#false} assume !false; {25596#false} is VALID [2022-04-28 10:05:31,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {25596#false} assume 0 == ~cond; {25596#false} is VALID [2022-04-28 10:05:31,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {25596#false} ~cond := #in~cond; {25596#false} is VALID [2022-04-28 10:05:31,079 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-28 10:05:31,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {25707#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25596#false} is VALID [2022-04-28 10:05:31,081 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-28 10:05:31,081 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-28 10:05:31,082 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-28 10:05:31,082 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-28 10:05:31,083 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-28 10:05:31,084 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-28 10:05:31,084 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-28 10:05:31,085 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-28 10:05:31,085 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-28 10:05:31,086 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-28 10:05:31,087 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-28 10:05:31,087 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-28 10:05:31,088 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-28 10:05:31,088 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-28 10:05:31,089 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-28 10:05:31,089 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-28 10:05:31,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {25595#true} call #t~ret9 := main(); {25595#true} is VALID [2022-04-28 10:05:31,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25595#true} {25595#true} #50#return; {25595#true} is VALID [2022-04-28 10:05:31,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {25595#true} assume true; {25595#true} is VALID [2022-04-28 10:05:31,090 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-28 10:05:31,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {25595#true} call ULTIMATE.init(); {25595#true} is VALID [2022-04-28 10:05:31,090 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-28 10:05:31,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53848992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:31,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:31,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:05:31,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:31,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2088204462] [2022-04-28 10:05:31,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2088204462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:31,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:31,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:05:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38332900] [2022-04-28 10:05:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:31,091 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-28 10:05:31,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:31,091 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-28 10:05:31,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:31,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:05:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:31,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:05:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:05:31,110 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-28 10:05:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:33,211 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-28 10:05:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:05:33,211 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-28 10:05:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:33,211 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-28 10:05:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-28 10:05:33,212 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-28 10:05:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-28 10:05:33,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2022-04-28 10:05:33,263 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-28 10:05:33,264 INFO L225 Difference]: With dead ends: 77 [2022-04-28 10:05:33,264 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 10:05:33,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=1926, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:05:33,265 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 49 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:33,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 105 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:05:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 10:05:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2022-04-28 10:05:33,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:33,506 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-28 10:05:33,506 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-28 10:05:33,506 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-28 10:05:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:33,507 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-28 10:05:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2022-04-28 10:05:33,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:33,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:33,507 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-28 10:05:33,507 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-28 10:05:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:33,508 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-28 10:05:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2022-04-28 10:05:33,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:33,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:33,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:33,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:33,508 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-28 10:05:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-28 10:05:33,509 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-28 10:05:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:33,509 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-28 10:05:33,509 INFO L496 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-28 10:05:33,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-28 10:05:33,762 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-28 10:05:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 10:05:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:05:33,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:33,762 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:33,779 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-28 10:05:33,967 WARN L477 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-28 10:05:33,967 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:33,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:33,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1251609844, now seen corresponding path program 25 times [2022-04-28 10:05:33,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:33,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837687769] [2022-04-28 10:05:33,970 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:33,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1251609844, now seen corresponding path program 26 times [2022-04-28 10:05:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:33,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519090952] [2022-04-28 10:05:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:34,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:34,233 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-28 10:05:34,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {26197#true} assume true; {26197#true} is VALID [2022-04-28 10:05:34,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26197#true} {26197#true} #50#return; {26197#true} is VALID [2022-04-28 10:05:34,234 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-28 10:05:34,234 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-28 10:05:34,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {26197#true} assume true; {26197#true} is VALID [2022-04-28 10:05:34,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26197#true} {26197#true} #50#return; {26197#true} is VALID [2022-04-28 10:05:34,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {26197#true} call #t~ret9 := main(); {26197#true} is VALID [2022-04-28 10:05:34,234 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-28 10:05:34,235 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-28 10:05:34,236 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-28 10:05:34,236 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-28 10:05:34,237 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-28 10:05:34,237 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-28 10:05:34,238 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-28 10:05:34,239 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-28 10:05:34,239 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-28 10:05:34,240 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-28 10:05:34,241 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-28 10:05:34,241 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-28 10:05:34,242 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-28 10:05:34,243 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-28 10:05:34,243 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-28 10:05:34,244 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-28 10:05:34,244 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-28 10:05:34,244 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-28 10:05:34,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {26198#false} ~cond := #in~cond; {26198#false} is VALID [2022-04-28 10:05:34,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {26198#false} assume 0 == ~cond; {26198#false} is VALID [2022-04-28 10:05:34,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {26198#false} assume !false; {26198#false} is VALID [2022-04-28 10:05:34,245 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-28 10:05:34,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:34,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519090952] [2022-04-28 10:05:34,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519090952] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:34,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477551581] [2022-04-28 10:05:34,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:34,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:34,248 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-28 10:05:34,285 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-28 10:05:34,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:34,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:34,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:05:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:34,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:34,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {26197#true} call ULTIMATE.init(); {26197#true} is VALID [2022-04-28 10:05:34,635 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-28 10:05:34,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {26197#true} assume true; {26197#true} is VALID [2022-04-28 10:05:34,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26197#true} {26197#true} #50#return; {26197#true} is VALID [2022-04-28 10:05:34,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {26197#true} call #t~ret9 := main(); {26197#true} is VALID [2022-04-28 10:05:34,635 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-28 10:05:34,636 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-28 10:05:34,637 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-28 10:05:34,637 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-28 10:05:34,638 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-28 10:05:34,639 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-28 10:05:34,639 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-28 10:05:34,640 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-28 10:05:34,640 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-28 10:05:34,641 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-28 10:05:34,642 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-28 10:05:34,642 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-28 10:05:34,643 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-28 10:05:34,644 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-28 10:05:34,644 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-28 10:05:34,644 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-28 10:05:34,645 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-28 10:05:34,645 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-28 10:05:34,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {26198#false} ~cond := #in~cond; {26198#false} is VALID [2022-04-28 10:05:34,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {26198#false} assume 0 == ~cond; {26198#false} is VALID [2022-04-28 10:05:34,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {26198#false} assume !false; {26198#false} is VALID [2022-04-28 10:05:34,645 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-28 10:05:34,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:35,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {26198#false} assume !false; {26198#false} is VALID [2022-04-28 10:05:35,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {26198#false} assume 0 == ~cond; {26198#false} is VALID [2022-04-28 10:05:35,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {26198#false} ~cond := #in~cond; {26198#false} is VALID [2022-04-28 10:05:35,078 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-28 10:05:35,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {26309#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {26198#false} is VALID [2022-04-28 10:05:35,079 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-28 10:05:35,079 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-28 10:05:35,080 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-28 10:05:35,081 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-28 10:05:35,081 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-28 10:05:35,082 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-28 10:05:35,083 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-28 10:05:35,083 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-28 10:05:35,084 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-28 10:05:35,084 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-28 10:05:35,085 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-28 10:05:35,086 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-28 10:05:35,086 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-28 10:05:35,087 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-28 10:05:35,087 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-28 10:05:35,088 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-28 10:05:35,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {26197#true} call #t~ret9 := main(); {26197#true} is VALID [2022-04-28 10:05:35,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26197#true} {26197#true} #50#return; {26197#true} is VALID [2022-04-28 10:05:35,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {26197#true} assume true; {26197#true} is VALID [2022-04-28 10:05:35,088 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-28 10:05:35,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {26197#true} call ULTIMATE.init(); {26197#true} is VALID [2022-04-28 10:05:35,088 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-28 10:05:35,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477551581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:35,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:35,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:05:35,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:35,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837687769] [2022-04-28 10:05:35,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837687769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:35,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:35,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:05:35,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809183895] [2022-04-28 10:05:35,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:35,089 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-28 10:05:35,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:35,089 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-28 10:05:35,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:35,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:05:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:35,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:05:35,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:05:35,106 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-28 10:05:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:37,430 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-04-28 10:05:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:05:37,430 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-28 10:05:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:37,430 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-28 10:05:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 70 transitions. [2022-04-28 10:05:37,431 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-28 10:05:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 70 transitions. [2022-04-28 10:05:37,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 70 transitions. [2022-04-28 10:05:37,486 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-28 10:05:37,486 INFO L225 Difference]: With dead ends: 82 [2022-04-28 10:05:37,486 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 10:05:37,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:05:37,487 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:37,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 113 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:05:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 10:05:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 42. [2022-04-28 10:05:37,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:37,732 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-28 10:05:37,732 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-28 10:05:37,732 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-28 10:05:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:37,733 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2022-04-28 10:05:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2022-04-28 10:05:37,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:37,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:37,733 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-28 10:05:37,733 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-28 10:05:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:37,734 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2022-04-28 10:05:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2022-04-28 10:05:37,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:37,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:37,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:37,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:37,734 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-28 10:05:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-28 10:05:37,735 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 26 [2022-04-28 10:05:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:37,735 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-28 10:05:37,735 INFO L496 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-28 10:05:37,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-28 10:05:37,997 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-28 10:05:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-28 10:05:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:05:37,997 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:37,997 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:38,013 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-28 10:05:38,199 WARN L477 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-28 10:05:38,199 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -992485066, now seen corresponding path program 97 times [2022-04-28 10:05:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:38,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1694320432] [2022-04-28 10:05:38,202 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:38,202 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:38,202 INFO L85 PathProgramCache]: Analyzing trace with hash -992485066, now seen corresponding path program 98 times [2022-04-28 10:05:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:38,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6715985] [2022-04-28 10:05:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:38,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:38,825 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-28 10:05:38,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {26821#true} assume true; {26821#true} is VALID [2022-04-28 10:05:38,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26821#true} {26821#true} #50#return; {26821#true} is VALID [2022-04-28 10:05:38,826 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-28 10:05:38,826 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-28 10:05:38,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {26821#true} assume true; {26821#true} is VALID [2022-04-28 10:05:38,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26821#true} {26821#true} #50#return; {26821#true} is VALID [2022-04-28 10:05:38,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {26821#true} call #t~ret9 := main(); {26821#true} is VALID [2022-04-28 10:05:38,826 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-28 10:05:38,827 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-28 10:05:38,829 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-28 10:05:38,830 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-28 10:05:38,830 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-28 10:05:38,831 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-28 10:05:38,832 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-28 10:05:38,834 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-28 10:05:38,834 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-28 10:05:38,835 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-28 10:05:38,836 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-28 10:05:38,837 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-28 10:05:38,839 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-28 10:05:38,840 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-28 10:05:38,841 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-28 10:05:38,842 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-28 10:05:38,843 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-28 10:05:38,844 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-28 10:05:38,845 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-28 10:05:38,845 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-28 10:05:38,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {26843#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26822#false} is VALID [2022-04-28 10:05:38,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {26822#false} assume !false; {26822#false} is VALID [2022-04-28 10:05:38,846 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-28 10:05:38,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:38,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6715985] [2022-04-28 10:05:38,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6715985] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:38,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775616147] [2022-04-28 10:05:38,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:38,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:38,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:38,847 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-28 10:05:38,848 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-28 10:05:38,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:38,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:38,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:05:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:38,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:39,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {26821#true} call ULTIMATE.init(); {26821#true} is VALID [2022-04-28 10:05:39,203 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-28 10:05:39,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {26821#true} assume true; {26821#true} is VALID [2022-04-28 10:05:39,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26821#true} {26821#true} #50#return; {26821#true} is VALID [2022-04-28 10:05:39,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {26821#true} call #t~ret9 := main(); {26821#true} is VALID [2022-04-28 10:05:39,204 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-28 10:05:39,204 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-28 10:05:39,205 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-28 10:05:39,205 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-28 10:05:39,206 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-28 10:05:39,206 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-28 10:05:39,207 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-28 10:05:39,207 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-28 10:05:39,208 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-28 10:05:39,208 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-28 10:05:39,208 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-28 10:05:39,209 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-28 10:05:39,209 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-28 10:05:39,210 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-28 10:05:39,210 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-28 10:05:39,211 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-28 10:05:39,211 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-28 10:05:39,212 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-28 10:05:39,212 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-28 10:05:39,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {26924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:05:39,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {26928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26822#false} is VALID [2022-04-28 10:05:39,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {26822#false} assume !false; {26822#false} is VALID [2022-04-28 10:05:39,213 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-28 10:05:39,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:39,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {26822#false} assume !false; {26822#false} is VALID [2022-04-28 10:05:39,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {26928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26822#false} is VALID [2022-04-28 10:05:39,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {26924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:05:39,750 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-28 10:05:39,751 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-28 10:05:39,752 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-28 10:05:39,752 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-28 10:05:39,753 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-28 10:05:39,754 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-28 10:05:39,754 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-28 10:05:39,755 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-28 10:05:39,756 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-28 10:05:39,756 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-28 10:05:39,756 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-28 10:05:39,757 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-28 10:05:39,758 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-28 10:05:39,758 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-28 10:05:39,759 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-28 10:05:39,760 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-28 10:05:39,761 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-28 10:05:39,762 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-28 10:05:39,762 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-28 10:05:39,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {26821#true} call #t~ret9 := main(); {26821#true} is VALID [2022-04-28 10:05:39,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26821#true} {26821#true} #50#return; {26821#true} is VALID [2022-04-28 10:05:39,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {26821#true} assume true; {26821#true} is VALID [2022-04-28 10:05:39,763 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-28 10:05:39,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {26821#true} call ULTIMATE.init(); {26821#true} is VALID [2022-04-28 10:05:39,763 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-28 10:05:39,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775616147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:39,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:39,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 38 [2022-04-28 10:05:39,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:39,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1694320432] [2022-04-28 10:05:39,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1694320432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:39,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:39,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:05:39,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822016669] [2022-04-28 10:05:39,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:39,764 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-28 10:05:39,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:39,764 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-28 10:05:39,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:39,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:05:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:05:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:05:39,794 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-28 10:05:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:41,789 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 10:05:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:05:41,790 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-28 10:05:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:41,790 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-28 10:05:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. [2022-04-28 10:05:41,790 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-28 10:05:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. [2022-04-28 10:05:41,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 38 transitions. [2022-04-28 10:05:41,831 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-28 10:05:41,832 INFO L225 Difference]: With dead ends: 54 [2022-04-28 10:05:41,832 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 10:05:41,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=234, Invalid=2736, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:05:41,833 INFO L413 NwaCegarLoop]: 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-28 10:05:41,833 INFO L414 NwaCegarLoop]: 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-28 10:05:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 10:05:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-04-28 10:05:42,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:42,143 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-28 10:05:42,143 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-28 10:05:42,143 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-28 10:05:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:42,143 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-28 10:05:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-28 10:05:42,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:42,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:42,144 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-28 10:05:42,144 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-28 10:05:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:42,144 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-28 10:05:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-28 10:05:42,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:42,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:42,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:42,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:42,145 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-28 10:05:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-28 10:05:42,145 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-28 10:05:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:42,146 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-28 10:05:42,146 INFO L496 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-28 10:05:42,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-28 10:05:42,470 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-28 10:05:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 10:05:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:05:42,471 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:42,471 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:42,487 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-28 10:05:42,671 WARN L477 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-28 10:05:42,672 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:42,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1404928745, now seen corresponding path program 99 times [2022-04-28 10:05:42,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:42,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1763271964] [2022-04-28 10:05:42,676 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:42,676 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1404928745, now seen corresponding path program 100 times [2022-04-28 10:05:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:42,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187599347] [2022-04-28 10:05:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:42,966 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-28 10:05:42,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {27349#true} assume true; {27349#true} is VALID [2022-04-28 10:05:42,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27349#true} {27349#true} #50#return; {27349#true} is VALID [2022-04-28 10:05:42,967 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-28 10:05:42,967 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-28 10:05:42,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {27349#true} assume true; {27349#true} is VALID [2022-04-28 10:05:42,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27349#true} {27349#true} #50#return; {27349#true} is VALID [2022-04-28 10:05:42,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {27349#true} call #t~ret9 := main(); {27349#true} is VALID [2022-04-28 10:05:42,968 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-28 10:05:42,968 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-28 10:05:42,969 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-28 10:05:42,969 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-28 10:05:42,970 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-28 10:05:42,971 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-28 10:05:42,971 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-28 10:05:42,972 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-28 10:05:42,973 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-28 10:05:42,973 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-28 10:05:42,973 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-28 10:05:42,974 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-28 10:05:42,975 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-28 10:05:42,975 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-28 10:05:42,976 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-28 10:05:42,977 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-28 10:05:42,977 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-28 10:05:42,978 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-28 10:05:42,978 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-28 10:05:42,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {27350#false} ~cond := #in~cond; {27350#false} is VALID [2022-04-28 10:05:42,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {27350#false} assume 0 == ~cond; {27350#false} is VALID [2022-04-28 10:05:42,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {27350#false} assume !false; {27350#false} is VALID [2022-04-28 10:05:42,978 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-28 10:05:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:42,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187599347] [2022-04-28 10:05:42,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187599347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:42,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901955798] [2022-04-28 10:05:42,979 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:42,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:42,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:42,982 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-28 10:05:42,983 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-28 10:05:43,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:43,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:43,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:05:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:43,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:43,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {27349#true} call ULTIMATE.init(); {27349#true} is VALID [2022-04-28 10:05:43,353 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-28 10:05:43,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {27349#true} assume true; {27349#true} is VALID [2022-04-28 10:05:43,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27349#true} {27349#true} #50#return; {27349#true} is VALID [2022-04-28 10:05:43,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {27349#true} call #t~ret9 := main(); {27349#true} is VALID [2022-04-28 10:05:43,353 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-28 10:05:43,354 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-28 10:05:43,355 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-28 10:05:43,355 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-28 10:05:43,356 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-28 10:05:43,356 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-28 10:05:43,357 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-28 10:05:43,357 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-28 10:05:43,358 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-28 10:05:43,358 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-28 10:05:43,358 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-28 10:05:43,359 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-28 10:05:43,359 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-28 10:05:43,360 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-28 10:05:43,360 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-28 10:05:43,361 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-28 10:05:43,361 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-28 10:05:43,362 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-28 10:05:43,362 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-28 10:05:43,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {27350#false} ~cond := #in~cond; {27350#false} is VALID [2022-04-28 10:05:43,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {27350#false} assume 0 == ~cond; {27350#false} is VALID [2022-04-28 10:05:43,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {27350#false} assume !false; {27350#false} is VALID [2022-04-28 10:05:43,362 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-28 10:05:43,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:43,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {27350#false} assume !false; {27350#false} is VALID [2022-04-28 10:05:43,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {27350#false} assume 0 == ~cond; {27350#false} is VALID [2022-04-28 10:05:43,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {27350#false} ~cond := #in~cond; {27350#false} is VALID [2022-04-28 10:05:43,794 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-28 10:05:43,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {27465#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27350#false} is VALID [2022-04-28 10:05:43,795 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-28 10:05:43,795 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-28 10:05:43,797 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-28 10:05:43,797 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-28 10:05:43,798 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-28 10:05:43,798 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-28 10:05:43,799 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-28 10:05:43,799 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-28 10:05:43,800 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-28 10:05:43,800 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-28 10:05:43,801 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-28 10:05:43,802 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-28 10:05:43,802 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-28 10:05:43,803 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-28 10:05:43,804 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-28 10:05:43,804 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-28 10:05:43,805 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-28 10:05:43,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {27349#true} call #t~ret9 := main(); {27349#true} is VALID [2022-04-28 10:05:43,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27349#true} {27349#true} #50#return; {27349#true} is VALID [2022-04-28 10:05:43,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {27349#true} assume true; {27349#true} is VALID [2022-04-28 10:05:43,805 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-28 10:05:43,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {27349#true} call ULTIMATE.init(); {27349#true} is VALID [2022-04-28 10:05:43,805 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-28 10:05:43,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901955798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:43,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:43,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:05:43,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:43,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1763271964] [2022-04-28 10:05:43,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1763271964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:43,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:43,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:05:43,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569622022] [2022-04-28 10:05:43,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:43,806 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-28 10:05:43,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:43,806 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-28 10:05:43,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:43,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:05:43,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:43,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:05:43,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:05:43,831 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-28 10:05:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:45,766 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-28 10:05:45,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:05:45,767 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-28 10:05:45,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:45,767 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-28 10:05:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2022-04-28 10:05:45,767 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-28 10:05:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2022-04-28 10:05:45,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 52 transitions. [2022-04-28 10:05:45,807 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-28 10:05:45,808 INFO L225 Difference]: With dead ends: 64 [2022-04-28 10:05:45,808 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 10:05:45,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=596, Invalid=2710, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:05:45,809 INFO L413 NwaCegarLoop]: 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-28 10:05:45,809 INFO L414 NwaCegarLoop]: 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-28 10:05:45,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 10:05:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2022-04-28 10:05:46,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:46,108 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-28 10:05:46,108 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-28 10:05:46,108 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-28 10:05:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:46,109 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 10:05:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 10:05:46,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:46,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:46,109 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-28 10:05:46,109 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-28 10:05:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:46,110 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 10:05:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 10:05:46,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:46,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:46,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:46,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:46,110 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-28 10:05:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-28 10:05:46,110 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-28 10:05:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:46,110 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-28 10:05:46,111 INFO L496 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-28 10:05:46,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-28 10:05:46,442 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-28 10:05:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 10:05:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:05:46,442 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:46,442 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:46,458 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-28 10:05:46,642 WARN L477 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-28 10:05:46,643 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:46,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash 521429270, now seen corresponding path program 101 times [2022-04-28 10:05:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:46,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772085549] [2022-04-28 10:05:46,645 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:46,646 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:46,646 INFO L85 PathProgramCache]: Analyzing trace with hash 521429270, now seen corresponding path program 102 times [2022-04-28 10:05:46,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:46,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804740426] [2022-04-28 10:05:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:46,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:46,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:46,907 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-28 10:05:46,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {27925#true} assume true; {27925#true} is VALID [2022-04-28 10:05:46,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27925#true} {27925#true} #50#return; {27925#true} is VALID [2022-04-28 10:05:46,908 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-28 10:05:46,908 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-28 10:05:46,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {27925#true} assume true; {27925#true} is VALID [2022-04-28 10:05:46,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27925#true} {27925#true} #50#return; {27925#true} is VALID [2022-04-28 10:05:46,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {27925#true} call #t~ret9 := main(); {27925#true} is VALID [2022-04-28 10:05:46,908 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-28 10:05:46,909 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-28 10:05:46,909 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-28 10:05:46,910 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-28 10:05:46,910 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-28 10:05:46,911 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-28 10:05:46,911 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-28 10:05:46,912 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-28 10:05:46,912 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-28 10:05:46,913 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-28 10:05:46,913 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-28 10:05:46,914 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-28 10:05:46,914 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-28 10:05:46,915 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-28 10:05:46,915 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-28 10:05:46,916 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-28 10:05:46,916 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-28 10:05:46,917 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-28 10:05:46,917 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-28 10:05:46,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {27926#false} ~cond := #in~cond; {27926#false} is VALID [2022-04-28 10:05:46,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {27926#false} assume 0 == ~cond; {27926#false} is VALID [2022-04-28 10:05:46,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {27926#false} assume !false; {27926#false} is VALID [2022-04-28 10:05:46,917 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-28 10:05:46,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:46,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804740426] [2022-04-28 10:05:46,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804740426] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:46,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033147514] [2022-04-28 10:05:46,917 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:46,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:46,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:46,918 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-28 10:05:46,919 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-28 10:05:46,994 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:05:46,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:46,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:05:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:47,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:47,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {27925#true} call ULTIMATE.init(); {27925#true} is VALID [2022-04-28 10:05:47,254 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-28 10:05:47,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {27925#true} assume true; {27925#true} is VALID [2022-04-28 10:05:47,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27925#true} {27925#true} #50#return; {27925#true} is VALID [2022-04-28 10:05:47,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {27925#true} call #t~ret9 := main(); {27925#true} is VALID [2022-04-28 10:05:47,255 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-28 10:05:47,255 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-28 10:05:47,255 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-28 10:05:47,256 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-28 10:05:47,256 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-28 10:05:47,257 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-28 10:05:47,258 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-28 10:05:47,258 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-28 10:05:47,259 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-28 10:05:47,259 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-28 10:05:47,259 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-28 10:05:47,260 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-28 10:05:47,267 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-28 10:05:47,268 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-28 10:05:47,269 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-28 10:05:47,269 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-28 10:05:47,270 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-28 10:05:47,270 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-28 10:05:47,270 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-28 10:05:47,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {27926#false} ~cond := #in~cond; {27926#false} is VALID [2022-04-28 10:05:47,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {27926#false} assume 0 == ~cond; {27926#false} is VALID [2022-04-28 10:05:47,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {27926#false} assume !false; {27926#false} is VALID [2022-04-28 10:05:47,271 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-28 10:05:47,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:47,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {27926#false} assume !false; {27926#false} is VALID [2022-04-28 10:05:47,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {27926#false} assume 0 == ~cond; {27926#false} is VALID [2022-04-28 10:05:47,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {27926#false} ~cond := #in~cond; {27926#false} is VALID [2022-04-28 10:05:47,727 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-28 10:05:47,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {28041#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27926#false} is VALID [2022-04-28 10:05:47,728 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-28 10:05:47,728 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-28 10:05:47,729 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-28 10:05:47,730 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-28 10:05:47,730 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-28 10:05:47,731 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-28 10:05:47,731 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-28 10:05:47,732 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-28 10:05:47,732 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-28 10:05:47,733 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-28 10:05:47,734 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-28 10:05:47,734 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-28 10:05:47,735 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-28 10:05:47,735 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-28 10:05:47,736 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-28 10:05:47,737 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-28 10:05:47,737 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-28 10:05:47,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {27925#true} call #t~ret9 := main(); {27925#true} is VALID [2022-04-28 10:05:47,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27925#true} {27925#true} #50#return; {27925#true} is VALID [2022-04-28 10:05:47,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {27925#true} assume true; {27925#true} is VALID [2022-04-28 10:05:47,737 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-28 10:05:47,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {27925#true} call ULTIMATE.init(); {27925#true} is VALID [2022-04-28 10:05:47,737 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-28 10:05:47,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033147514] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:47,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:47,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:05:47,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:47,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772085549] [2022-04-28 10:05:47,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772085549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:47,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:47,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:05:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341758195] [2022-04-28 10:05:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:47,738 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-28 10:05:47,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:47,739 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-28 10:05:47,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:47,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:05:47,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:47,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:05:47,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:05:47,757 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-28 10:05:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:49,873 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-04-28 10:05:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:05:49,873 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-28 10:05:49,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:49,874 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-28 10:05:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2022-04-28 10:05:49,874 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-28 10:05:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2022-04-28 10:05:49,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 60 transitions. [2022-04-28 10:05:49,928 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-28 10:05:49,928 INFO L225 Difference]: With dead ends: 71 [2022-04-28 10:05:49,928 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 10:05:49,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=686, Invalid=2974, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:05:49,929 INFO L413 NwaCegarLoop]: 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-28 10:05:49,929 INFO L414 NwaCegarLoop]: 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-28 10:05:49,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 10:05:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2022-04-28 10:05:50,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:50,237 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-28 10:05:50,237 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-28 10:05:50,237 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-28 10:05:50,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:50,237 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 10:05:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 10:05:50,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:50,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:50,238 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-28 10:05:50,238 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-28 10:05:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:50,238 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 10:05:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 10:05:50,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:50,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:50,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:50,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:50,239 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-28 10:05:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-28 10:05:50,239 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-28 10:05:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:50,239 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-28 10:05:50,239 INFO L496 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-28 10:05:50,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-28 10:05:50,780 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-28 10:05:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 10:05:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:05:50,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:50,781 INFO L195 NwaCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:50,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-04-28 10:05:50,981 WARN L477 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-28 10:05:50,981 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash 445022519, now seen corresponding path program 103 times [2022-04-28 10:05:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:50,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913902991] [2022-04-28 10:05:50,988 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:50,988 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 445022519, now seen corresponding path program 104 times [2022-04-28 10:05:50,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:50,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894396226] [2022-04-28 10:05:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:51,276 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-28 10:05:51,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {28535#true} assume true; {28535#true} is VALID [2022-04-28 10:05:51,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28535#true} {28535#true} #50#return; {28535#true} is VALID [2022-04-28 10:05:51,277 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-28 10:05:51,277 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-28 10:05:51,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {28535#true} assume true; {28535#true} is VALID [2022-04-28 10:05:51,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28535#true} {28535#true} #50#return; {28535#true} is VALID [2022-04-28 10:05:51,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {28535#true} call #t~ret9 := main(); {28535#true} is VALID [2022-04-28 10:05:51,277 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-28 10:05:51,278 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-28 10:05:51,278 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-28 10:05:51,279 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-28 10:05:51,280 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-28 10:05:51,280 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-28 10:05:51,281 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-28 10:05:51,282 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-28 10:05:51,282 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-28 10:05:51,283 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-28 10:05:51,284 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-28 10:05:51,284 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-28 10:05:51,285 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-28 10:05:51,285 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-28 10:05:51,286 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-28 10:05:51,286 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-28 10:05:51,287 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-28 10:05:51,288 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-28 10:05:51,288 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-28 10:05:51,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {28536#false} ~cond := #in~cond; {28536#false} is VALID [2022-04-28 10:05:51,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {28536#false} assume 0 == ~cond; {28536#false} is VALID [2022-04-28 10:05:51,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {28536#false} assume !false; {28536#false} is VALID [2022-04-28 10:05:51,288 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-28 10:05:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:51,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894396226] [2022-04-28 10:05:51,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894396226] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:51,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213247088] [2022-04-28 10:05:51,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:51,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:51,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:51,290 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-28 10:05:51,314 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-28 10:05:51,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:51,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:51,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:05:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:51,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:51,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {28535#true} call ULTIMATE.init(); {28535#true} is VALID [2022-04-28 10:05:51,618 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-28 10:05:51,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {28535#true} assume true; {28535#true} is VALID [2022-04-28 10:05:51,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28535#true} {28535#true} #50#return; {28535#true} is VALID [2022-04-28 10:05:51,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {28535#true} call #t~ret9 := main(); {28535#true} is VALID [2022-04-28 10:05:51,618 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-28 10:05:51,618 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-28 10:05:51,619 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-28 10:05:51,620 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-28 10:05:51,620 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-28 10:05:51,621 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-28 10:05:51,621 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-28 10:05:51,622 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-28 10:05:51,622 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-28 10:05:51,623 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-28 10:05:51,623 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-28 10:05:51,623 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-28 10:05:51,624 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-28 10:05:51,624 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-28 10:05:51,625 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-28 10:05:51,625 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-28 10:05:51,626 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-28 10:05:51,626 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-28 10:05:51,626 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-28 10:05:51,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {28536#false} ~cond := #in~cond; {28536#false} is VALID [2022-04-28 10:05:51,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {28536#false} assume 0 == ~cond; {28536#false} is VALID [2022-04-28 10:05:51,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {28536#false} assume !false; {28536#false} is VALID [2022-04-28 10:05:51,627 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-28 10:05:51,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:52,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {28536#false} assume !false; {28536#false} is VALID [2022-04-28 10:05:52,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {28536#false} assume 0 == ~cond; {28536#false} is VALID [2022-04-28 10:05:52,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {28536#false} ~cond := #in~cond; {28536#false} is VALID [2022-04-28 10:05:52,082 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-28 10:05:52,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {28651#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {28536#false} is VALID [2022-04-28 10:05:52,083 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-28 10:05:52,084 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-28 10:05:52,085 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-28 10:05:52,085 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-28 10:05:52,086 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-28 10:05:52,086 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-28 10:05:52,087 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-28 10:05:52,087 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-28 10:05:52,088 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-28 10:05:52,088 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-28 10:05:52,089 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-28 10:05:52,090 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-28 10:05:52,090 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-28 10:05:52,091 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-28 10:05:52,092 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-28 10:05:52,092 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-28 10:05:52,093 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-28 10:05:52,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {28535#true} call #t~ret9 := main(); {28535#true} is VALID [2022-04-28 10:05:52,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28535#true} {28535#true} #50#return; {28535#true} is VALID [2022-04-28 10:05:52,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {28535#true} assume true; {28535#true} is VALID [2022-04-28 10:05:52,093 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-28 10:05:52,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {28535#true} call ULTIMATE.init(); {28535#true} is VALID [2022-04-28 10:05:52,093 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-28 10:05:52,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213247088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:52,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:52,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:05:52,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:52,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913902991] [2022-04-28 10:05:52,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913902991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:52,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:52,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:05:52,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538774626] [2022-04-28 10:05:52,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:52,094 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-28 10:05:52,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:52,094 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-28 10:05:52,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:52,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:05:52,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:52,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:05:52,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:05:52,112 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-28 10:05:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:54,374 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-04-28 10:05:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:05:54,374 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-28 10:05:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:54,374 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-28 10:05:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 65 transitions. [2022-04-28 10:05:54,375 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-28 10:05:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 65 transitions. [2022-04-28 10:05:54,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 65 transitions. [2022-04-28 10:05:54,425 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-28 10:05:54,426 INFO L225 Difference]: With dead ends: 77 [2022-04-28 10:05:54,426 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 10:05:54,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=708, Invalid=2952, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:05:54,426 INFO L413 NwaCegarLoop]: 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-28 10:05:54,426 INFO L414 NwaCegarLoop]: 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-28 10:05:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 10:05:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2022-04-28 10:05:54,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:54,753 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-28 10:05:54,753 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-28 10:05:54,753 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-28 10:05:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:54,754 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-28 10:05:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-04-28 10:05:54,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:54,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:54,754 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-28 10:05:54,754 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-28 10:05:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:54,754 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-28 10:05:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-04-28 10:05:54,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:54,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:54,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:54,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:54,755 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-28 10:05:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-28 10:05:54,755 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-28 10:05:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:54,755 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-28 10:05:54,755 INFO L496 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-28 10:05:54,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-28 10:05:55,092 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-28 10:05:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 10:05:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:05:55,092 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:55,093 INFO L195 NwaCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:55,109 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-28 10:05:55,293 WARN L477 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-28 10:05:55,293 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:55,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:55,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1412389110, now seen corresponding path program 105 times [2022-04-28 10:05:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:55,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1379866726] [2022-04-28 10:05:55,295 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:55,296 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1412389110, now seen corresponding path program 106 times [2022-04-28 10:05:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:55,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550068199] [2022-04-28 10:05:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:55,542 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-28 10:05:55,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 10:05:55,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29169#true} {29169#true} #50#return; {29169#true} is VALID [2022-04-28 10:05:55,543 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-28 10:05:55,543 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-28 10:05:55,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 10:05:55,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29169#true} {29169#true} #50#return; {29169#true} is VALID [2022-04-28 10:05:55,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {29169#true} call #t~ret9 := main(); {29169#true} is VALID [2022-04-28 10:05:55,544 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-28 10:05:55,544 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-28 10:05:55,545 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-28 10:05:55,545 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-28 10:05:55,546 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-28 10:05:55,546 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-28 10:05:55,547 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-28 10:05:55,547 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-28 10:05:55,548 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-28 10:05:55,548 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-28 10:05:55,549 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-28 10:05:55,549 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-28 10:05:55,549 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-28 10:05:55,550 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-28 10:05:55,550 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-28 10:05:55,551 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-28 10:05:55,551 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-28 10:05:55,552 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-28 10:05:55,552 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-28 10:05:55,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-28 10:05:55,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {29170#false} assume 0 == ~cond; {29170#false} is VALID [2022-04-28 10:05:55,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2022-04-28 10:05:55,552 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-28 10:05:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:55,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550068199] [2022-04-28 10:05:55,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550068199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:55,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035469662] [2022-04-28 10:05:55,552 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:55,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:55,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:55,553 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-28 10:05:55,555 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-28 10:05:55,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:55,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:55,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:05:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:55,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:55,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {29169#true} call ULTIMATE.init(); {29169#true} is VALID [2022-04-28 10:05:55,858 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-28 10:05:55,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 10:05:55,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29169#true} {29169#true} #50#return; {29169#true} is VALID [2022-04-28 10:05:55,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {29169#true} call #t~ret9 := main(); {29169#true} is VALID [2022-04-28 10:05:55,858 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-28 10:05:55,859 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-28 10:05:55,859 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-28 10:05:55,860 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-28 10:05:55,860 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-28 10:05:55,861 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-28 10:05:55,861 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-28 10:05:55,862 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-28 10:05:55,862 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-28 10:05:55,863 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-28 10:05:55,863 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-28 10:05:55,864 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-28 10:05:55,864 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-28 10:05:55,864 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-28 10:05:55,865 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-28 10:05:55,865 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-28 10:05:55,866 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-28 10:05:55,866 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-28 10:05:55,866 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-28 10:05:55,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-28 10:05:55,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {29170#false} assume 0 == ~cond; {29170#false} is VALID [2022-04-28 10:05:55,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2022-04-28 10:05:55,867 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-28 10:05:55,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:56,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2022-04-28 10:05:56,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {29170#false} assume 0 == ~cond; {29170#false} is VALID [2022-04-28 10:05:56,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-28 10:05:56,309 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-28 10:05:56,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {29285#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29170#false} is VALID [2022-04-28 10:05:56,311 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-28 10:05:56,311 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-28 10:05:56,313 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-28 10:05:56,314 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-28 10:05:56,314 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-28 10:05:56,314 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-28 10:05:56,315 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-28 10:05:56,316 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-28 10:05:56,316 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-28 10:05:56,317 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-28 10:05:56,318 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-28 10:05:56,318 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-28 10:05:56,319 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-28 10:05:56,319 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-28 10:05:56,320 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-28 10:05:56,321 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-28 10:05:56,321 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-28 10:05:56,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {29169#true} call #t~ret9 := main(); {29169#true} is VALID [2022-04-28 10:05:56,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29169#true} {29169#true} #50#return; {29169#true} is VALID [2022-04-28 10:05:56,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 10:05:56,321 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-28 10:05:56,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {29169#true} call ULTIMATE.init(); {29169#true} is VALID [2022-04-28 10:05:56,321 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-28 10:05:56,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035469662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:56,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:56,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:05:56,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:56,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1379866726] [2022-04-28 10:05:56,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1379866726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:56,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:56,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:05:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896996471] [2022-04-28 10:05:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:56,322 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-28 10:05:56,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:56,322 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-28 10:05:56,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:56,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:05:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:56,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:05:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:05:56,341 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-28 10:05:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:58,882 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-04-28 10:05:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:05:58,882 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-28 10:05:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:58,882 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-28 10:05:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-28 10:05:58,883 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-28 10:05:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-28 10:05:58,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 67 transitions. [2022-04-28 10:05:58,936 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-28 10:05:58,937 INFO L225 Difference]: With dead ends: 82 [2022-04-28 10:05:58,937 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 10:05:58,937 INFO L412 NwaCegarLoop]: 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-28 10:05:58,938 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:58,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 109 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:05:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 10:05:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 43. [2022-04-28 10:05:59,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:59,258 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-28 10:05:59,258 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-28 10:05:59,258 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-28 10:05:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:59,258 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-28 10:05:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-28 10:05:59,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:59,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:59,259 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-28 10:05:59,259 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-28 10:05:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:59,259 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-28 10:05:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-28 10:05:59,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:59,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:59,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:59,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:59,260 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-28 10:05:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-28 10:05:59,260 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-28 10:05:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:59,260 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-28 10:05:59,260 INFO L496 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-28 10:05:59,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-28 10:05:59,623 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-28 10:05:59,624 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 10:05:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:05:59,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:59,624 INFO L195 NwaCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:59,639 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-28 10:05:59,827 WARN L477 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-28 10:05:59,827 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash 473763159, now seen corresponding path program 107 times [2022-04-28 10:05:59,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:59,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1505387756] [2022-04-28 10:05:59,830 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:59,830 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash 473763159, now seen corresponding path program 108 times [2022-04-28 10:05:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:59,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202635777] [2022-04-28 10:05:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:00,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:00,075 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-28 10:06:00,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {29817#true} assume true; {29817#true} is VALID [2022-04-28 10:06:00,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29817#true} {29817#true} #50#return; {29817#true} is VALID [2022-04-28 10:06:00,076 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-28 10:06:00,076 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-28 10:06:00,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {29817#true} assume true; {29817#true} is VALID [2022-04-28 10:06:00,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29817#true} {29817#true} #50#return; {29817#true} is VALID [2022-04-28 10:06:00,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {29817#true} call #t~ret9 := main(); {29817#true} is VALID [2022-04-28 10:06:00,076 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-28 10:06:00,077 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-28 10:06:00,077 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-28 10:06:00,078 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-28 10:06:00,078 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-28 10:06:00,079 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-28 10:06:00,079 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-28 10:06:00,080 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-28 10:06:00,080 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-28 10:06:00,082 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-28 10:06:00,083 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-28 10:06:00,083 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-28 10:06:00,084 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-28 10:06:00,084 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-28 10:06:00,085 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-28 10:06:00,085 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-28 10:06:00,086 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-28 10:06:00,086 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-28 10:06:00,086 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-28 10:06:00,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {29818#false} ~cond := #in~cond; {29818#false} is VALID [2022-04-28 10:06:00,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {29818#false} assume 0 == ~cond; {29818#false} is VALID [2022-04-28 10:06:00,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {29818#false} assume !false; {29818#false} is VALID [2022-04-28 10:06:00,087 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-28 10:06:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:00,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202635777] [2022-04-28 10:06:00,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202635777] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:00,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86306260] [2022-04-28 10:06:00,087 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:00,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:00,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:00,088 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-28 10:06:00,089 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-28 10:06:00,229 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:06:00,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:00,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:06:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:00,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:00,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {29817#true} call ULTIMATE.init(); {29817#true} is VALID [2022-04-28 10:06:00,507 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-28 10:06:00,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {29817#true} assume true; {29817#true} is VALID [2022-04-28 10:06:00,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29817#true} {29817#true} #50#return; {29817#true} is VALID [2022-04-28 10:06:00,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {29817#true} call #t~ret9 := main(); {29817#true} is VALID [2022-04-28 10:06:00,507 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-28 10:06:00,508 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-28 10:06:00,508 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-28 10:06:00,509 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-28 10:06:00,510 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-28 10:06:00,510 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-28 10:06:00,511 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-28 10:06:00,512 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-28 10:06:00,512 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-28 10:06:00,513 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-28 10:06:00,514 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-28 10:06:00,514 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-28 10:06:00,515 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-28 10:06:00,515 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-28 10:06:00,516 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-28 10:06:00,516 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-28 10:06:00,517 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-28 10:06:00,517 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-28 10:06:00,518 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-28 10:06:00,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {29818#false} ~cond := #in~cond; {29818#false} is VALID [2022-04-28 10:06:00,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {29818#false} assume 0 == ~cond; {29818#false} is VALID [2022-04-28 10:06:00,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {29818#false} assume !false; {29818#false} is VALID [2022-04-28 10:06:00,518 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-28 10:06:00,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:00,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {29818#false} assume !false; {29818#false} is VALID [2022-04-28 10:06:00,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {29818#false} assume 0 == ~cond; {29818#false} is VALID [2022-04-28 10:06:00,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {29818#false} ~cond := #in~cond; {29818#false} is VALID [2022-04-28 10:06:00,997 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-28 10:06:00,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {29933#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29818#false} is VALID [2022-04-28 10:06:00,998 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-28 10:06:00,999 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-28 10:06:01,000 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-28 10:06:01,000 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-28 10:06:01,001 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-28 10:06:01,002 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-28 10:06:01,002 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-28 10:06:01,003 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-28 10:06:01,004 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-28 10:06:01,005 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-28 10:06:01,006 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-28 10:06:01,006 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-28 10:06:01,007 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-28 10:06:01,008 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-28 10:06:01,009 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-28 10:06:01,009 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-28 10:06:01,010 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-28 10:06:01,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {29817#true} call #t~ret9 := main(); {29817#true} is VALID [2022-04-28 10:06:01,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29817#true} {29817#true} #50#return; {29817#true} is VALID [2022-04-28 10:06:01,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {29817#true} assume true; {29817#true} is VALID [2022-04-28 10:06:01,010 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-28 10:06:01,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {29817#true} call ULTIMATE.init(); {29817#true} is VALID [2022-04-28 10:06:01,010 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-28 10:06:01,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86306260] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:01,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:01,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:06:01,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:01,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1505387756] [2022-04-28 10:06:01,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1505387756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:01,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:01,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:06:01,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924073540] [2022-04-28 10:06:01,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:01,012 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-28 10:06:01,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:01,012 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-28 10:06:01,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:01,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:06:01,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:01,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:06:01,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:06:01,034 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-28 10:06:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:03,607 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-04-28 10:06:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:06:03,608 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-28 10:06:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:03,608 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-28 10:06:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 69 transitions. [2022-04-28 10:06:03,608 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-28 10:06:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 69 transitions. [2022-04-28 10:06:03,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 69 transitions. [2022-04-28 10:06:03,668 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-28 10:06:03,669 INFO L225 Difference]: With dead ends: 86 [2022-04-28 10:06:03,669 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 10:06:03,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:06:03,669 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:03,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 104 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:06:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 10:06:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 43. [2022-04-28 10:06:03,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:03,971 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-28 10:06:03,971 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-28 10:06:03,971 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-28 10:06:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:03,971 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-28 10:06:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-28 10:06:03,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:03,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:03,972 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-28 10:06:03,972 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-28 10:06:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:03,973 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-28 10:06:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-28 10:06:03,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:03,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:03,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:03,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:03,973 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-28 10:06:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-28 10:06:03,973 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-28 10:06:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:03,973 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-28 10:06:03,974 INFO L496 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-28 10:06:03,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-28 10:06:04,316 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-28 10:06:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 10:06:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:06:04,316 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:04,316 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:04,320 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-28 10:06:04,519 WARN L477 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-28 10:06:04,519 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:04,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash -110704426, now seen corresponding path program 109 times [2022-04-28 10:06:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:04,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [361277393] [2022-04-28 10:06:04,522 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:04,523 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash -110704426, now seen corresponding path program 110 times [2022-04-28 10:06:04,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:04,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878274487] [2022-04-28 10:06:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:04,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:04,757 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-28 10:06:04,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {30475#true} assume true; {30475#true} is VALID [2022-04-28 10:06:04,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30475#true} {30475#true} #50#return; {30475#true} is VALID [2022-04-28 10:06:04,757 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-28 10:06:04,758 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-28 10:06:04,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {30475#true} assume true; {30475#true} is VALID [2022-04-28 10:06:04,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30475#true} {30475#true} #50#return; {30475#true} is VALID [2022-04-28 10:06:04,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {30475#true} call #t~ret9 := main(); {30475#true} is VALID [2022-04-28 10:06:04,758 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-28 10:06:04,758 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-28 10:06:04,759 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-28 10:06:04,759 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-28 10:06:04,760 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-28 10:06:04,760 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-28 10:06:04,761 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-28 10:06:04,761 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-28 10:06:04,762 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-28 10:06:04,762 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-28 10:06:04,763 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-28 10:06:04,763 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-28 10:06:04,764 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-28 10:06:04,764 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-28 10:06:04,765 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-28 10:06:04,765 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-28 10:06:04,766 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-28 10:06:04,766 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-28 10:06:04,766 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-28 10:06:04,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {30476#false} ~cond := #in~cond; {30476#false} is VALID [2022-04-28 10:06:04,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {30476#false} assume 0 == ~cond; {30476#false} is VALID [2022-04-28 10:06:04,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {30476#false} assume !false; {30476#false} is VALID [2022-04-28 10:06:04,766 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-28 10:06:04,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:04,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878274487] [2022-04-28 10:06:04,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878274487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:04,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232806010] [2022-04-28 10:06:04,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:04,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:04,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:04,768 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-28 10:06:04,768 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-28 10:06:04,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:04,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:04,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:06:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:04,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:05,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {30475#true} call ULTIMATE.init(); {30475#true} is VALID [2022-04-28 10:06:05,069 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-28 10:06:05,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {30475#true} assume true; {30475#true} is VALID [2022-04-28 10:06:05,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30475#true} {30475#true} #50#return; {30475#true} is VALID [2022-04-28 10:06:05,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {30475#true} call #t~ret9 := main(); {30475#true} is VALID [2022-04-28 10:06:05,069 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-28 10:06:05,069 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-28 10:06:05,070 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-28 10:06:05,071 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-28 10:06:05,071 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-28 10:06:05,072 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-28 10:06:05,072 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-28 10:06:05,073 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-28 10:06:05,073 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-28 10:06:05,074 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-28 10:06:05,074 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-28 10:06:05,075 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-28 10:06:05,075 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-28 10:06:05,076 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-28 10:06:05,076 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-28 10:06:05,076 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-28 10:06:05,077 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-28 10:06:05,077 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-28 10:06:05,077 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-28 10:06:05,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {30476#false} ~cond := #in~cond; {30476#false} is VALID [2022-04-28 10:06:05,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {30476#false} assume 0 == ~cond; {30476#false} is VALID [2022-04-28 10:06:05,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {30476#false} assume !false; {30476#false} is VALID [2022-04-28 10:06:05,078 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-28 10:06:05,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:05,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {30476#false} assume !false; {30476#false} is VALID [2022-04-28 10:06:05,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {30476#false} assume 0 == ~cond; {30476#false} is VALID [2022-04-28 10:06:05,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {30476#false} ~cond := #in~cond; {30476#false} is VALID [2022-04-28 10:06:05,528 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-28 10:06:05,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {30591#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30476#false} is VALID [2022-04-28 10:06:05,529 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-28 10:06:05,529 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-28 10:06:05,529 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-28 10:06:05,530 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-28 10:06:05,531 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-28 10:06:05,532 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-28 10:06:05,532 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-28 10:06:05,533 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-28 10:06:05,533 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-28 10:06:05,534 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-28 10:06:05,535 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-28 10:06:05,535 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-28 10:06:05,536 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-28 10:06:05,536 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-28 10:06:05,537 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-28 10:06:05,538 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-28 10:06:05,538 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-28 10:06:05,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {30475#true} call #t~ret9 := main(); {30475#true} is VALID [2022-04-28 10:06:05,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30475#true} {30475#true} #50#return; {30475#true} is VALID [2022-04-28 10:06:05,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {30475#true} assume true; {30475#true} is VALID [2022-04-28 10:06:05,538 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-28 10:06:05,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {30475#true} call ULTIMATE.init(); {30475#true} is VALID [2022-04-28 10:06:05,538 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-28 10:06:05,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232806010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:05,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:05,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:06:05,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:05,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [361277393] [2022-04-28 10:06:05,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [361277393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:05,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:05,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:06:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804155972] [2022-04-28 10:06:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:05,539 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-28 10:06:05,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:05,539 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-28 10:06:05,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:05,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:06:05,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:05,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:06:05,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:06:05,556 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-28 10:06:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:08,281 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-04-28 10:06:08,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:06:08,281 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-28 10:06:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:08,282 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-28 10:06:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 72 transitions. [2022-04-28 10:06:08,282 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-28 10:06:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 72 transitions. [2022-04-28 10:06:08,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 72 transitions. [2022-04-28 10:06:08,356 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-28 10:06:08,357 INFO L225 Difference]: With dead ends: 89 [2022-04-28 10:06:08,357 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 10:06:08,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=589, Invalid=2167, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:06:08,357 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:08,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 114 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:06:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 10:06:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 43. [2022-04-28 10:06:08,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:08,665 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-28 10:06:08,665 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-28 10:06:08,665 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-28 10:06:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:08,666 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2022-04-28 10:06:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2022-04-28 10:06:08,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:08,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:08,666 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-28 10:06:08,666 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-28 10:06:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:08,667 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2022-04-28 10:06:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2022-04-28 10:06:08,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:08,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:08,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:08,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:08,667 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-28 10:06:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-28 10:06:08,667 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-28 10:06:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:08,668 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-28 10:06:08,668 INFO L496 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-28 10:06:08,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-28 10:06:09,059 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-28 10:06:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 10:06:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:06:09,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:09,059 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:09,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-04-28 10:06:09,260 WARN L477 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-28 10:06:09,260 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2087199095, now seen corresponding path program 27 times [2022-04-28 10:06:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:09,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1061876203] [2022-04-28 10:06:09,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:09,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2087199095, now seen corresponding path program 28 times [2022-04-28 10:06:09,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:09,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689491720] [2022-04-28 10:06:09,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:09,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:09,534 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-28 10:06:09,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {31141#true} assume true; {31141#true} is VALID [2022-04-28 10:06:09,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31141#true} {31141#true} #50#return; {31141#true} is VALID [2022-04-28 10:06:09,534 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-28 10:06:09,535 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-28 10:06:09,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {31141#true} assume true; {31141#true} is VALID [2022-04-28 10:06:09,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31141#true} {31141#true} #50#return; {31141#true} is VALID [2022-04-28 10:06:09,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {31141#true} call #t~ret9 := main(); {31141#true} is VALID [2022-04-28 10:06:09,535 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-28 10:06:09,535 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-28 10:06:09,536 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-28 10:06:09,536 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-28 10:06:09,537 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-28 10:06:09,537 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-28 10:06:09,538 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-28 10:06:09,538 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-28 10:06:09,539 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-28 10:06:09,539 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-28 10:06:09,540 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-28 10:06:09,540 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-28 10:06:09,541 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-28 10:06:09,541 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-28 10:06:09,542 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-28 10:06:09,542 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-28 10:06:09,543 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-28 10:06:09,543 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-28 10:06:09,543 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-28 10:06:09,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {31142#false} ~cond := #in~cond; {31142#false} is VALID [2022-04-28 10:06:09,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {31142#false} assume 0 == ~cond; {31142#false} is VALID [2022-04-28 10:06:09,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {31142#false} assume !false; {31142#false} is VALID [2022-04-28 10:06:09,543 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-28 10:06:09,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:09,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689491720] [2022-04-28 10:06:09,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689491720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:09,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422694234] [2022-04-28 10:06:09,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:09,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:09,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:09,545 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-28 10:06:09,545 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-28 10:06:09,578 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:09,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:09,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:06:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:09,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:09,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {31141#true} call ULTIMATE.init(); {31141#true} is VALID [2022-04-28 10:06:09,846 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-28 10:06:09,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {31141#true} assume true; {31141#true} is VALID [2022-04-28 10:06:09,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31141#true} {31141#true} #50#return; {31141#true} is VALID [2022-04-28 10:06:09,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {31141#true} call #t~ret9 := main(); {31141#true} is VALID [2022-04-28 10:06:09,846 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-28 10:06:09,847 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-28 10:06:09,847 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-28 10:06:09,848 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-28 10:06:09,848 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-28 10:06:09,849 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-28 10:06:09,849 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-28 10:06:09,850 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-28 10:06:09,850 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-28 10:06:09,851 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-28 10:06:09,851 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-28 10:06:09,852 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-28 10:06:09,852 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-28 10:06:09,853 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-28 10:06:09,853 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-28 10:06:09,853 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-28 10:06:09,854 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-28 10:06:09,854 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-28 10:06:09,854 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-28 10:06:09,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {31142#false} ~cond := #in~cond; {31142#false} is VALID [2022-04-28 10:06:09,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {31142#false} assume 0 == ~cond; {31142#false} is VALID [2022-04-28 10:06:09,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {31142#false} assume !false; {31142#false} is VALID [2022-04-28 10:06:09,855 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-28 10:06:09,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:10,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {31142#false} assume !false; {31142#false} is VALID [2022-04-28 10:06:10,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {31142#false} assume 0 == ~cond; {31142#false} is VALID [2022-04-28 10:06:10,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {31142#false} ~cond := #in~cond; {31142#false} is VALID [2022-04-28 10:06:10,327 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-28 10:06:10,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {31257#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31142#false} is VALID [2022-04-28 10:06:10,327 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-28 10:06:10,328 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-28 10:06:10,328 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-28 10:06:10,329 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-28 10:06:10,330 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-28 10:06:10,330 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-28 10:06:10,331 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-28 10:06:10,331 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-28 10:06:10,332 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-28 10:06:10,333 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-28 10:06:10,333 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-28 10:06:10,334 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-28 10:06:10,335 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-28 10:06:10,335 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-28 10:06:10,336 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-28 10:06:10,336 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-28 10:06:10,337 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-28 10:06:10,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {31141#true} call #t~ret9 := main(); {31141#true} is VALID [2022-04-28 10:06:10,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31141#true} {31141#true} #50#return; {31141#true} is VALID [2022-04-28 10:06:10,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {31141#true} assume true; {31141#true} is VALID [2022-04-28 10:06:10,337 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-28 10:06:10,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {31141#true} call ULTIMATE.init(); {31141#true} is VALID [2022-04-28 10:06:10,337 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-28 10:06:10,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422694234] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:10,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:10,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:06:10,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:10,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1061876203] [2022-04-28 10:06:10,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1061876203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:10,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:10,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:06:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274618864] [2022-04-28 10:06:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:10,338 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-28 10:06:10,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:10,338 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-28 10:06:10,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:10,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:06:10,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:06:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:06:10,367 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-28 10:06:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:13,271 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2022-04-28 10:06:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:06:13,271 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-28 10:06:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:13,271 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-28 10:06:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-28 10:06:13,272 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-28 10:06:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-28 10:06:13,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 76 transitions. [2022-04-28 10:06:13,334 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-28 10:06:13,335 INFO L225 Difference]: With dead ends: 94 [2022-04-28 10:06:13,335 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 10:06:13,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=602, Invalid=2050, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:06:13,336 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 72 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:13,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 122 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:06:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 10:06:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 45. [2022-04-28 10:06:13,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:13,651 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-28 10:06:13,651 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-28 10:06:13,651 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-28 10:06:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:13,652 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-28 10:06:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2022-04-28 10:06:13,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:13,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:13,652 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-28 10:06:13,652 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-28 10:06:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:13,653 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-28 10:06:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2022-04-28 10:06:13,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:13,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:13,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:13,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:13,653 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-28 10:06:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-04-28 10:06:13,654 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 27 [2022-04-28 10:06:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:13,654 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-04-28 10:06:13,654 INFO L496 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-28 10:06:13,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 54 transitions. [2022-04-28 10:06:14,019 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-28 10:06:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-04-28 10:06:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:06:14,020 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:14,020 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:14,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-04-28 10:06:14,220 WARN L477 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-28 10:06:14,220 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:14,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:14,221 INFO L85 PathProgramCache]: Analyzing trace with hash -667770900, now seen corresponding path program 111 times [2022-04-28 10:06:14,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:14,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1291618758] [2022-04-28 10:06:14,223 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:14,223 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash -667770900, now seen corresponding path program 112 times [2022-04-28 10:06:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:14,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058231714] [2022-04-28 10:06:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:14,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:14,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:14,458 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-28 10:06:14,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {31829#true} assume true; {31829#true} is VALID [2022-04-28 10:06:14,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31829#true} {31829#true} #50#return; {31829#true} is VALID [2022-04-28 10:06:14,458 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-28 10:06:14,458 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-28 10:06:14,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {31829#true} assume true; {31829#true} is VALID [2022-04-28 10:06:14,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31829#true} {31829#true} #50#return; {31829#true} is VALID [2022-04-28 10:06:14,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {31829#true} call #t~ret9 := main(); {31829#true} is VALID [2022-04-28 10:06:14,459 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-28 10:06:14,459 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-28 10:06:14,460 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-28 10:06:14,460 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-28 10:06:14,461 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-28 10:06:14,461 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-28 10:06:14,462 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-28 10:06:14,462 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-28 10:06:14,463 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-28 10:06:14,463 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-28 10:06:14,464 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-28 10:06:14,464 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-28 10:06:14,465 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-28 10:06:14,465 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-28 10:06:14,466 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-28 10:06:14,466 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-28 10:06:14,467 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-28 10:06:14,467 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-28 10:06:14,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {31830#false} assume !(~z~0 % 4294967296 > 0); {31830#false} is VALID [2022-04-28 10:06:14,467 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-28 10:06:14,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {31830#false} ~cond := #in~cond; {31830#false} is VALID [2022-04-28 10:06:14,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {31830#false} assume 0 == ~cond; {31830#false} is VALID [2022-04-28 10:06:14,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {31830#false} assume !false; {31830#false} is VALID [2022-04-28 10:06:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:14,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058231714] [2022-04-28 10:06:14,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058231714] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:14,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421072087] [2022-04-28 10:06:14,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:14,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:14,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:14,469 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-28 10:06:14,470 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-28 10:06:14,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:14,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:14,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:06:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:14,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:14,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {31829#true} call ULTIMATE.init(); {31829#true} is VALID [2022-04-28 10:06:14,750 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-28 10:06:14,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {31829#true} assume true; {31829#true} is VALID [2022-04-28 10:06:14,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31829#true} {31829#true} #50#return; {31829#true} is VALID [2022-04-28 10:06:14,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {31829#true} call #t~ret9 := main(); {31829#true} is VALID [2022-04-28 10:06:14,751 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-28 10:06:14,751 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-28 10:06:14,751 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-28 10:06:14,752 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-28 10:06:14,752 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-28 10:06:14,753 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-28 10:06:14,753 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-28 10:06:14,754 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-28 10:06:14,754 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-28 10:06:14,755 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-28 10:06:14,755 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-28 10:06:14,756 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-28 10:06:14,756 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-28 10:06:14,757 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-28 10:06:14,757 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-28 10:06:14,758 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-28 10:06:14,758 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-28 10:06:14,759 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-28 10:06:14,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {31830#false} assume !(~z~0 % 4294967296 > 0); {31830#false} is VALID [2022-04-28 10:06:14,759 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-28 10:06:14,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {31830#false} ~cond := #in~cond; {31830#false} is VALID [2022-04-28 10:06:14,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {31830#false} assume 0 == ~cond; {31830#false} is VALID [2022-04-28 10:06:14,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {31830#false} assume !false; {31830#false} is VALID [2022-04-28 10:06:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:14,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:15,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {31830#false} assume !false; {31830#false} is VALID [2022-04-28 10:06:15,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {31830#false} assume 0 == ~cond; {31830#false} is VALID [2022-04-28 10:06:15,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {31830#false} ~cond := #in~cond; {31830#false} is VALID [2022-04-28 10:06:15,214 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-28 10:06:15,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {31830#false} assume !(~z~0 % 4294967296 > 0); {31830#false} is VALID [2022-04-28 10:06:15,214 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-28 10:06:15,215 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-28 10:06:15,216 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-28 10:06:15,216 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-28 10:06:15,219 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-28 10:06:15,220 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-28 10:06:15,221 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-28 10:06:15,222 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-28 10:06:15,222 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-28 10:06:15,222 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-28 10:06:15,223 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-28 10:06:15,224 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-28 10:06:15,224 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-28 10:06:15,225 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-28 10:06:15,225 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-28 10:06:15,226 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-28 10:06:15,227 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-28 10:06:15,227 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-28 10:06:15,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {31829#true} call #t~ret9 := main(); {31829#true} is VALID [2022-04-28 10:06:15,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31829#true} {31829#true} #50#return; {31829#true} is VALID [2022-04-28 10:06:15,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {31829#true} assume true; {31829#true} is VALID [2022-04-28 10:06:15,227 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-28 10:06:15,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {31829#true} call ULTIMATE.init(); {31829#true} is VALID [2022-04-28 10:06:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:15,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421072087] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:15,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:15,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 35 [2022-04-28 10:06:15,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:15,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1291618758] [2022-04-28 10:06:15,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1291618758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:15,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:15,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:06:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638966915] [2022-04-28 10:06:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:15,228 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-28 10:06:15,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:15,228 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-28 10:06:15,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:15,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:06:15,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:15,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:06:15,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1107, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:06:15,247 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-28 10:06:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:16,660 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 10:06:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:06:16,660 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-28 10:06:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:16,661 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-28 10:06:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 39 transitions. [2022-04-28 10:06:16,661 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-28 10:06:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 39 transitions. [2022-04-28 10:06:16,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 39 transitions. [2022-04-28 10:06:16,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:16,693 INFO L225 Difference]: With dead ends: 58 [2022-04-28 10:06:16,693 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 10:06:16,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=2363, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:06:16,693 INFO L413 NwaCegarLoop]: 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-28 10:06:16,693 INFO L414 NwaCegarLoop]: 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-28 10:06:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 10:06:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 10:06:17,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:17,023 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-28 10:06:17,023 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-28 10:06:17,024 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-28 10:06:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:17,024 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-28 10:06:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 10:06:17,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:17,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:17,024 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-28 10:06:17,024 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-28 10:06:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:17,025 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-28 10:06:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 10:06:17,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:17,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:17,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:17,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:17,025 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-28 10:06:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-28 10:06:17,025 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 28 [2022-04-28 10:06:17,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:17,025 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-28 10:06:17,026 INFO L496 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-28 10:06:17,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-28 10:06:17,435 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-28 10:06:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-28 10:06:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:06:17,435 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:17,435 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:17,451 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-28 10:06:17,636 WARN L477 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-28 10:06:17,636 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:17,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash -568623061, now seen corresponding path program 113 times [2022-04-28 10:06:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:17,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [39038175] [2022-04-28 10:06:17,638 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:17,639 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:17,639 INFO L85 PathProgramCache]: Analyzing trace with hash -568623061, now seen corresponding path program 114 times [2022-04-28 10:06:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:17,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264045126] [2022-04-28 10:06:17,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:17,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:17,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:17,932 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-28 10:06:17,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {32354#true} assume true; {32354#true} is VALID [2022-04-28 10:06:17,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32354#true} {32354#true} #50#return; {32354#true} is VALID [2022-04-28 10:06:17,933 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-28 10:06:17,933 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-28 10:06:17,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {32354#true} assume true; {32354#true} is VALID [2022-04-28 10:06:17,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32354#true} {32354#true} #50#return; {32354#true} is VALID [2022-04-28 10:06:17,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {32354#true} call #t~ret9 := main(); {32354#true} is VALID [2022-04-28 10:06:17,933 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-28 10:06:17,934 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-28 10:06:17,934 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-28 10:06:17,935 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-28 10:06:17,935 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-28 10:06:17,936 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-28 10:06:17,936 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-28 10:06:17,937 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-28 10:06:17,937 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-28 10:06:17,938 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-28 10:06:17,938 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-28 10:06:17,938 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-28 10:06:17,939 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-28 10:06:17,939 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-28 10:06:17,940 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-28 10:06:17,940 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-28 10:06:17,941 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-28 10:06:17,941 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-28 10:06:17,942 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-28 10:06:17,942 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-28 10:06:17,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {32355#false} ~cond := #in~cond; {32355#false} is VALID [2022-04-28 10:06:17,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {32355#false} assume 0 == ~cond; {32355#false} is VALID [2022-04-28 10:06:17,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {32355#false} assume !false; {32355#false} is VALID [2022-04-28 10:06:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:17,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:17,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264045126] [2022-04-28 10:06:17,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264045126] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:17,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667415623] [2022-04-28 10:06:17,942 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:17,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:17,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:17,943 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-28 10:06:17,944 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-28 10:06:18,000 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:06:18,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:18,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:06:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:18,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:18,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {32354#true} call ULTIMATE.init(); {32354#true} is VALID [2022-04-28 10:06:18,291 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-28 10:06:18,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {32354#true} assume true; {32354#true} is VALID [2022-04-28 10:06:18,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32354#true} {32354#true} #50#return; {32354#true} is VALID [2022-04-28 10:06:18,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {32354#true} call #t~ret9 := main(); {32354#true} is VALID [2022-04-28 10:06:18,292 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-28 10:06:18,292 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-28 10:06:18,293 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-28 10:06:18,293 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-28 10:06:18,294 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-28 10:06:18,294 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-28 10:06:18,295 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-28 10:06:18,295 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-28 10:06:18,296 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-28 10:06:18,296 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-28 10:06:18,297 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-28 10:06:18,297 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-28 10:06:18,298 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-28 10:06:18,298 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-28 10:06:18,299 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-28 10:06:18,299 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-28 10:06:18,300 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-28 10:06:18,300 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-28 10:06:18,300 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-28 10:06:18,301 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-28 10:06:18,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {32355#false} ~cond := #in~cond; {32355#false} is VALID [2022-04-28 10:06:18,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {32355#false} assume 0 == ~cond; {32355#false} is VALID [2022-04-28 10:06:18,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {32355#false} assume !false; {32355#false} is VALID [2022-04-28 10:06:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:18,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:18,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {32355#false} assume !false; {32355#false} is VALID [2022-04-28 10:06:18,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {32355#false} assume 0 == ~cond; {32355#false} is VALID [2022-04-28 10:06:18,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {32355#false} ~cond := #in~cond; {32355#false} is VALID [2022-04-28 10:06:18,760 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-28 10:06:18,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {32474#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32355#false} is VALID [2022-04-28 10:06:18,761 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-28 10:06:18,762 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-28 10:06:18,763 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-28 10:06:18,764 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-28 10:06:18,764 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-28 10:06:18,765 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-28 10:06:18,766 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-28 10:06:18,766 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-28 10:06:18,767 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-28 10:06:18,767 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-28 10:06:18,768 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-28 10:06:18,768 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-28 10:06:18,769 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-28 10:06:18,770 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-28 10:06:18,771 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-28 10:06:18,771 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-28 10:06:18,772 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-28 10:06:18,772 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-28 10:06:18,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {32354#true} call #t~ret9 := main(); {32354#true} is VALID [2022-04-28 10:06:18,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32354#true} {32354#true} #50#return; {32354#true} is VALID [2022-04-28 10:06:18,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {32354#true} assume true; {32354#true} is VALID [2022-04-28 10:06:18,773 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-28 10:06:18,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {32354#true} call ULTIMATE.init(); {32354#true} is VALID [2022-04-28 10:06:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:18,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667415623] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:18,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:18,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:06:18,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:18,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [39038175] [2022-04-28 10:06:18,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [39038175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:18,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:18,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:18,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393890872] [2022-04-28 10:06:18,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:18,774 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-28 10:06:18,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:18,774 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-28 10:06:18,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:18,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:18,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1194, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:18,793 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-28 10:06:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:20,217 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-28 10:06:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:06:20,217 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-28 10:06:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:20,217 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-28 10:06:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2022-04-28 10:06:20,218 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-28 10:06:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2022-04-28 10:06:20,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 42 transitions. [2022-04-28 10:06:20,250 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-28 10:06:20,250 INFO L225 Difference]: With dead ends: 57 [2022-04-28 10:06:20,250 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 10:06:20,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=506, Invalid=2464, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:06:20,251 INFO L413 NwaCegarLoop]: 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-28 10:06:20,251 INFO L414 NwaCegarLoop]: 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-28 10:06:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 10:06:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2022-04-28 10:06:20,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:20,576 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-28 10:06:20,576 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-28 10:06:20,576 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-28 10:06:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:20,577 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-28 10:06:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-28 10:06:20,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:20,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:20,577 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-28 10:06:20,577 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-28 10:06:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:20,578 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-28 10:06:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-28 10:06:20,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:20,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:20,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:20,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:20,578 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-28 10:06:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-28 10:06:20,579 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-28 10:06:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:20,579 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-28 10:06:20,579 INFO L496 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-28 10:06:20,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-28 10:06:21,112 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-28 10:06:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 10:06:21,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:06:21,112 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:21,112 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:21,137 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-28 10:06:21,313 WARN L477 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-28 10:06:21,313 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash -981066740, now seen corresponding path program 115 times [2022-04-28 10:06:21,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:21,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102342155] [2022-04-28 10:06:21,316 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:21,316 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:21,316 INFO L85 PathProgramCache]: Analyzing trace with hash -981066740, now seen corresponding path program 116 times [2022-04-28 10:06:21,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:21,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161686249] [2022-04-28 10:06:21,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:21,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:21,629 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-28 10:06:21,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-28 10:06:21,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32902#true} {32902#true} #50#return; {32902#true} is VALID [2022-04-28 10:06:21,629 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-28 10:06:21,629 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-28 10:06:21,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-28 10:06:21,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32902#true} {32902#true} #50#return; {32902#true} is VALID [2022-04-28 10:06:21,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {32902#true} call #t~ret9 := main(); {32902#true} is VALID [2022-04-28 10:06:21,630 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-28 10:06:21,630 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-28 10:06:21,631 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-28 10:06:21,632 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-28 10:06:21,632 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-28 10:06:21,633 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-28 10:06:21,634 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-28 10:06:21,634 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-28 10:06:21,635 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-28 10:06:21,636 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-28 10:06:21,636 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-28 10:06:21,636 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-28 10:06:21,637 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-28 10:06:21,638 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-28 10:06:21,638 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-28 10:06:21,639 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-28 10:06:21,640 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-28 10:06:21,640 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-28 10:06:21,641 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-28 10:06:21,641 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-28 10:06:21,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {32903#false} ~cond := #in~cond; {32903#false} is VALID [2022-04-28 10:06:21,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {32903#false} assume 0 == ~cond; {32903#false} is VALID [2022-04-28 10:06:21,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {32903#false} assume !false; {32903#false} is VALID [2022-04-28 10:06:21,641 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-28 10:06:21,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:21,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161686249] [2022-04-28 10:06:21,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161686249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:21,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698029379] [2022-04-28 10:06:21,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:21,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:21,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:21,643 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-28 10:06:21,644 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-28 10:06:21,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:21,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:21,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:06:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:21,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:21,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {32902#true} call ULTIMATE.init(); {32902#true} is VALID [2022-04-28 10:06:21,976 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-28 10:06:21,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-28 10:06:21,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32902#true} {32902#true} #50#return; {32902#true} is VALID [2022-04-28 10:06:21,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {32902#true} call #t~ret9 := main(); {32902#true} is VALID [2022-04-28 10:06:21,976 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-28 10:06:21,976 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-28 10:06:21,977 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-28 10:06:21,977 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-28 10:06:21,978 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-28 10:06:21,978 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-28 10:06:21,979 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-28 10:06:21,980 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-28 10:06:21,980 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-28 10:06:21,981 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-28 10:06:21,981 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-28 10:06:21,981 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-28 10:06:21,982 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-28 10:06:21,982 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-28 10:06:21,983 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-28 10:06:21,983 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-28 10:06:21,984 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-28 10:06:21,984 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-28 10:06:21,985 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-28 10:06:21,985 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-28 10:06:21,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {32903#false} ~cond := #in~cond; {32903#false} is VALID [2022-04-28 10:06:21,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {32903#false} assume 0 == ~cond; {32903#false} is VALID [2022-04-28 10:06:21,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {32903#false} assume !false; {32903#false} is VALID [2022-04-28 10:06:21,985 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-28 10:06:21,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:22,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {32903#false} assume !false; {32903#false} is VALID [2022-04-28 10:06:22,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {32903#false} assume 0 == ~cond; {32903#false} is VALID [2022-04-28 10:06:22,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {32903#false} ~cond := #in~cond; {32903#false} is VALID [2022-04-28 10:06:22,465 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-28 10:06:22,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {33022#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-28 10:06:22,466 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-28 10:06:22,467 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-28 10:06:22,467 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-28 10:06:22,468 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-28 10:06:22,469 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-28 10:06:22,470 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-28 10:06:22,470 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-28 10:06:22,470 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-28 10:06:22,471 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-28 10:06:22,471 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-28 10:06:22,472 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-28 10:06:22,473 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-28 10:06:22,473 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-28 10:06:22,474 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-28 10:06:22,475 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-28 10:06:22,475 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-28 10:06:22,476 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-28 10:06:22,476 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-28 10:06:22,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {32902#true} call #t~ret9 := main(); {32902#true} is VALID [2022-04-28 10:06:22,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32902#true} {32902#true} #50#return; {32902#true} is VALID [2022-04-28 10:06:22,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-28 10:06:22,477 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-28 10:06:22,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {32902#true} call ULTIMATE.init(); {32902#true} is VALID [2022-04-28 10:06:22,477 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-28 10:06:22,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698029379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:22,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:22,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:06:22,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:22,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102342155] [2022-04-28 10:06:22,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102342155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:22,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:22,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:22,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862408101] [2022-04-28 10:06:22,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:22,477 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-28 10:06:22,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:22,478 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-28 10:06:22,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:22,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:22,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:22,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1185, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:22,498 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-28 10:06:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:24,342 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-28 10:06:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:06:24,342 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-28 10:06:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:24,342 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-28 10:06:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2022-04-28 10:06:24,342 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-28 10:06:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2022-04-28 10:06:24,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 53 transitions. [2022-04-28 10:06:24,382 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-28 10:06:24,383 INFO L225 Difference]: With dead ends: 65 [2022-04-28 10:06:24,383 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 10:06:24,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=661, Invalid=2999, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:06:24,383 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:24,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 74 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:06:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 10:06:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-04-28 10:06:24,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:24,713 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-28 10:06:24,713 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-28 10:06:24,713 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-28 10:06:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:24,714 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-28 10:06:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-04-28 10:06:24,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:24,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:24,714 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-28 10:06:24,714 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-28 10:06:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:24,714 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-28 10:06:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-04-28 10:06:24,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:24,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:24,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:24,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:24,715 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-28 10:06:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-28 10:06:24,715 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-28 10:06:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:24,715 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-28 10:06:24,715 INFO L496 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-28 10:06:24,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-28 10:06:25,140 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-28 10:06:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 10:06:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:06:25,141 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:25,141 INFO L195 NwaCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:25,159 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-28 10:06:25,347 WARN L477 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-28 10:06:25,348 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash 945291275, now seen corresponding path program 117 times [2022-04-28 10:06:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:25,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1865664972] [2022-04-28 10:06:25,350 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:25,350 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash 945291275, now seen corresponding path program 118 times [2022-04-28 10:06:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:25,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107859809] [2022-04-28 10:06:25,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:25,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:25,609 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-28 10:06:25,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {33494#true} assume true; {33494#true} is VALID [2022-04-28 10:06:25,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33494#true} {33494#true} #50#return; {33494#true} is VALID [2022-04-28 10:06:25,610 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-28 10:06:25,610 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-28 10:06:25,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {33494#true} assume true; {33494#true} is VALID [2022-04-28 10:06:25,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33494#true} {33494#true} #50#return; {33494#true} is VALID [2022-04-28 10:06:25,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {33494#true} call #t~ret9 := main(); {33494#true} is VALID [2022-04-28 10:06:25,610 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-28 10:06:25,610 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-28 10:06:25,611 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-28 10:06:25,612 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-28 10:06:25,612 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-28 10:06:25,613 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-28 10:06:25,613 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-28 10:06:25,614 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-28 10:06:25,614 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-28 10:06:25,615 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-28 10:06:25,615 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-28 10:06:25,615 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-28 10:06:25,616 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-28 10:06:25,616 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-28 10:06:25,617 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-28 10:06:25,617 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-28 10:06:25,618 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-28 10:06:25,618 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-28 10:06:25,619 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-28 10:06:25,619 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-28 10:06:25,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {33495#false} ~cond := #in~cond; {33495#false} is VALID [2022-04-28 10:06:25,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {33495#false} assume 0 == ~cond; {33495#false} is VALID [2022-04-28 10:06:25,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {33495#false} assume !false; {33495#false} is VALID [2022-04-28 10:06:25,619 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-28 10:06:25,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:25,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107859809] [2022-04-28 10:06:25,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107859809] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:25,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321780208] [2022-04-28 10:06:25,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:25,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:25,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:25,620 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-28 10:06:25,621 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-28 10:06:25,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:25,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:25,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:06:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:25,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:25,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {33494#true} call ULTIMATE.init(); {33494#true} is VALID [2022-04-28 10:06:25,942 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-28 10:06:25,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {33494#true} assume true; {33494#true} is VALID [2022-04-28 10:06:25,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33494#true} {33494#true} #50#return; {33494#true} is VALID [2022-04-28 10:06:25,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {33494#true} call #t~ret9 := main(); {33494#true} is VALID [2022-04-28 10:06:25,943 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-28 10:06:25,943 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-28 10:06:25,944 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-28 10:06:25,944 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-28 10:06:25,945 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-28 10:06:25,945 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-28 10:06:25,946 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-28 10:06:25,946 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-28 10:06:25,947 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-28 10:06:25,947 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-28 10:06:25,948 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-28 10:06:25,948 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-28 10:06:25,949 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-28 10:06:25,949 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-28 10:06:25,950 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-28 10:06:25,950 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-28 10:06:25,951 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-28 10:06:25,951 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-28 10:06:25,952 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-28 10:06:25,952 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-28 10:06:25,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {33495#false} ~cond := #in~cond; {33495#false} is VALID [2022-04-28 10:06:25,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {33495#false} assume 0 == ~cond; {33495#false} is VALID [2022-04-28 10:06:25,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {33495#false} assume !false; {33495#false} is VALID [2022-04-28 10:06:25,952 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-28 10:06:25,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:26,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {33495#false} assume !false; {33495#false} is VALID [2022-04-28 10:06:26,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {33495#false} assume 0 == ~cond; {33495#false} is VALID [2022-04-28 10:06:26,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {33495#false} ~cond := #in~cond; {33495#false} is VALID [2022-04-28 10:06:26,440 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-28 10:06:26,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {33614#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33495#false} is VALID [2022-04-28 10:06:26,442 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-28 10:06:26,443 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-28 10:06:26,444 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-28 10:06:26,444 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-28 10:06:26,445 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-28 10:06:26,445 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-28 10:06:26,447 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-28 10:06:26,448 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-28 10:06:26,449 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-28 10:06:26,450 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-28 10:06:26,450 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-28 10:06:26,451 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-28 10:06:26,452 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-28 10:06:26,453 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-28 10:06:26,454 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-28 10:06:26,454 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-28 10:06:26,455 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-28 10:06:26,455 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-28 10:06:26,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {33494#true} call #t~ret9 := main(); {33494#true} is VALID [2022-04-28 10:06:26,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33494#true} {33494#true} #50#return; {33494#true} is VALID [2022-04-28 10:06:26,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {33494#true} assume true; {33494#true} is VALID [2022-04-28 10:06:26,456 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-28 10:06:26,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {33494#true} call ULTIMATE.init(); {33494#true} is VALID [2022-04-28 10:06:26,456 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-28 10:06:26,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321780208] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:26,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:26,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:06:26,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:26,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1865664972] [2022-04-28 10:06:26,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1865664972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:26,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:26,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:26,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787059787] [2022-04-28 10:06:26,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:26,457 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-28 10:06:26,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:26,457 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-28 10:06:26,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:26,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:26,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:26,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:26,477 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-28 10:06:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:28,850 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-28 10:06:28,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:06:28,851 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-28 10:06:28,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:28,851 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-28 10:06:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 61 transitions. [2022-04-28 10:06:28,851 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-28 10:06:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 61 transitions. [2022-04-28 10:06:28,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 61 transitions. [2022-04-28 10:06:28,898 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-28 10:06:28,898 INFO L225 Difference]: With dead ends: 72 [2022-04-28 10:06:28,898 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 10:06:28,899 INFO L412 NwaCegarLoop]: 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-28 10:06:28,899 INFO L413 NwaCegarLoop]: 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-28 10:06:28,899 INFO L414 NwaCegarLoop]: 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-28 10:06:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 10:06:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2022-04-28 10:06:29,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:29,248 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-28 10:06:29,248 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-28 10:06:29,248 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-28 10:06:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:29,249 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-28 10:06:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-04-28 10:06:29,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:29,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:29,249 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-28 10:06:29,249 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-28 10:06:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:29,249 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-28 10:06:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-04-28 10:06:29,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:29,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:29,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:29,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:29,250 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-28 10:06:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-28 10:06:29,250 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-28 10:06:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:29,250 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-28 10:06:29,250 INFO L496 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-28 10:06:29,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-28 10:06:29,661 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-28 10:06:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 10:06:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:06:29,662 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:29,662 INFO L195 NwaCegarLoop]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:29,689 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-28 10:06:29,884 WARN L477 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-28 10:06:29,884 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:29,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:29,884 INFO L85 PathProgramCache]: Analyzing trace with hash 868884524, now seen corresponding path program 119 times [2022-04-28 10:06:29,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:29,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779374880] [2022-04-28 10:06:29,886 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:29,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:29,886 INFO L85 PathProgramCache]: Analyzing trace with hash 868884524, now seen corresponding path program 120 times [2022-04-28 10:06:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:29,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354067507] [2022-04-28 10:06:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:29,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:30,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:30,169 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-28 10:06:30,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {34120#true} assume true; {34120#true} is VALID [2022-04-28 10:06:30,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34120#true} {34120#true} #50#return; {34120#true} is VALID [2022-04-28 10:06:30,169 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-28 10:06:30,170 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-28 10:06:30,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {34120#true} assume true; {34120#true} is VALID [2022-04-28 10:06:30,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34120#true} {34120#true} #50#return; {34120#true} is VALID [2022-04-28 10:06:30,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {34120#true} call #t~ret9 := main(); {34120#true} is VALID [2022-04-28 10:06:30,170 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-28 10:06:30,170 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-28 10:06:30,171 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-28 10:06:30,171 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-28 10:06:30,172 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-28 10:06:30,172 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-28 10:06:30,173 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-28 10:06:30,173 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-28 10:06:30,174 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-28 10:06:30,174 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-28 10:06:30,175 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-28 10:06:30,175 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-28 10:06:30,176 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-28 10:06:30,176 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-28 10:06:30,177 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-28 10:06:30,177 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-28 10:06:30,178 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-28 10:06:30,178 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-28 10:06:30,178 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-28 10:06:30,179 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-28 10:06:30,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {34121#false} ~cond := #in~cond; {34121#false} is VALID [2022-04-28 10:06:30,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {34121#false} assume 0 == ~cond; {34121#false} is VALID [2022-04-28 10:06:30,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {34121#false} assume !false; {34121#false} is VALID [2022-04-28 10:06:30,179 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-28 10:06:30,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:30,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354067507] [2022-04-28 10:06:30,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354067507] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:30,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256905624] [2022-04-28 10:06:30,179 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:30,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:30,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:30,180 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-28 10:06:30,181 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-28 10:06:30,278 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:06:30,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:30,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:06:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:30,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:30,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {34120#true} call ULTIMATE.init(); {34120#true} is VALID [2022-04-28 10:06:30,594 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-28 10:06:30,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {34120#true} assume true; {34120#true} is VALID [2022-04-28 10:06:30,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34120#true} {34120#true} #50#return; {34120#true} is VALID [2022-04-28 10:06:30,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {34120#true} call #t~ret9 := main(); {34120#true} is VALID [2022-04-28 10:06:30,595 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-28 10:06:30,595 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-28 10:06:30,596 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-28 10:06:30,597 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-28 10:06:30,597 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-28 10:06:30,598 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-28 10:06:30,599 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-28 10:06:30,599 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-28 10:06:30,600 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-28 10:06:30,601 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-28 10:06:30,601 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-28 10:06:30,602 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-28 10:06:30,602 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-28 10:06:30,603 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-28 10:06:30,603 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-28 10:06:30,604 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-28 10:06:30,605 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-28 10:06:30,605 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-28 10:06:30,606 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-28 10:06:30,606 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-28 10:06:30,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {34121#false} ~cond := #in~cond; {34121#false} is VALID [2022-04-28 10:06:30,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {34121#false} assume 0 == ~cond; {34121#false} is VALID [2022-04-28 10:06:30,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {34121#false} assume !false; {34121#false} is VALID [2022-04-28 10:06:30,606 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-28 10:06:30,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:31,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {34121#false} assume !false; {34121#false} is VALID [2022-04-28 10:06:31,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {34121#false} assume 0 == ~cond; {34121#false} is VALID [2022-04-28 10:06:31,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {34121#false} ~cond := #in~cond; {34121#false} is VALID [2022-04-28 10:06:31,101 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-28 10:06:31,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {34240#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34121#false} is VALID [2022-04-28 10:06:31,102 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-28 10:06:31,103 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-28 10:06:31,104 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-28 10:06:31,104 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-28 10:06:31,105 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-28 10:06:31,105 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-28 10:06:31,106 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-28 10:06:31,106 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-28 10:06:31,107 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-28 10:06:31,108 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-28 10:06:31,108 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-28 10:06:31,109 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-28 10:06:31,109 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-28 10:06:31,110 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-28 10:06:31,111 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-28 10:06:31,111 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-28 10:06:31,112 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-28 10:06:31,112 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-28 10:06:31,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {34120#true} call #t~ret9 := main(); {34120#true} is VALID [2022-04-28 10:06:31,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34120#true} {34120#true} #50#return; {34120#true} is VALID [2022-04-28 10:06:31,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {34120#true} assume true; {34120#true} is VALID [2022-04-28 10:06:31,113 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-28 10:06:31,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {34120#true} call ULTIMATE.init(); {34120#true} is VALID [2022-04-28 10:06:31,113 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-28 10:06:31,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256905624] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:31,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:31,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:06:31,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:31,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779374880] [2022-04-28 10:06:31,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779374880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:31,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:31,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:31,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579785068] [2022-04-28 10:06:31,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:31,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-28 10:06:31,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:31,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-28 10:06:31,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:31,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:31,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:31,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:31,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:31,133 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-28 10:06:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:33,721 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-04-28 10:06:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:06:33,721 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-28 10:06:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:33,722 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-28 10:06:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 66 transitions. [2022-04-28 10:06:33,722 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-28 10:06:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 66 transitions. [2022-04-28 10:06:33,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 66 transitions. [2022-04-28 10:06:33,773 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-28 10:06:33,774 INFO L225 Difference]: With dead ends: 78 [2022-04-28 10:06:33,774 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 10:06:33,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=776, Invalid=3256, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:06:33,775 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:33,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 105 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:06:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 10:06:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2022-04-28 10:06:34,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:34,118 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-28 10:06:34,118 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-28 10:06:34,118 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-28 10:06:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:34,118 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-28 10:06:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-28 10:06:34,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:34,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:34,119 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-28 10:06:34,119 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-28 10:06:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:34,119 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-28 10:06:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-28 10:06:34,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:34,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:34,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:34,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:34,120 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-28 10:06:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-28 10:06:34,120 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-28 10:06:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:34,120 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-28 10:06:34,120 INFO L496 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-28 10:06:34,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-28 10:06:34,536 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-28 10:06:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 10:06:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:06:34,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:34,537 INFO L195 NwaCegarLoop]: trace histogram [12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:34,553 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-28 10:06:34,737 WARN L477 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-28 10:06:34,737 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:34,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1836251115, now seen corresponding path program 121 times [2022-04-28 10:06:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:34,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1881537615] [2022-04-28 10:06:34,740 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:34,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1836251115, now seen corresponding path program 122 times [2022-04-28 10:06:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:34,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477701596] [2022-04-28 10:06:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:34,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:35,016 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-28 10:06:35,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {34770#true} assume true; {34770#true} is VALID [2022-04-28 10:06:35,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34770#true} {34770#true} #50#return; {34770#true} is VALID [2022-04-28 10:06:35,016 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-28 10:06:35,016 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-28 10:06:35,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {34770#true} assume true; {34770#true} is VALID [2022-04-28 10:06:35,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34770#true} {34770#true} #50#return; {34770#true} is VALID [2022-04-28 10:06:35,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {34770#true} call #t~ret9 := main(); {34770#true} is VALID [2022-04-28 10:06:35,017 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-28 10:06:35,017 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-28 10:06:35,017 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-28 10:06:35,018 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-28 10:06:35,018 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-28 10:06:35,019 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-28 10:06:35,019 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-28 10:06:35,020 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-28 10:06:35,020 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-28 10:06:35,021 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-28 10:06:35,021 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-28 10:06:35,022 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-28 10:06:35,022 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-28 10:06:35,023 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-28 10:06:35,023 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-28 10:06:35,024 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-28 10:06:35,024 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-28 10:06:35,025 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-28 10:06:35,025 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-28 10:06:35,025 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-28 10:06:35,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {34771#false} ~cond := #in~cond; {34771#false} is VALID [2022-04-28 10:06:35,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {34771#false} assume 0 == ~cond; {34771#false} is VALID [2022-04-28 10:06:35,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {34771#false} assume !false; {34771#false} is VALID [2022-04-28 10:06:35,025 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-28 10:06:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:35,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477701596] [2022-04-28 10:06:35,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477701596] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:35,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230715806] [2022-04-28 10:06:35,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:35,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:35,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:35,027 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-28 10:06:35,027 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-28 10:06:35,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:35,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:35,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:06:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:35,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:35,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {34770#true} call ULTIMATE.init(); {34770#true} is VALID [2022-04-28 10:06:35,351 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-28 10:06:35,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {34770#true} assume true; {34770#true} is VALID [2022-04-28 10:06:35,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34770#true} {34770#true} #50#return; {34770#true} is VALID [2022-04-28 10:06:35,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {34770#true} call #t~ret9 := main(); {34770#true} is VALID [2022-04-28 10:06:35,352 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-28 10:06:35,352 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-28 10:06:35,353 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-28 10:06:35,353 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-28 10:06:35,354 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-28 10:06:35,355 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-28 10:06:35,355 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-28 10:06:35,356 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-28 10:06:35,357 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-28 10:06:35,357 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-28 10:06:35,358 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-28 10:06:35,358 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-28 10:06:35,359 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-28 10:06:35,360 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-28 10:06:35,360 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-28 10:06:35,361 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-28 10:06:35,361 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-28 10:06:35,362 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-28 10:06:35,362 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-28 10:06:35,362 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-28 10:06:35,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {34771#false} ~cond := #in~cond; {34771#false} is VALID [2022-04-28 10:06:35,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {34771#false} assume 0 == ~cond; {34771#false} is VALID [2022-04-28 10:06:35,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {34771#false} assume !false; {34771#false} is VALID [2022-04-28 10:06:35,363 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-28 10:06:35,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:35,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {34771#false} assume !false; {34771#false} is VALID [2022-04-28 10:06:35,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {34771#false} assume 0 == ~cond; {34771#false} is VALID [2022-04-28 10:06:35,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {34771#false} ~cond := #in~cond; {34771#false} is VALID [2022-04-28 10:06:35,922 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-28 10:06:35,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {34890#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34771#false} is VALID [2022-04-28 10:06:35,923 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-28 10:06:35,924 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-28 10:06:35,925 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-28 10:06:35,925 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-28 10:06:35,925 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-28 10:06:35,926 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-28 10:06:35,927 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-28 10:06:35,927 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-28 10:06:35,928 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-28 10:06:35,929 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-28 10:06:35,929 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-28 10:06:35,930 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-28 10:06:35,931 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-28 10:06:35,931 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-28 10:06:35,932 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-28 10:06:35,932 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-28 10:06:35,933 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-28 10:06:35,933 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-28 10:06:35,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {34770#true} call #t~ret9 := main(); {34770#true} is VALID [2022-04-28 10:06:35,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34770#true} {34770#true} #50#return; {34770#true} is VALID [2022-04-28 10:06:35,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {34770#true} assume true; {34770#true} is VALID [2022-04-28 10:06:35,934 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-28 10:06:35,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {34770#true} call ULTIMATE.init(); {34770#true} is VALID [2022-04-28 10:06:35,934 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-28 10:06:35,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230715806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:35,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:35,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:06:35,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:35,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1881537615] [2022-04-28 10:06:35,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1881537615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:35,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:35,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432041921] [2022-04-28 10:06:35,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:35,935 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-28 10:06:35,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:35,935 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-28 10:06:35,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:35,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:35,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:35,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:35,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:35,955 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-28 10:06:38,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:38,707 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2022-04-28 10:06:38,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:06:38,707 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-28 10:06:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:38,707 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-28 10:06:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2022-04-28 10:06:38,708 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-28 10:06:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2022-04-28 10:06:38,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 68 transitions. [2022-04-28 10:06:38,761 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-28 10:06:38,761 INFO L225 Difference]: With dead ends: 83 [2022-04-28 10:06:38,761 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 10:06:38,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=721, Invalid=2939, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:06:38,762 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:38,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 104 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:06:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 10:06:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 44. [2022-04-28 10:06:39,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:39,106 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-28 10:06:39,106 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-28 10:06:39,106 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-28 10:06:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:39,107 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-04-28 10:06:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-04-28 10:06:39,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:39,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:39,107 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-28 10:06:39,107 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-28 10:06:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:39,108 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-04-28 10:06:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-04-28 10:06:39,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:39,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:39,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:39,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:39,108 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-28 10:06:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-28 10:06:39,108 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-28 10:06:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:39,109 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-28 10:06:39,109 INFO L496 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-28 10:06:39,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-28 10:06:39,529 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-28 10:06:39,529 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 10:06:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:06:39,529 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:39,529 INFO L195 NwaCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:39,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-04-28 10:06:39,730 WARN L477 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-28 10:06:39,730 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:39,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:39,730 INFO L85 PathProgramCache]: Analyzing trace with hash 897625164, now seen corresponding path program 123 times [2022-04-28 10:06:39,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:39,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [200849943] [2022-04-28 10:06:39,732 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:39,732 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 897625164, now seen corresponding path program 124 times [2022-04-28 10:06:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:39,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314629868] [2022-04-28 10:06:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:40,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:40,029 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-28 10:06:40,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {35434#true} assume true; {35434#true} is VALID [2022-04-28 10:06:40,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35434#true} {35434#true} #50#return; {35434#true} is VALID [2022-04-28 10:06:40,029 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-28 10:06:40,029 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-28 10:06:40,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {35434#true} assume true; {35434#true} is VALID [2022-04-28 10:06:40,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35434#true} {35434#true} #50#return; {35434#true} is VALID [2022-04-28 10:06:40,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {35434#true} call #t~ret9 := main(); {35434#true} is VALID [2022-04-28 10:06:40,030 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-28 10:06:40,030 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-28 10:06:40,031 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-28 10:06:40,031 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-28 10:06:40,032 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-28 10:06:40,032 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-28 10:06:40,035 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-28 10:06:40,036 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-28 10:06:40,037 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-28 10:06:40,037 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-28 10:06:40,038 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-28 10:06:40,039 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-28 10:06:40,039 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-28 10:06:40,040 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-28 10:06:40,041 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-28 10:06:40,041 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-28 10:06:40,042 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-28 10:06:40,042 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-28 10:06:40,043 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-28 10:06:40,043 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-28 10:06:40,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {35435#false} ~cond := #in~cond; {35435#false} is VALID [2022-04-28 10:06:40,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {35435#false} assume 0 == ~cond; {35435#false} is VALID [2022-04-28 10:06:40,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {35435#false} assume !false; {35435#false} is VALID [2022-04-28 10:06:40,043 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-28 10:06:40,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:40,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314629868] [2022-04-28 10:06:40,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314629868] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:40,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591692264] [2022-04-28 10:06:40,044 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:40,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:40,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:40,048 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-28 10:06:40,049 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-28 10:06:40,091 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:40,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:40,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:06:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:40,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:40,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {35434#true} call ULTIMATE.init(); {35434#true} is VALID [2022-04-28 10:06:40,360 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-28 10:06:40,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {35434#true} assume true; {35434#true} is VALID [2022-04-28 10:06:40,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35434#true} {35434#true} #50#return; {35434#true} is VALID [2022-04-28 10:06:40,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {35434#true} call #t~ret9 := main(); {35434#true} is VALID [2022-04-28 10:06:40,360 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-28 10:06:40,361 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-28 10:06:40,361 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-28 10:06:40,362 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-28 10:06:40,362 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-28 10:06:40,363 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-28 10:06:40,363 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-28 10:06:40,364 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-28 10:06:40,364 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-28 10:06:40,365 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-28 10:06:40,365 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-28 10:06:40,366 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-28 10:06:40,366 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-28 10:06:40,367 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-28 10:06:40,367 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-28 10:06:40,368 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-28 10:06:40,368 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-28 10:06:40,369 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-28 10:06:40,369 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-28 10:06:40,369 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-28 10:06:40,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {35435#false} ~cond := #in~cond; {35435#false} is VALID [2022-04-28 10:06:40,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {35435#false} assume 0 == ~cond; {35435#false} is VALID [2022-04-28 10:06:40,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {35435#false} assume !false; {35435#false} is VALID [2022-04-28 10:06:40,369 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-28 10:06:40,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:40,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {35435#false} assume !false; {35435#false} is VALID [2022-04-28 10:06:40,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {35435#false} assume 0 == ~cond; {35435#false} is VALID [2022-04-28 10:06:40,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {35435#false} ~cond := #in~cond; {35435#false} is VALID [2022-04-28 10:06:40,858 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-28 10:06:40,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {35554#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35435#false} is VALID [2022-04-28 10:06:40,859 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-28 10:06:40,859 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-28 10:06:40,860 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-28 10:06:40,860 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-28 10:06:40,861 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-28 10:06:40,862 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-28 10:06:40,862 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-28 10:06:40,863 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-28 10:06:40,863 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-28 10:06:40,864 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-28 10:06:40,865 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-28 10:06:40,865 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-28 10:06:40,866 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-28 10:06:40,866 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-28 10:06:40,867 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-28 10:06:40,868 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-28 10:06:40,868 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-28 10:06:40,869 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-28 10:06:40,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {35434#true} call #t~ret9 := main(); {35434#true} is VALID [2022-04-28 10:06:40,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35434#true} {35434#true} #50#return; {35434#true} is VALID [2022-04-28 10:06:40,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {35434#true} assume true; {35434#true} is VALID [2022-04-28 10:06:40,869 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-28 10:06:40,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {35434#true} call ULTIMATE.init(); {35434#true} is VALID [2022-04-28 10:06:40,869 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-28 10:06:40,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591692264] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:40,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:40,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:06:40,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:40,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [200849943] [2022-04-28 10:06:40,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [200849943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:40,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:40,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956209252] [2022-04-28 10:06:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:40,870 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-28 10:06:40,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:40,870 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-28 10:06:40,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:40,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:40,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:40,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:40,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:40,889 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-28 10:06:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:43,736 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-28 10:06:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:06:43,736 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-28 10:06:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:43,736 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-28 10:06:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 70 transitions. [2022-04-28 10:06:43,737 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-28 10:06:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 70 transitions. [2022-04-28 10:06:43,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 70 transitions. [2022-04-28 10:06:43,792 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-28 10:06:43,793 INFO L225 Difference]: With dead ends: 87 [2022-04-28 10:06:43,793 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 10:06:43,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=674, Invalid=2632, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:06:43,793 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:43,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 119 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:06:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 10:06:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 44. [2022-04-28 10:06:44,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:44,188 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-28 10:06:44,188 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-28 10:06:44,188 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-28 10:06:44,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:44,189 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2022-04-28 10:06:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2022-04-28 10:06:44,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:44,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:44,189 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-28 10:06:44,189 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-28 10:06:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:44,190 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2022-04-28 10:06:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2022-04-28 10:06:44,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:44,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:44,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:44,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:44,191 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-28 10:06:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-28 10:06:44,191 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-28 10:06:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:44,192 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-28 10:06:44,192 INFO L496 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-28 10:06:44,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-28 10:06:44,633 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-28 10:06:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 10:06:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:06:44,633 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:44,633 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:44,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-04-28 10:06:44,834 WARN L477 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-28 10:06:44,834 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:44,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash 313157579, now seen corresponding path program 125 times [2022-04-28 10:06:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:44,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188710772] [2022-04-28 10:06:44,836 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:44,836 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash 313157579, now seen corresponding path program 126 times [2022-04-28 10:06:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:44,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609054946] [2022-04-28 10:06:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:45,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:45,109 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-28 10:06:45,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {36108#true} assume true; {36108#true} is VALID [2022-04-28 10:06:45,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36108#true} {36108#true} #50#return; {36108#true} is VALID [2022-04-28 10:06:45,110 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-28 10:06:45,110 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-28 10:06:45,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {36108#true} assume true; {36108#true} is VALID [2022-04-28 10:06:45,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36108#true} {36108#true} #50#return; {36108#true} is VALID [2022-04-28 10:06:45,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {36108#true} call #t~ret9 := main(); {36108#true} is VALID [2022-04-28 10:06:45,110 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-28 10:06:45,111 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-28 10:06:45,111 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-28 10:06:45,112 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-28 10:06:45,112 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-28 10:06:45,113 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-28 10:06:45,113 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-28 10:06:45,114 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-28 10:06:45,114 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-28 10:06:45,115 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-28 10:06:45,115 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-28 10:06:45,116 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-28 10:06:45,116 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-28 10:06:45,117 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-28 10:06:45,117 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-28 10:06:45,118 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-28 10:06:45,118 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-28 10:06:45,119 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-28 10:06:45,119 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-28 10:06:45,119 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-28 10:06:45,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {36109#false} ~cond := #in~cond; {36109#false} is VALID [2022-04-28 10:06:45,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {36109#false} assume 0 == ~cond; {36109#false} is VALID [2022-04-28 10:06:45,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {36109#false} assume !false; {36109#false} is VALID [2022-04-28 10:06:45,119 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-28 10:06:45,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:45,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609054946] [2022-04-28 10:06:45,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609054946] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:45,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908109828] [2022-04-28 10:06:45,120 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:45,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:45,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:45,121 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-28 10:06:45,121 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-28 10:06:45,203 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:06:45,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:45,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:06:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:45,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:45,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {36108#true} call ULTIMATE.init(); {36108#true} is VALID [2022-04-28 10:06:45,465 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-28 10:06:45,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {36108#true} assume true; {36108#true} is VALID [2022-04-28 10:06:45,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36108#true} {36108#true} #50#return; {36108#true} is VALID [2022-04-28 10:06:45,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {36108#true} call #t~ret9 := main(); {36108#true} is VALID [2022-04-28 10:06:45,466 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-28 10:06:45,466 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-28 10:06:45,467 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-28 10:06:45,467 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-28 10:06:45,468 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-28 10:06:45,468 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-28 10:06:45,469 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-28 10:06:45,469 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-28 10:06:45,470 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-28 10:06:45,470 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-28 10:06:45,471 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-28 10:06:45,471 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-28 10:06:45,472 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-28 10:06:45,472 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-28 10:06:45,473 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-28 10:06:45,473 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-28 10:06:45,473 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-28 10:06:45,474 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-28 10:06:45,474 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-28 10:06:45,474 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-28 10:06:45,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {36109#false} ~cond := #in~cond; {36109#false} is VALID [2022-04-28 10:06:45,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {36109#false} assume 0 == ~cond; {36109#false} is VALID [2022-04-28 10:06:45,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {36109#false} assume !false; {36109#false} is VALID [2022-04-28 10:06:45,475 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-28 10:06:45,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:45,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {36109#false} assume !false; {36109#false} is VALID [2022-04-28 10:06:45,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {36109#false} assume 0 == ~cond; {36109#false} is VALID [2022-04-28 10:06:45,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {36109#false} ~cond := #in~cond; {36109#false} is VALID [2022-04-28 10:06:45,964 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-28 10:06:45,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {36228#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36109#false} is VALID [2022-04-28 10:06:45,965 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-28 10:06:45,965 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-28 10:06:45,966 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-28 10:06:45,966 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-28 10:06:45,967 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-28 10:06:45,968 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-28 10:06:45,968 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-28 10:06:45,969 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-28 10:06:45,970 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-28 10:06:45,970 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-28 10:06:45,971 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-28 10:06:45,971 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-28 10:06:45,972 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-28 10:06:45,973 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-28 10:06:45,973 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-28 10:06:45,974 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-28 10:06:45,974 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-28 10:06:45,975 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-28 10:06:45,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {36108#true} call #t~ret9 := main(); {36108#true} is VALID [2022-04-28 10:06:45,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36108#true} {36108#true} #50#return; {36108#true} is VALID [2022-04-28 10:06:45,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {36108#true} assume true; {36108#true} is VALID [2022-04-28 10:06:45,975 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-28 10:06:45,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {36108#true} call ULTIMATE.init(); {36108#true} is VALID [2022-04-28 10:06:45,975 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-28 10:06:45,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908109828] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:45,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:45,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:06:45,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:45,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188710772] [2022-04-28 10:06:45,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188710772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:45,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:45,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991572115] [2022-04-28 10:06:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:45,979 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-28 10:06:45,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:45,979 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-28 10:06:45,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:45,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:45,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:45,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:45,999 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-28 10:06:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:48,978 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2022-04-28 10:06:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:06:48,979 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-28 10:06:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:48,979 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-28 10:06:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 73 transitions. [2022-04-28 10:06:48,979 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-28 10:06:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 73 transitions. [2022-04-28 10:06:48,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 73 transitions. [2022-04-28 10:06:49,043 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-28 10:06:49,044 INFO L225 Difference]: With dead ends: 90 [2022-04-28 10:06:49,044 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 10:06:49,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=658, Invalid=2422, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:06:49,044 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:49,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 124 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:06:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 10:06:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 44. [2022-04-28 10:06:49,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:49,376 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-28 10:06:49,376 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-28 10:06:49,377 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-28 10:06:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:49,377 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-04-28 10:06:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2022-04-28 10:06:49,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:49,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:49,378 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-28 10:06:49,378 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-28 10:06:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:49,378 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-04-28 10:06:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2022-04-28 10:06:49,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:49,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:49,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:49,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:49,379 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-28 10:06:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-28 10:06:49,379 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-28 10:06:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:49,379 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-28 10:06:49,379 INFO L496 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-28 10:06:49,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-28 10:06:49,797 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-28 10:06:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 10:06:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:06:49,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:49,798 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:49,814 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-28 10:06:49,998 WARN L477 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-28 10:06:49,998 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1783906196, now seen corresponding path program 29 times [2022-04-28 10:06:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:49,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [771945047] [2022-04-28 10:06:50,001 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:50,001 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:50,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1783906196, now seen corresponding path program 30 times [2022-04-28 10:06:50,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:50,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595772819] [2022-04-28 10:06:50,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:50,253 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-28 10:06:50,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {36790#true} assume true; {36790#true} is VALID [2022-04-28 10:06:50,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36790#true} {36790#true} #50#return; {36790#true} is VALID [2022-04-28 10:06:50,253 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-28 10:06:50,253 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-28 10:06:50,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {36790#true} assume true; {36790#true} is VALID [2022-04-28 10:06:50,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36790#true} {36790#true} #50#return; {36790#true} is VALID [2022-04-28 10:06:50,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {36790#true} call #t~ret9 := main(); {36790#true} is VALID [2022-04-28 10:06:50,254 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-28 10:06:50,254 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-28 10:06:50,254 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-28 10:06:50,255 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-28 10:06:50,255 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-28 10:06:50,256 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-28 10:06:50,256 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-28 10:06:50,257 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-28 10:06:50,257 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-28 10:06:50,258 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-28 10:06:50,258 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-28 10:06:50,259 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-28 10:06:50,259 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-28 10:06:50,260 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-28 10:06:50,260 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-28 10:06:50,261 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-28 10:06:50,261 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-28 10:06:50,262 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-28 10:06:50,262 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-28 10:06:50,262 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-28 10:06:50,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {36791#false} ~cond := #in~cond; {36791#false} is VALID [2022-04-28 10:06:50,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {36791#false} assume 0 == ~cond; {36791#false} is VALID [2022-04-28 10:06:50,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {36791#false} assume !false; {36791#false} is VALID [2022-04-28 10:06:50,262 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-28 10:06:50,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:50,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595772819] [2022-04-28 10:06:50,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595772819] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:50,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013891268] [2022-04-28 10:06:50,263 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:50,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:50,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:50,264 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-28 10:06:50,264 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-28 10:06:50,458 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:06:50,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:50,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:06:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:50,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:50,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {36790#true} call ULTIMATE.init(); {36790#true} is VALID [2022-04-28 10:06:50,751 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-28 10:06:50,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {36790#true} assume true; {36790#true} is VALID [2022-04-28 10:06:50,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36790#true} {36790#true} #50#return; {36790#true} is VALID [2022-04-28 10:06:50,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {36790#true} call #t~ret9 := main(); {36790#true} is VALID [2022-04-28 10:06:50,752 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-28 10:06:50,752 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-28 10:06:50,753 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-28 10:06:50,754 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-28 10:06:50,754 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-28 10:06:50,755 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-28 10:06:50,755 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-28 10:06:50,756 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-28 10:06:50,757 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-28 10:06:50,757 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-28 10:06:50,758 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-28 10:06:50,759 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-28 10:06:50,759 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-28 10:06:50,760 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-28 10:06:50,760 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-28 10:06:50,761 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-28 10:06:50,761 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-28 10:06:50,762 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-28 10:06:50,762 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-28 10:06:50,762 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-28 10:06:50,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {36791#false} ~cond := #in~cond; {36791#false} is VALID [2022-04-28 10:06:50,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {36791#false} assume 0 == ~cond; {36791#false} is VALID [2022-04-28 10:06:50,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {36791#false} assume !false; {36791#false} is VALID [2022-04-28 10:06:50,763 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-28 10:06:50,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:51,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {36791#false} assume !false; {36791#false} is VALID [2022-04-28 10:06:51,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {36791#false} assume 0 == ~cond; {36791#false} is VALID [2022-04-28 10:06:51,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {36791#false} ~cond := #in~cond; {36791#false} is VALID [2022-04-28 10:06:51,304 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-28 10:06:51,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {36910#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36791#false} is VALID [2022-04-28 10:06:51,305 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-28 10:06:51,305 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-28 10:06:51,305 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-28 10:06:51,306 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-28 10:06:51,307 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-28 10:06:51,307 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-28 10:06:51,308 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-28 10:06:51,309 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-28 10:06:51,309 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-28 10:06:51,310 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-28 10:06:51,310 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-28 10:06:51,311 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-28 10:06:51,312 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-28 10:06:51,312 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-28 10:06:51,313 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-28 10:06:51,313 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-28 10:06:51,314 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-28 10:06:51,314 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-28 10:06:51,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {36790#true} call #t~ret9 := main(); {36790#true} is VALID [2022-04-28 10:06:51,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36790#true} {36790#true} #50#return; {36790#true} is VALID [2022-04-28 10:06:51,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {36790#true} assume true; {36790#true} is VALID [2022-04-28 10:06:51,315 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-28 10:06:51,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {36790#true} call ULTIMATE.init(); {36790#true} is VALID [2022-04-28 10:06:51,315 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-28 10:06:51,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013891268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:51,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:51,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:06:51,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:51,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [771945047] [2022-04-28 10:06:51,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [771945047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:51,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:51,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:51,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426665600] [2022-04-28 10:06:51,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:51,316 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-28 10:06:51,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:51,316 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-28 10:06:51,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:51,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:51,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:51,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:51,333 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-28 10:06:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:54,455 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2022-04-28 10:06:54,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:06:54,455 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-28 10:06:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:54,455 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-28 10:06:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-04-28 10:06:54,456 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-28 10:06:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-04-28 10:06:54,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2022-04-28 10:06:54,516 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-28 10:06:54,517 INFO L225 Difference]: With dead ends: 95 [2022-04-28 10:06:54,517 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 10:06:54,517 INFO L412 NwaCegarLoop]: 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-28 10:06:54,517 INFO L413 NwaCegarLoop]: 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:54,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 127 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:06:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 10:06:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 46. [2022-04-28 10:06:54,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:54,859 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-28 10:06:54,859 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-28 10:06:54,859 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-28 10:06:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:54,860 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2022-04-28 10:06:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2022-04-28 10:06:54,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:54,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:54,860 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-28 10:06:54,860 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-28 10:06:54,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:54,861 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2022-04-28 10:06:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2022-04-28 10:06:54,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:54,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:54,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:54,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:54,861 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-28 10:06:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-04-28 10:06:54,862 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 28 [2022-04-28 10:06:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:54,862 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-04-28 10:06:54,862 INFO L496 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-28 10:06:54,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 55 transitions. [2022-04-28 10:06:55,306 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-28 10:06:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-28 10:06:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:06:55,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:55,307 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:55,310 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-28 10:06:55,507 WARN L477 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-28 10:06:55,507 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash -412950633, now seen corresponding path program 127 times [2022-04-28 10:06:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:55,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1436933407] [2022-04-28 10:06:55,509 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:55,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash -412950633, now seen corresponding path program 128 times [2022-04-28 10:06:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:55,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884074778] [2022-04-28 10:06:55,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:56,284 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-28 10:06:56,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {37494#true} assume true; {37494#true} is VALID [2022-04-28 10:06:56,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37494#true} {37494#true} #50#return; {37494#true} is VALID [2022-04-28 10:06:56,299 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-28 10:06:56,299 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-28 10:06:56,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {37494#true} assume true; {37494#true} is VALID [2022-04-28 10:06:56,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37494#true} {37494#true} #50#return; {37494#true} is VALID [2022-04-28 10:06:56,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {37494#true} call #t~ret9 := main(); {37494#true} is VALID [2022-04-28 10:06:56,300 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-28 10:06:56,301 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-28 10:06:56,302 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-28 10:06:56,304 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-28 10:06:56,305 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-28 10:06:56,306 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-28 10:06:56,307 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-28 10:06:56,308 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-28 10:06:56,310 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-28 10:06:56,311 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-28 10:06:56,312 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-28 10:06:56,313 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-28 10:06:56,315 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-28 10:06:56,316 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-28 10:06:56,318 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-28 10:06:56,320 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-28 10:06:56,321 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-28 10:06:56,323 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-28 10:06:56,324 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-28 10:06:56,325 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-28 10:06:56,326 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-28 10:06:56,326 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-28 10:06:56,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {37518#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37495#false} is VALID [2022-04-28 10:06:56,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {37495#false} assume !false; {37495#false} is VALID [2022-04-28 10:06:56,327 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-28 10:06:56,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:56,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884074778] [2022-04-28 10:06:56,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884074778] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:56,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697647711] [2022-04-28 10:06:56,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:56,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:56,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:56,332 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-28 10:06:56,345 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-28 10:06:56,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:56,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:56,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:06:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:56,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:56,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {37494#true} call ULTIMATE.init(); {37494#true} is VALID [2022-04-28 10:06:56,754 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-28 10:06:56,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {37494#true} assume true; {37494#true} is VALID [2022-04-28 10:06:56,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37494#true} {37494#true} #50#return; {37494#true} is VALID [2022-04-28 10:06:56,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {37494#true} call #t~ret9 := main(); {37494#true} is VALID [2022-04-28 10:06:56,754 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-28 10:06:56,755 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-28 10:06:56,755 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-28 10:06:56,756 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-28 10:06:56,756 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-28 10:06:56,757 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-28 10:06:56,757 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-28 10:06:56,758 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-28 10:06:56,758 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-28 10:06:56,759 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-28 10:06:56,759 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-28 10:06:56,759 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-28 10:06:56,760 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-28 10:06:56,760 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-28 10:06:56,761 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-28 10:06:56,762 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-28 10:06:56,762 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-28 10:06:56,763 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-28 10:06:56,763 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-28 10:06:56,763 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-28 10:06:56,764 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-28 10:06:56,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {37606#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:56,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {37610#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37495#false} is VALID [2022-04-28 10:06:56,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {37495#false} assume !false; {37495#false} is VALID [2022-04-28 10:06:56,765 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-28 10:06:56,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:57,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {37495#false} assume !false; {37495#false} is VALID [2022-04-28 10:06:57,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {37610#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37495#false} is VALID [2022-04-28 10:06:57,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {37606#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:57,267 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-28 10:06:57,267 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-28 10:06:57,268 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-28 10:06:57,269 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-28 10:06:57,269 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-28 10:06:57,270 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-28 10:06:57,271 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-28 10:06:57,272 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-28 10:06:57,273 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-28 10:06:57,273 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-28 10:06:57,274 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-28 10:06:57,274 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-28 10:06:57,275 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-28 10:06:57,275 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-28 10:06:57,276 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-28 10:06:57,277 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-28 10:06:57,278 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-28 10:06:57,279 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-28 10:06:57,280 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-28 10:06:57,280 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-28 10:06:57,281 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-28 10:06:57,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {37494#true} call #t~ret9 := main(); {37494#true} is VALID [2022-04-28 10:06:57,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37494#true} {37494#true} #50#return; {37494#true} is VALID [2022-04-28 10:06:57,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {37494#true} assume true; {37494#true} is VALID [2022-04-28 10:06:57,281 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-28 10:06:57,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {37494#true} call ULTIMATE.init(); {37494#true} is VALID [2022-04-28 10:06:57,281 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-28 10:06:57,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697647711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:57,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:57,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 42 [2022-04-28 10:06:57,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:57,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1436933407] [2022-04-28 10:06:57,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1436933407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:57,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:57,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:06:57,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253203483] [2022-04-28 10:06:57,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:57,282 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-28 10:06:57,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:57,282 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-28 10:06:57,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:57,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:06:57,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:57,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:06:57,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:06:57,333 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-28 10:06:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:59,590 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-28 10:06:59,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:06:59,590 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-28 10:06:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:59,590 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-28 10:06:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-28 10:06:59,595 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-28 10:06:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-28 10:06:59,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 40 transitions. [2022-04-28 10:06:59,649 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-28 10:06:59,649 INFO L225 Difference]: With dead ends: 59 [2022-04-28 10:06:59,649 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 10:06:59,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=262, Invalid=3398, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:06:59,650 INFO L413 NwaCegarLoop]: 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-28 10:06:59,650 INFO L414 NwaCegarLoop]: 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-28 10:06:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 10:07:00,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2022-04-28 10:07:00,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:00,046 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-28 10:07:00,046 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-28 10:07:00,046 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-28 10:07:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:00,047 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 10:07:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 10:07:00,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:00,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:00,047 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-28 10:07:00,047 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-28 10:07:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:00,047 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 10:07:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 10:07:00,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:00,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:00,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:00,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:00,048 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-28 10:07:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-28 10:07:00,048 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-28 10:07:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:00,048 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-28 10:07:00,048 INFO L496 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-28 10:07:00,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-28 10:07:00,693 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-28 10:07:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:00,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:00,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:00,693 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:00,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2022-04-28 10:07:00,894 WARN L477 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-28 10:07:00,894 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash -313802794, now seen corresponding path program 129 times [2022-04-28 10:07:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:00,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1173974631] [2022-04-28 10:07:00,897 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:00,897 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:00,897 INFO L85 PathProgramCache]: Analyzing trace with hash -313802794, now seen corresponding path program 130 times [2022-04-28 10:07:00,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:00,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169112458] [2022-04-28 10:07:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:00,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:01,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:01,195 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-28 10:07:01,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {38070#true} assume true; {38070#true} is VALID [2022-04-28 10:07:01,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38070#true} {38070#true} #50#return; {38070#true} is VALID [2022-04-28 10:07:01,196 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-28 10:07:01,196 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-28 10:07:01,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {38070#true} assume true; {38070#true} is VALID [2022-04-28 10:07:01,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38070#true} {38070#true} #50#return; {38070#true} is VALID [2022-04-28 10:07:01,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {38070#true} call #t~ret9 := main(); {38070#true} is VALID [2022-04-28 10:07:01,196 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-28 10:07:01,197 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-28 10:07:01,197 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-28 10:07:01,198 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-28 10:07:01,198 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-28 10:07:01,199 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-28 10:07:01,199 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-28 10:07:01,200 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-28 10:07:01,200 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-28 10:07:01,201 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-28 10:07:01,201 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-28 10:07:01,201 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-28 10:07:01,202 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-28 10:07:01,202 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-28 10:07:01,203 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-28 10:07:01,203 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-28 10:07:01,204 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-28 10:07:01,204 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-28 10:07:01,205 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-28 10:07:01,205 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-28 10:07:01,205 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-28 10:07:01,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {38071#false} ~cond := #in~cond; {38071#false} is VALID [2022-04-28 10:07:01,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {38071#false} assume 0 == ~cond; {38071#false} is VALID [2022-04-28 10:07:01,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {38071#false} assume !false; {38071#false} is VALID [2022-04-28 10:07:01,206 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-28 10:07:01,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:01,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169112458] [2022-04-28 10:07:01,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169112458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:01,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330790623] [2022-04-28 10:07:01,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:01,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:01,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:01,207 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-28 10:07:01,211 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-28 10:07:01,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:01,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:01,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:07:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:01,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:01,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {38070#true} call ULTIMATE.init(); {38070#true} is VALID [2022-04-28 10:07:01,561 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-28 10:07:01,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {38070#true} assume true; {38070#true} is VALID [2022-04-28 10:07:01,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38070#true} {38070#true} #50#return; {38070#true} is VALID [2022-04-28 10:07:01,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {38070#true} call #t~ret9 := main(); {38070#true} is VALID [2022-04-28 10:07:01,561 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-28 10:07:01,561 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-28 10:07:01,562 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-28 10:07:01,563 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-28 10:07:01,563 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-28 10:07:01,564 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-28 10:07:01,564 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-28 10:07:01,565 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-28 10:07:01,565 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-28 10:07:01,566 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-28 10:07:01,566 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-28 10:07:01,566 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-28 10:07:01,567 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-28 10:07:01,567 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-28 10:07:01,568 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-28 10:07:01,568 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-28 10:07:01,569 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-28 10:07:01,569 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-28 10:07:01,570 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-28 10:07:01,570 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-28 10:07:01,570 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-28 10:07:01,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {38071#false} ~cond := #in~cond; {38071#false} is VALID [2022-04-28 10:07:01,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {38071#false} assume 0 == ~cond; {38071#false} is VALID [2022-04-28 10:07:01,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {38071#false} assume !false; {38071#false} is VALID [2022-04-28 10:07:01,571 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-28 10:07:01,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:02,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {38071#false} assume !false; {38071#false} is VALID [2022-04-28 10:07:02,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {38071#false} assume 0 == ~cond; {38071#false} is VALID [2022-04-28 10:07:02,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {38071#false} ~cond := #in~cond; {38071#false} is VALID [2022-04-28 10:07:02,115 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-28 10:07:02,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {38194#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38071#false} is VALID [2022-04-28 10:07:02,116 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-28 10:07:02,117 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-28 10:07:02,118 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-28 10:07:02,119 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-28 10:07:02,120 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-28 10:07:02,120 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-28 10:07:02,121 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-28 10:07:02,121 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-28 10:07:02,121 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-28 10:07:02,122 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-28 10:07:02,123 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-28 10:07:02,123 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-28 10:07:02,124 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-28 10:07:02,125 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-28 10:07:02,125 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-28 10:07:02,126 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-28 10:07:02,127 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-28 10:07:02,127 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-28 10:07:02,128 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-28 10:07:02,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {38070#true} call #t~ret9 := main(); {38070#true} is VALID [2022-04-28 10:07:02,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38070#true} {38070#true} #50#return; {38070#true} is VALID [2022-04-28 10:07:02,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {38070#true} assume true; {38070#true} is VALID [2022-04-28 10:07:02,128 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-28 10:07:02,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {38070#true} call ULTIMATE.init(); {38070#true} is VALID [2022-04-28 10:07:02,128 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-28 10:07:02,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330790623] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:02,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:02,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:07:02,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:02,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1173974631] [2022-04-28 10:07:02,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1173974631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:02,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:02,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956934231] [2022-04-28 10:07:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:02,129 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-28 10:07:02,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:02,129 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-28 10:07:02,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:02,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:02,148 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-28 10:07:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:04,483 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-04-28 10:07:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:07:04,484 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-28 10:07:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:04,484 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-28 10:07:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 55 transitions. [2022-04-28 10:07:04,484 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-28 10:07:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 55 transitions. [2022-04-28 10:07:04,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 55 transitions. [2022-04-28 10:07:04,526 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-28 10:07:04,527 INFO L225 Difference]: With dead ends: 70 [2022-04-28 10:07:04,527 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 10:07:04,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=733, Invalid=3427, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 10:07:04,528 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:04,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:07:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 10:07:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2022-04-28 10:07:04,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:04,936 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-28 10:07:04,936 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-28 10:07:04,936 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-28 10:07:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:04,936 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 10:07:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 10:07:04,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:04,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:04,937 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-28 10:07:04,937 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-28 10:07:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:04,937 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 10:07:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 10:07:04,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:04,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:04,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:04,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:04,937 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-28 10:07:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-28 10:07:04,938 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-28 10:07:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:04,938 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-28 10:07:04,938 INFO L496 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-28 10:07:04,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-28 10:07:05,525 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-28 10:07:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:05,526 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:05,526 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:05,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2022-04-28 10:07:05,726 WARN L477 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-28 10:07:05,726 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash -726246473, now seen corresponding path program 131 times [2022-04-28 10:07:05,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:05,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1059471541] [2022-04-28 10:07:05,729 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:05,729 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash -726246473, now seen corresponding path program 132 times [2022-04-28 10:07:05,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:05,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146114438] [2022-04-28 10:07:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:05,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:06,024 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-28 10:07:06,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {38700#true} assume true; {38700#true} is VALID [2022-04-28 10:07:06,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38700#true} {38700#true} #50#return; {38700#true} is VALID [2022-04-28 10:07:06,024 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-28 10:07:06,024 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-28 10:07:06,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {38700#true} assume true; {38700#true} is VALID [2022-04-28 10:07:06,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38700#true} {38700#true} #50#return; {38700#true} is VALID [2022-04-28 10:07:06,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {38700#true} call #t~ret9 := main(); {38700#true} is VALID [2022-04-28 10:07:06,025 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-28 10:07:06,025 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-28 10:07:06,026 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-28 10:07:06,026 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-28 10:07:06,027 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-28 10:07:06,027 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-28 10:07:06,028 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-28 10:07:06,028 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-28 10:07:06,029 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-28 10:07:06,029 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-28 10:07:06,030 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-28 10:07:06,030 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-28 10:07:06,030 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-28 10:07:06,031 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-28 10:07:06,031 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-28 10:07:06,032 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-28 10:07:06,032 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-28 10:07:06,033 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-28 10:07:06,033 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-28 10:07:06,034 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-28 10:07:06,034 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-28 10:07:06,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {38701#false} ~cond := #in~cond; {38701#false} is VALID [2022-04-28 10:07:06,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {38701#false} assume 0 == ~cond; {38701#false} is VALID [2022-04-28 10:07:06,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {38701#false} assume !false; {38701#false} is VALID [2022-04-28 10:07:06,034 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-28 10:07:06,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:06,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146114438] [2022-04-28 10:07:06,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146114438] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:06,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977799992] [2022-04-28 10:07:06,034 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:06,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:06,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:06,035 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-28 10:07:06,036 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-28 10:07:06,101 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:07:06,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:06,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:07:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:06,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:06,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {38700#true} call ULTIMATE.init(); {38700#true} is VALID [2022-04-28 10:07:06,381 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-28 10:07:06,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {38700#true} assume true; {38700#true} is VALID [2022-04-28 10:07:06,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38700#true} {38700#true} #50#return; {38700#true} is VALID [2022-04-28 10:07:06,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {38700#true} call #t~ret9 := main(); {38700#true} is VALID [2022-04-28 10:07:06,381 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-28 10:07:06,382 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-28 10:07:06,382 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-28 10:07:06,383 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-28 10:07:06,383 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-28 10:07:06,384 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-28 10:07:06,384 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-28 10:07:06,385 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-28 10:07:06,385 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-28 10:07:06,386 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-28 10:07:06,386 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-28 10:07:06,387 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-28 10:07:06,387 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-28 10:07:06,387 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-28 10:07:06,388 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-28 10:07:06,388 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-28 10:07:06,389 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-28 10:07:06,389 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-28 10:07:06,390 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-28 10:07:06,390 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-28 10:07:06,390 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-28 10:07:06,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {38701#false} ~cond := #in~cond; {38701#false} is VALID [2022-04-28 10:07:06,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {38701#false} assume 0 == ~cond; {38701#false} is VALID [2022-04-28 10:07:06,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {38701#false} assume !false; {38701#false} is VALID [2022-04-28 10:07:06,391 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-28 10:07:06,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:06,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {38701#false} assume !false; {38701#false} is VALID [2022-04-28 10:07:06,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {38701#false} assume 0 == ~cond; {38701#false} is VALID [2022-04-28 10:07:06,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {38701#false} ~cond := #in~cond; {38701#false} is VALID [2022-04-28 10:07:06,913 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-28 10:07:06,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {38824#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38701#false} is VALID [2022-04-28 10:07:06,914 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-28 10:07:06,915 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-28 10:07:06,915 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-28 10:07:06,916 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-28 10:07:06,916 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-28 10:07:06,917 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-28 10:07:06,917 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-28 10:07:06,918 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-28 10:07:06,918 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-28 10:07:06,919 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-28 10:07:06,920 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-28 10:07:06,920 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-28 10:07:06,921 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-28 10:07:06,921 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-28 10:07:06,922 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-28 10:07:06,923 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-28 10:07:06,923 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-28 10:07:06,924 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-28 10:07:06,924 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-28 10:07:06,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {38700#true} call #t~ret9 := main(); {38700#true} is VALID [2022-04-28 10:07:06,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38700#true} {38700#true} #50#return; {38700#true} is VALID [2022-04-28 10:07:06,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {38700#true} assume true; {38700#true} is VALID [2022-04-28 10:07:06,925 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-28 10:07:06,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {38700#true} call ULTIMATE.init(); {38700#true} is VALID [2022-04-28 10:07:06,925 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-28 10:07:06,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977799992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:06,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:06,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:07:06,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:06,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1059471541] [2022-04-28 10:07:06,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1059471541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:06,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:06,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:06,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197495503] [2022-04-28 10:07:06,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:06,925 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-28 10:07:06,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:06,926 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-28 10:07:06,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:06,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:06,945 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-28 10:07:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:09,669 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-04-28 10:07:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:07:09,669 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-28 10:07:09,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:09,669 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-28 10:07:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. [2022-04-28 10:07:09,670 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-28 10:07:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. [2022-04-28 10:07:09,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 64 transitions. [2022-04-28 10:07:09,719 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-28 10:07:09,719 INFO L225 Difference]: With dead ends: 78 [2022-04-28 10:07:09,719 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 10:07:09,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=853, Invalid=3839, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 10:07:09,720 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:09,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 87 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:07:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 10:07:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 47. [2022-04-28 10:07:10,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:10,147 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-28 10:07:10,147 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-28 10:07:10,147 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-28 10:07:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:10,148 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-28 10:07:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-28 10:07:10,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:10,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:10,148 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-28 10:07:10,148 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-28 10:07:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:10,149 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-28 10:07:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-28 10:07:10,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:10,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:10,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:10,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:10,149 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-28 10:07:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-28 10:07:10,150 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-28 10:07:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:10,150 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-28 10:07:10,150 INFO L496 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-28 10:07:10,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-28 10:07:10,714 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-28 10:07:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:10,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:10,714 INFO L195 NwaCegarLoop]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:10,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-04-28 10:07:10,915 WARN L477 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-28 10:07:10,915 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1200111542, now seen corresponding path program 133 times [2022-04-28 10:07:10,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:10,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [689490936] [2022-04-28 10:07:10,918 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:10,918 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1200111542, now seen corresponding path program 134 times [2022-04-28 10:07:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:10,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256941485] [2022-04-28 10:07:10,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:11,197 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-28 10:07:11,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {39370#true} assume true; {39370#true} is VALID [2022-04-28 10:07:11,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39370#true} {39370#true} #50#return; {39370#true} is VALID [2022-04-28 10:07:11,198 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-28 10:07:11,198 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-28 10:07:11,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {39370#true} assume true; {39370#true} is VALID [2022-04-28 10:07:11,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39370#true} {39370#true} #50#return; {39370#true} is VALID [2022-04-28 10:07:11,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {39370#true} call #t~ret9 := main(); {39370#true} is VALID [2022-04-28 10:07:11,198 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-28 10:07:11,198 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-28 10:07:11,199 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-28 10:07:11,199 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-28 10:07:11,200 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-28 10:07:11,200 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-28 10:07:11,201 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-28 10:07:11,201 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-28 10:07:11,202 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-28 10:07:11,203 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-28 10:07:11,203 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-28 10:07:11,204 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-28 10:07:11,204 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-28 10:07:11,204 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-28 10:07:11,205 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-28 10:07:11,205 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-28 10:07:11,206 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-28 10:07:11,206 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-28 10:07:11,207 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-28 10:07:11,207 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-28 10:07:11,207 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-28 10:07:11,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {39371#false} ~cond := #in~cond; {39371#false} is VALID [2022-04-28 10:07:11,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {39371#false} assume 0 == ~cond; {39371#false} is VALID [2022-04-28 10:07:11,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {39371#false} assume !false; {39371#false} is VALID [2022-04-28 10:07:11,207 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-28 10:07:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:11,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256941485] [2022-04-28 10:07:11,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256941485] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:11,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902022102] [2022-04-28 10:07:11,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:11,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:11,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:11,209 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-28 10:07:11,209 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-28 10:07:11,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:11,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:11,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:07:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:11,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:11,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {39370#true} call ULTIMATE.init(); {39370#true} is VALID [2022-04-28 10:07:11,535 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-28 10:07:11,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {39370#true} assume true; {39370#true} is VALID [2022-04-28 10:07:11,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39370#true} {39370#true} #50#return; {39370#true} is VALID [2022-04-28 10:07:11,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {39370#true} call #t~ret9 := main(); {39370#true} is VALID [2022-04-28 10:07:11,536 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-28 10:07:11,536 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-28 10:07:11,537 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-28 10:07:11,537 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-28 10:07:11,538 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-28 10:07:11,539 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-28 10:07:11,539 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-28 10:07:11,540 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-28 10:07:11,541 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-28 10:07:11,541 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-28 10:07:11,542 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-28 10:07:11,543 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-28 10:07:11,543 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-28 10:07:11,543 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-28 10:07:11,544 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-28 10:07:11,545 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-28 10:07:11,545 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-28 10:07:11,546 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-28 10:07:11,547 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-28 10:07:11,547 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-28 10:07:11,547 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-28 10:07:11,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {39371#false} ~cond := #in~cond; {39371#false} is VALID [2022-04-28 10:07:11,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {39371#false} assume 0 == ~cond; {39371#false} is VALID [2022-04-28 10:07:11,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {39371#false} assume !false; {39371#false} is VALID [2022-04-28 10:07:11,548 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-28 10:07:11,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:12,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {39371#false} assume !false; {39371#false} is VALID [2022-04-28 10:07:12,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {39371#false} assume 0 == ~cond; {39371#false} is VALID [2022-04-28 10:07:12,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {39371#false} ~cond := #in~cond; {39371#false} is VALID [2022-04-28 10:07:12,128 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-28 10:07:12,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {39494#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {39371#false} is VALID [2022-04-28 10:07:12,129 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-28 10:07:12,129 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-28 10:07:12,130 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-28 10:07:12,131 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-28 10:07:12,132 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-28 10:07:12,132 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-28 10:07:12,133 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-28 10:07:12,133 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-28 10:07:12,134 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-28 10:07:12,135 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-28 10:07:12,135 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-28 10:07:12,136 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-28 10:07:12,137 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-28 10:07:12,137 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-28 10:07:12,138 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-28 10:07:12,138 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-28 10:07:12,139 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-28 10:07:12,140 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-28 10:07:12,140 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-28 10:07:12,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {39370#true} call #t~ret9 := main(); {39370#true} is VALID [2022-04-28 10:07:12,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39370#true} {39370#true} #50#return; {39370#true} is VALID [2022-04-28 10:07:12,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {39370#true} assume true; {39370#true} is VALID [2022-04-28 10:07:12,140 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-28 10:07:12,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {39370#true} call ULTIMATE.init(); {39370#true} is VALID [2022-04-28 10:07:12,141 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-28 10:07:12,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902022102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:12,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:12,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:07:12,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:12,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [689490936] [2022-04-28 10:07:12,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [689490936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:12,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:12,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:12,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872302161] [2022-04-28 10:07:12,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:12,141 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-28 10:07:12,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:12,141 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-28 10:07:12,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:12,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:12,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:12,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:12,161 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-28 10:07:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:15,269 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-04-28 10:07:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:07:15,269 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-28 10:07:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:15,269 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-28 10:07:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 70 transitions. [2022-04-28 10:07:15,270 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-28 10:07:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 70 transitions. [2022-04-28 10:07:15,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 70 transitions. [2022-04-28 10:07:15,325 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-28 10:07:15,326 INFO L225 Difference]: With dead ends: 85 [2022-04-28 10:07:15,326 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 10:07:15,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=909, Invalid=3921, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:07:15,326 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:15,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 100 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:07:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 10:07:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 47. [2022-04-28 10:07:15,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:15,743 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-28 10:07:15,743 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-28 10:07:15,743 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-28 10:07:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:15,744 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-28 10:07:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-04-28 10:07:15,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:15,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:15,744 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-28 10:07:15,744 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-28 10:07:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:15,744 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-28 10:07:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-04-28 10:07:15,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:15,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:15,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:15,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:15,745 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-28 10:07:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-28 10:07:15,745 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-28 10:07:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:15,745 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-28 10:07:15,745 INFO L496 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-28 10:07:15,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-28 10:07:16,321 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-28 10:07:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:16,321 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:16,321 INFO L195 NwaCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:16,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2022-04-28 10:07:16,522 WARN L477 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-28 10:07:16,522 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1123704791, now seen corresponding path program 135 times [2022-04-28 10:07:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:16,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342297294] [2022-04-28 10:07:16,525 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:16,525 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:16,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1123704791, now seen corresponding path program 136 times [2022-04-28 10:07:16,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:16,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952168392] [2022-04-28 10:07:16,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:16,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:16,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:16,868 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-28 10:07:16,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {40070#true} assume true; {40070#true} is VALID [2022-04-28 10:07:16,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40070#true} {40070#true} #50#return; {40070#true} is VALID [2022-04-28 10:07:16,868 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-28 10:07:16,869 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-28 10:07:16,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {40070#true} assume true; {40070#true} is VALID [2022-04-28 10:07:16,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40070#true} {40070#true} #50#return; {40070#true} is VALID [2022-04-28 10:07:16,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {40070#true} call #t~ret9 := main(); {40070#true} is VALID [2022-04-28 10:07:16,869 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-28 10:07:16,870 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-28 10:07:16,870 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-28 10:07:16,871 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-28 10:07:16,872 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-28 10:07:16,872 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-28 10:07:16,873 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-28 10:07:16,874 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-28 10:07:16,874 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-28 10:07:16,875 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-28 10:07:16,875 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-28 10:07:16,876 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-28 10:07:16,877 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-28 10:07:16,877 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-28 10:07:16,878 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-28 10:07:16,878 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-28 10:07:16,879 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-28 10:07:16,879 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-28 10:07:16,880 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-28 10:07:16,881 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-28 10:07:16,881 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-28 10:07:16,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {40071#false} ~cond := #in~cond; {40071#false} is VALID [2022-04-28 10:07:16,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {40071#false} assume 0 == ~cond; {40071#false} is VALID [2022-04-28 10:07:16,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {40071#false} assume !false; {40071#false} is VALID [2022-04-28 10:07:16,881 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-28 10:07:16,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:16,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952168392] [2022-04-28 10:07:16,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952168392] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:16,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23443532] [2022-04-28 10:07:16,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:16,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:16,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:16,883 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-28 10:07:16,906 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-28 10:07:16,933 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:16,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:16,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:07:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:16,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:17,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {40070#true} call ULTIMATE.init(); {40070#true} is VALID [2022-04-28 10:07:17,253 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-28 10:07:17,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {40070#true} assume true; {40070#true} is VALID [2022-04-28 10:07:17,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40070#true} {40070#true} #50#return; {40070#true} is VALID [2022-04-28 10:07:17,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {40070#true} call #t~ret9 := main(); {40070#true} is VALID [2022-04-28 10:07:17,254 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-28 10:07:17,254 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-28 10:07:17,255 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-28 10:07:17,255 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-28 10:07:17,256 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-28 10:07:17,256 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-28 10:07:17,257 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-28 10:07:17,257 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-28 10:07:17,258 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-28 10:07:17,258 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-28 10:07:17,259 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-28 10:07:17,259 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-28 10:07:17,260 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-28 10:07:17,260 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-28 10:07:17,261 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-28 10:07:17,261 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-28 10:07:17,262 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-28 10:07:17,262 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-28 10:07:17,263 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-28 10:07:17,263 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-28 10:07:17,263 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-28 10:07:17,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {40071#false} ~cond := #in~cond; {40071#false} is VALID [2022-04-28 10:07:17,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {40071#false} assume 0 == ~cond; {40071#false} is VALID [2022-04-28 10:07:17,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {40071#false} assume !false; {40071#false} is VALID [2022-04-28 10:07:17,263 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-28 10:07:17,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:17,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {40071#false} assume !false; {40071#false} is VALID [2022-04-28 10:07:17,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {40071#false} assume 0 == ~cond; {40071#false} is VALID [2022-04-28 10:07:17,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {40071#false} ~cond := #in~cond; {40071#false} is VALID [2022-04-28 10:07:17,791 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-28 10:07:17,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {40194#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40071#false} is VALID [2022-04-28 10:07:17,792 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-28 10:07:17,793 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-28 10:07:17,794 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-28 10:07:17,794 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-28 10:07:17,795 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-28 10:07:17,795 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-28 10:07:17,795 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-28 10:07:17,796 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-28 10:07:17,797 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-28 10:07:17,797 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-28 10:07:17,798 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-28 10:07:17,799 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-28 10:07:17,799 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-28 10:07:17,800 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-28 10:07:17,800 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-28 10:07:17,801 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-28 10:07:17,802 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-28 10:07:17,802 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-28 10:07:17,803 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-28 10:07:17,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {40070#true} call #t~ret9 := main(); {40070#true} is VALID [2022-04-28 10:07:17,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40070#true} {40070#true} #50#return; {40070#true} is VALID [2022-04-28 10:07:17,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {40070#true} assume true; {40070#true} is VALID [2022-04-28 10:07:17,803 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-28 10:07:17,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {40070#true} call ULTIMATE.init(); {40070#true} is VALID [2022-04-28 10:07:17,803 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-28 10:07:17,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23443532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:17,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:17,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:07:17,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:17,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342297294] [2022-04-28 10:07:17,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342297294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:17,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:17,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:17,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091596485] [2022-04-28 10:07:17,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:17,804 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-28 10:07:17,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:17,804 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-28 10:07:17,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:17,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:17,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:17,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:17,822 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-28 10:07:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:21,111 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2022-04-28 10:07:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:07:21,112 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-28 10:07:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:21,112 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-28 10:07:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 73 transitions. [2022-04-28 10:07:21,113 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-28 10:07:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 73 transitions. [2022-04-28 10:07:21,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 73 transitions. [2022-04-28 10:07:21,189 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-28 10:07:21,191 INFO L225 Difference]: With dead ends: 91 [2022-04-28 10:07:21,191 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 10:07:21,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=872, Invalid=3684, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:07:21,191 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:21,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 103 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:07:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 10:07:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 47. [2022-04-28 10:07:21,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:21,631 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-28 10:07:21,631 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-28 10:07:21,631 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-28 10:07:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:21,632 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-04-28 10:07:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-04-28 10:07:21,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:21,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:21,633 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-28 10:07:21,633 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-28 10:07:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:21,634 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-04-28 10:07:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-04-28 10:07:21,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:21,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:21,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:21,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:21,634 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-28 10:07:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-28 10:07:21,635 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-28 10:07:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:21,635 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-28 10:07:21,635 INFO L496 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-28 10:07:21,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-28 10:07:22,398 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-28 10:07:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:22,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:22,399 INFO L195 NwaCegarLoop]: trace histogram [13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:22,415 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-28 10:07:22,603 WARN L477 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-28 10:07:22,603 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2091071382, now seen corresponding path program 137 times [2022-04-28 10:07:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:22,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1976244954] [2022-04-28 10:07:22,606 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:22,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2091071382, now seen corresponding path program 138 times [2022-04-28 10:07:22,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:22,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900333424] [2022-04-28 10:07:22,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:22,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:22,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:22,890 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-28 10:07:22,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {40790#true} assume true; {40790#true} is VALID [2022-04-28 10:07:22,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40790#true} {40790#true} #50#return; {40790#true} is VALID [2022-04-28 10:07:22,892 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-28 10:07:22,892 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-28 10:07:22,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {40790#true} assume true; {40790#true} is VALID [2022-04-28 10:07:22,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40790#true} {40790#true} #50#return; {40790#true} is VALID [2022-04-28 10:07:22,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {40790#true} call #t~ret9 := main(); {40790#true} is VALID [2022-04-28 10:07:22,892 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-28 10:07:22,893 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-28 10:07:22,893 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-28 10:07:22,894 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-28 10:07:22,894 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-28 10:07:22,895 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-28 10:07:22,895 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-28 10:07:22,896 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-28 10:07:22,896 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-28 10:07:22,897 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-28 10:07:22,897 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-28 10:07:22,898 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-28 10:07:22,898 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-28 10:07:22,899 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-28 10:07:22,899 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-28 10:07:22,899 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-28 10:07:22,900 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-28 10:07:22,900 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-28 10:07:22,901 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-28 10:07:22,901 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-28 10:07:22,901 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-28 10:07:22,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {40791#false} ~cond := #in~cond; {40791#false} is VALID [2022-04-28 10:07:22,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {40791#false} assume 0 == ~cond; {40791#false} is VALID [2022-04-28 10:07:22,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {40791#false} assume !false; {40791#false} is VALID [2022-04-28 10:07:22,902 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-28 10:07:22,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:22,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900333424] [2022-04-28 10:07:22,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900333424] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:22,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58372696] [2022-04-28 10:07:22,902 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:22,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:22,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:22,903 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-28 10:07:22,904 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-28 10:07:23,032 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:07:23,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:23,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:07:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:23,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:23,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {40790#true} call ULTIMATE.init(); {40790#true} is VALID [2022-04-28 10:07:23,357 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-28 10:07:23,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {40790#true} assume true; {40790#true} is VALID [2022-04-28 10:07:23,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40790#true} {40790#true} #50#return; {40790#true} is VALID [2022-04-28 10:07:23,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {40790#true} call #t~ret9 := main(); {40790#true} is VALID [2022-04-28 10:07:23,358 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-28 10:07:23,358 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-28 10:07:23,359 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-28 10:07:23,360 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-28 10:07:23,360 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-28 10:07:23,361 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-28 10:07:23,362 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-28 10:07:23,362 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-28 10:07:23,363 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-28 10:07:23,364 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-28 10:07:23,364 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-28 10:07:23,365 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-28 10:07:23,366 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-28 10:07:23,366 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-28 10:07:23,367 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-28 10:07:23,367 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-28 10:07:23,368 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-28 10:07:23,369 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-28 10:07:23,369 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-28 10:07:23,370 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-28 10:07:23,370 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-28 10:07:23,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {40791#false} ~cond := #in~cond; {40791#false} is VALID [2022-04-28 10:07:23,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {40791#false} assume 0 == ~cond; {40791#false} is VALID [2022-04-28 10:07:23,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {40791#false} assume !false; {40791#false} is VALID [2022-04-28 10:07:23,370 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-28 10:07:23,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:23,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {40791#false} assume !false; {40791#false} is VALID [2022-04-28 10:07:23,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {40791#false} assume 0 == ~cond; {40791#false} is VALID [2022-04-28 10:07:23,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {40791#false} ~cond := #in~cond; {40791#false} is VALID [2022-04-28 10:07:23,955 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-28 10:07:23,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {40914#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40791#false} is VALID [2022-04-28 10:07:23,956 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-28 10:07:23,956 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-28 10:07:23,957 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-28 10:07:23,957 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-28 10:07:23,957 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-28 10:07:23,958 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-28 10:07:23,959 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-28 10:07:23,959 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-28 10:07:23,960 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-28 10:07:23,961 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-28 10:07:23,961 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-28 10:07:23,962 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-28 10:07:23,963 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-28 10:07:23,963 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-28 10:07:23,964 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-28 10:07:23,964 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-28 10:07:23,965 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-28 10:07:23,966 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-28 10:07:23,966 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-28 10:07:23,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {40790#true} call #t~ret9 := main(); {40790#true} is VALID [2022-04-28 10:07:23,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40790#true} {40790#true} #50#return; {40790#true} is VALID [2022-04-28 10:07:23,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {40790#true} assume true; {40790#true} is VALID [2022-04-28 10:07:23,966 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-28 10:07:23,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {40790#true} call ULTIMATE.init(); {40790#true} is VALID [2022-04-28 10:07:23,966 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-28 10:07:23,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58372696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:23,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:23,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:07:23,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:23,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1976244954] [2022-04-28 10:07:23,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1976244954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:23,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:23,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495980947] [2022-04-28 10:07:23,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:23,968 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-28 10:07:23,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:23,968 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-28 10:07:23,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:23,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:23,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:23,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:23,988 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-28 10:07:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:27,513 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-04-28 10:07:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:07:27,513 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-28 10:07:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:27,513 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-28 10:07:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 74 transitions. [2022-04-28 10:07:27,514 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-28 10:07:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 74 transitions. [2022-04-28 10:07:27,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 74 transitions. [2022-04-28 10:07:27,581 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-28 10:07:27,582 INFO L225 Difference]: With dead ends: 96 [2022-04-28 10:07:27,582 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 10:07:27,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=793, Invalid=3239, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:07:27,583 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:27,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 118 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:07:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 10:07:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 47. [2022-04-28 10:07:28,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:28,009 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-28 10:07:28,009 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-28 10:07:28,009 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-28 10:07:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:28,010 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-04-28 10:07:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2022-04-28 10:07:28,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:28,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:28,010 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-28 10:07:28,010 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-28 10:07:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:28,011 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-04-28 10:07:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2022-04-28 10:07:28,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:28,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:28,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:28,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:28,011 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-28 10:07:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-28 10:07:28,012 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-28 10:07:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:28,012 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-28 10:07:28,012 INFO L496 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-28 10:07:28,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-28 10:07:28,618 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-28 10:07:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:28,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:28,619 INFO L195 NwaCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:28,623 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-28 10:07:28,819 WARN L477 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-28 10:07:28,819 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:28,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:28,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1152445431, now seen corresponding path program 139 times [2022-04-28 10:07:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:28,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1007529897] [2022-04-28 10:07:28,822 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:28,822 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1152445431, now seen corresponding path program 140 times [2022-04-28 10:07:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:28,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213470789] [2022-04-28 10:07:28,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:28,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:29,165 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-28 10:07:29,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {41522#true} assume true; {41522#true} is VALID [2022-04-28 10:07:29,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41522#true} {41522#true} #50#return; {41522#true} is VALID [2022-04-28 10:07:29,166 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-28 10:07:29,166 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-28 10:07:29,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {41522#true} assume true; {41522#true} is VALID [2022-04-28 10:07:29,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41522#true} {41522#true} #50#return; {41522#true} is VALID [2022-04-28 10:07:29,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {41522#true} call #t~ret9 := main(); {41522#true} is VALID [2022-04-28 10:07:29,167 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-28 10:07:29,167 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-28 10:07:29,168 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-28 10:07:29,168 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-28 10:07:29,169 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-28 10:07:29,170 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-28 10:07:29,170 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-28 10:07:29,171 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-28 10:07:29,171 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-28 10:07:29,172 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-28 10:07:29,173 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-28 10:07:29,173 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-28 10:07:29,174 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-28 10:07:29,175 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-28 10:07:29,175 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-28 10:07:29,176 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-28 10:07:29,176 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-28 10:07:29,177 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-28 10:07:29,178 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-28 10:07:29,178 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-28 10:07:29,178 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-28 10:07:29,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {41523#false} ~cond := #in~cond; {41523#false} is VALID [2022-04-28 10:07:29,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {41523#false} assume 0 == ~cond; {41523#false} is VALID [2022-04-28 10:07:29,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {41523#false} assume !false; {41523#false} is VALID [2022-04-28 10:07:29,179 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-28 10:07:29,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:29,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213470789] [2022-04-28 10:07:29,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213470789] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:29,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406515546] [2022-04-28 10:07:29,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:29,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:29,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:29,182 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-28 10:07:29,184 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-28 10:07:29,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:29,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:29,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:07:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:29,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:29,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {41522#true} call ULTIMATE.init(); {41522#true} is VALID [2022-04-28 10:07:29,596 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-28 10:07:29,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {41522#true} assume true; {41522#true} is VALID [2022-04-28 10:07:29,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41522#true} {41522#true} #50#return; {41522#true} is VALID [2022-04-28 10:07:29,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {41522#true} call #t~ret9 := main(); {41522#true} is VALID [2022-04-28 10:07:29,596 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-28 10:07:29,597 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-28 10:07:29,597 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-28 10:07:29,598 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-28 10:07:29,598 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-28 10:07:29,599 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-28 10:07:29,600 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-28 10:07:29,600 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-28 10:07:29,601 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-28 10:07:29,601 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-28 10:07:29,602 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-28 10:07:29,602 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-28 10:07:29,603 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-28 10:07:29,603 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-28 10:07:29,604 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-28 10:07:29,604 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-28 10:07:29,604 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-28 10:07:29,605 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-28 10:07:29,605 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-28 10:07:29,606 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-28 10:07:29,606 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-28 10:07:29,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {41523#false} ~cond := #in~cond; {41523#false} is VALID [2022-04-28 10:07:29,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {41523#false} assume 0 == ~cond; {41523#false} is VALID [2022-04-28 10:07:29,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {41523#false} assume !false; {41523#false} is VALID [2022-04-28 10:07:29,606 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-28 10:07:29,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:30,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {41523#false} assume !false; {41523#false} is VALID [2022-04-28 10:07:30,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {41523#false} assume 0 == ~cond; {41523#false} is VALID [2022-04-28 10:07:30,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {41523#false} ~cond := #in~cond; {41523#false} is VALID [2022-04-28 10:07:30,160 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-28 10:07:30,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {41646#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {41523#false} is VALID [2022-04-28 10:07:30,161 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-28 10:07:30,162 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-28 10:07:30,162 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-28 10:07:30,163 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-28 10:07:30,163 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-28 10:07:30,164 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-28 10:07:30,165 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-28 10:07:30,165 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-28 10:07:30,166 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-28 10:07:30,166 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-28 10:07:30,167 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-28 10:07:30,168 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-28 10:07:30,168 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-28 10:07:30,169 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-28 10:07:30,170 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-28 10:07:30,170 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-28 10:07:30,171 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-28 10:07:30,171 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-28 10:07:30,172 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-28 10:07:30,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {41522#true} call #t~ret9 := main(); {41522#true} is VALID [2022-04-28 10:07:30,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41522#true} {41522#true} #50#return; {41522#true} is VALID [2022-04-28 10:07:30,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {41522#true} assume true; {41522#true} is VALID [2022-04-28 10:07:30,172 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-28 10:07:30,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {41522#true} call ULTIMATE.init(); {41522#true} is VALID [2022-04-28 10:07:30,172 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-28 10:07:30,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406515546] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:30,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:30,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:07:30,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:30,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1007529897] [2022-04-28 10:07:30,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1007529897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:30,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:30,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124298679] [2022-04-28 10:07:30,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:30,173 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-28 10:07:30,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:30,173 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-28 10:07:30,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:30,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:30,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:30,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:30,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1246, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:30,192 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-28 10:07:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:33,870 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-04-28 10:07:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:07:33,870 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-28 10:07:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:33,871 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-28 10:07:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2022-04-28 10:07:33,871 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-28 10:07:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2022-04-28 10:07:33,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 76 transitions. [2022-04-28 10:07:33,931 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-28 10:07:33,932 INFO L225 Difference]: With dead ends: 100 [2022-04-28 10:07:33,932 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 10:07:33,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=746, Invalid=2914, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:07:33,932 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:33,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 128 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:07:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 10:07:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 47. [2022-04-28 10:07:34,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:34,354 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-28 10:07:34,354 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-28 10:07:34,354 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-28 10:07:34,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:34,355 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-04-28 10:07:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-28 10:07:34,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:34,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:34,355 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-28 10:07:34,355 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-28 10:07:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:34,356 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-04-28 10:07:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-28 10:07:34,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:34,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:34,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:34,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:34,357 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-28 10:07:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-28 10:07:34,357 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-28 10:07:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:34,357 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-28 10:07:34,357 INFO L496 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-28 10:07:34,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-28 10:07:35,013 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-28 10:07:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:35,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:35,013 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:35,029 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-28 10:07:35,213 WARN L477 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-28 10:07:35,214 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:35,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash 567977846, now seen corresponding path program 141 times [2022-04-28 10:07:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:35,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [515923957] [2022-04-28 10:07:35,217 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:35,217 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:35,217 INFO L85 PathProgramCache]: Analyzing trace with hash 567977846, now seen corresponding path program 142 times [2022-04-28 10:07:35,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:35,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365569479] [2022-04-28 10:07:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:35,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:35,500 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-28 10:07:35,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {42264#true} assume true; {42264#true} is VALID [2022-04-28 10:07:35,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42264#true} {42264#true} #50#return; {42264#true} is VALID [2022-04-28 10:07:35,501 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-28 10:07:35,501 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-28 10:07:35,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {42264#true} assume true; {42264#true} is VALID [2022-04-28 10:07:35,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42264#true} {42264#true} #50#return; {42264#true} is VALID [2022-04-28 10:07:35,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {42264#true} call #t~ret9 := main(); {42264#true} is VALID [2022-04-28 10:07:35,501 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-28 10:07:35,502 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-28 10:07:35,502 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-28 10:07:35,503 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-28 10:07:35,504 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-28 10:07:35,504 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-28 10:07:35,505 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-28 10:07:35,506 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-28 10:07:35,506 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-28 10:07:35,507 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-28 10:07:35,508 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-28 10:07:35,508 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-28 10:07:35,509 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-28 10:07:35,510 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-28 10:07:35,510 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-28 10:07:35,511 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-28 10:07:35,511 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-28 10:07:35,512 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-28 10:07:35,513 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-28 10:07:35,513 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-28 10:07:35,513 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-28 10:07:35,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {42265#false} ~cond := #in~cond; {42265#false} is VALID [2022-04-28 10:07:35,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {42265#false} assume 0 == ~cond; {42265#false} is VALID [2022-04-28 10:07:35,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {42265#false} assume !false; {42265#false} is VALID [2022-04-28 10:07:35,514 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-28 10:07:35,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:35,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365569479] [2022-04-28 10:07:35,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365569479] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:35,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197922096] [2022-04-28 10:07:35,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:35,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:35,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:35,515 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-28 10:07:35,524 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-28 10:07:35,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:35,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:35,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:07:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:35,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:35,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {42264#true} call ULTIMATE.init(); {42264#true} is VALID [2022-04-28 10:07:35,857 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-28 10:07:35,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {42264#true} assume true; {42264#true} is VALID [2022-04-28 10:07:35,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42264#true} {42264#true} #50#return; {42264#true} is VALID [2022-04-28 10:07:35,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {42264#true} call #t~ret9 := main(); {42264#true} is VALID [2022-04-28 10:07:35,857 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-28 10:07:35,858 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-28 10:07:35,858 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-28 10:07:35,859 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-28 10:07:35,859 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-28 10:07:35,860 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-28 10:07:35,860 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-28 10:07:35,861 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-28 10:07:35,861 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-28 10:07:35,862 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-28 10:07:35,862 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-28 10:07:35,863 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-28 10:07:35,863 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-28 10:07:35,864 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-28 10:07:35,864 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-28 10:07:35,865 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-28 10:07:35,865 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-28 10:07:35,866 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-28 10:07:35,866 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-28 10:07:35,867 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-28 10:07:35,867 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-28 10:07:35,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {42265#false} ~cond := #in~cond; {42265#false} is VALID [2022-04-28 10:07:35,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {42265#false} assume 0 == ~cond; {42265#false} is VALID [2022-04-28 10:07:35,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {42265#false} assume !false; {42265#false} is VALID [2022-04-28 10:07:35,867 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-28 10:07:35,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:36,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {42265#false} assume !false; {42265#false} is VALID [2022-04-28 10:07:36,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {42265#false} assume 0 == ~cond; {42265#false} is VALID [2022-04-28 10:07:36,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {42265#false} ~cond := #in~cond; {42265#false} is VALID [2022-04-28 10:07:36,425 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-28 10:07:36,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {42388#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {42265#false} is VALID [2022-04-28 10:07:36,426 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-28 10:07:36,426 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-28 10:07:36,426 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-28 10:07:36,427 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-28 10:07:36,428 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-28 10:07:36,428 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-28 10:07:36,429 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-28 10:07:36,429 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-28 10:07:36,430 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-28 10:07:36,431 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-28 10:07:36,431 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-28 10:07:36,432 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-28 10:07:36,433 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-28 10:07:36,433 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-28 10:07:36,434 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-28 10:07:36,435 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-28 10:07:36,435 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-28 10:07:36,436 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-28 10:07:36,436 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-28 10:07:36,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {42264#true} call #t~ret9 := main(); {42264#true} is VALID [2022-04-28 10:07:36,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42264#true} {42264#true} #50#return; {42264#true} is VALID [2022-04-28 10:07:36,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {42264#true} assume true; {42264#true} is VALID [2022-04-28 10:07:36,436 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-28 10:07:36,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {42264#true} call ULTIMATE.init(); {42264#true} is VALID [2022-04-28 10:07:36,437 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-28 10:07:36,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197922096] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:36,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:36,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:07:36,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [515923957] [2022-04-28 10:07:36,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [515923957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:36,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:36,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993377381] [2022-04-28 10:07:36,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:36,437 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-28 10:07:36,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:36,437 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-28 10:07:36,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:36,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:36,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:36,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:36,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:36,456 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-28 10:07:40,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:40,289 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2022-04-28 10:07:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:07:40,289 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-28 10:07:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:40,289 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-28 10:07:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2022-04-28 10:07:40,290 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-28 10:07:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2022-04-28 10:07:40,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 79 transitions. [2022-04-28 10:07:40,355 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-28 10:07:40,356 INFO L225 Difference]: With dead ends: 103 [2022-04-28 10:07:40,356 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 10:07:40,357 INFO L412 NwaCegarLoop]: 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-28 10:07:40,357 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:40,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 128 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:07:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 10:07:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 47. [2022-04-28 10:07:40,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:40,806 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-28 10:07:40,806 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-28 10:07:40,806 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-28 10:07:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:40,807 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-04-28 10:07:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-04-28 10:07:40,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:40,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:40,808 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-28 10:07:40,808 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-28 10:07:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:40,809 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-04-28 10:07:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-04-28 10:07:40,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:40,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:40,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:40,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:40,810 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-28 10:07:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-28 10:07:40,810 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-28 10:07:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:40,810 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-28 10:07:40,810 INFO L496 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-28 10:07:40,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-28 10:07:41,482 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-28 10:07:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:41,482 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:41,482 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:41,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-04-28 10:07:41,682 WARN L477 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-28 10:07:41,683 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:41,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1529085929, now seen corresponding path program 31 times [2022-04-28 10:07:41,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:41,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219317856] [2022-04-28 10:07:41,685 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:41,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1529085929, now seen corresponding path program 32 times [2022-04-28 10:07:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:41,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939929872] [2022-04-28 10:07:41,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:42,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:42,011 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-28 10:07:42,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {43014#true} assume true; {43014#true} is VALID [2022-04-28 10:07:42,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43014#true} {43014#true} #50#return; {43014#true} is VALID [2022-04-28 10:07:42,012 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-28 10:07:42,012 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-28 10:07:42,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {43014#true} assume true; {43014#true} is VALID [2022-04-28 10:07:42,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43014#true} {43014#true} #50#return; {43014#true} is VALID [2022-04-28 10:07:42,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {43014#true} call #t~ret9 := main(); {43014#true} is VALID [2022-04-28 10:07:42,012 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-28 10:07:42,013 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-28 10:07:42,013 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-28 10:07:42,014 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-28 10:07:42,014 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-28 10:07:42,015 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-28 10:07:42,015 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-28 10:07:42,016 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-28 10:07:42,016 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-28 10:07:42,017 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-28 10:07:42,017 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-28 10:07:42,018 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-28 10:07:42,018 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-28 10:07:42,019 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-28 10:07:42,019 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-28 10:07:42,020 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-28 10:07:42,020 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-28 10:07:42,021 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-28 10:07:42,021 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-28 10:07:42,021 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-28 10:07:42,022 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-28 10:07:42,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {43015#false} ~cond := #in~cond; {43015#false} is VALID [2022-04-28 10:07:42,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {43015#false} assume 0 == ~cond; {43015#false} is VALID [2022-04-28 10:07:42,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {43015#false} assume !false; {43015#false} is VALID [2022-04-28 10:07:42,022 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-28 10:07:42,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:42,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939929872] [2022-04-28 10:07:42,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939929872] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:42,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130746163] [2022-04-28 10:07:42,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:42,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:42,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:42,023 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-28 10:07:42,024 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-28 10:07:42,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:42,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:42,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:07:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:42,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:42,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {43014#true} call ULTIMATE.init(); {43014#true} is VALID [2022-04-28 10:07:42,343 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-28 10:07:42,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {43014#true} assume true; {43014#true} is VALID [2022-04-28 10:07:42,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43014#true} {43014#true} #50#return; {43014#true} is VALID [2022-04-28 10:07:42,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {43014#true} call #t~ret9 := main(); {43014#true} is VALID [2022-04-28 10:07:42,343 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-28 10:07:42,344 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-28 10:07:42,344 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-28 10:07:42,345 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-28 10:07:42,345 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-28 10:07:42,346 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-28 10:07:42,346 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-28 10:07:42,347 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-28 10:07:42,347 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-28 10:07:42,348 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-28 10:07:42,348 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-28 10:07:42,349 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-28 10:07:42,349 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-28 10:07:42,350 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-28 10:07:42,350 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-28 10:07:42,351 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-28 10:07:42,351 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-28 10:07:42,351 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-28 10:07:42,352 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-28 10:07:42,352 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-28 10:07:42,352 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-28 10:07:42,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {43015#false} ~cond := #in~cond; {43015#false} is VALID [2022-04-28 10:07:42,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {43015#false} assume 0 == ~cond; {43015#false} is VALID [2022-04-28 10:07:42,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {43015#false} assume !false; {43015#false} is VALID [2022-04-28 10:07:42,353 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-28 10:07:42,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:42,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {43015#false} assume !false; {43015#false} is VALID [2022-04-28 10:07:42,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {43015#false} assume 0 == ~cond; {43015#false} is VALID [2022-04-28 10:07:42,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {43015#false} ~cond := #in~cond; {43015#false} is VALID [2022-04-28 10:07:42,923 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-28 10:07:42,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {43138#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43015#false} is VALID [2022-04-28 10:07:42,923 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-28 10:07:42,923 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-28 10:07:42,924 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-28 10:07:42,925 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-28 10:07:42,925 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-28 10:07:42,926 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-28 10:07:42,927 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-28 10:07:42,927 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-28 10:07:42,928 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-28 10:07:42,929 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-28 10:07:42,929 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-28 10:07:42,930 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-28 10:07:42,930 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-28 10:07:42,931 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-28 10:07:42,932 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-28 10:07:42,932 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-28 10:07:42,933 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-28 10:07:42,934 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-28 10:07:42,934 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-28 10:07:42,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {43014#true} call #t~ret9 := main(); {43014#true} is VALID [2022-04-28 10:07:42,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43014#true} {43014#true} #50#return; {43014#true} is VALID [2022-04-28 10:07:42,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {43014#true} assume true; {43014#true} is VALID [2022-04-28 10:07:42,934 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-28 10:07:42,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {43014#true} call ULTIMATE.init(); {43014#true} is VALID [2022-04-28 10:07:42,934 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-28 10:07:42,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130746163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:42,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:42,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:07:42,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:42,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219317856] [2022-04-28 10:07:42,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219317856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:42,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:42,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144733516] [2022-04-28 10:07:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:42,935 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-28 10:07:42,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:42,935 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-28 10:07:42,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:42,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:42,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:42,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:42,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:42,954 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-28 10:07:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:46,961 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-28 10:07:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:07:46,961 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-28 10:07:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:46,961 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-28 10:07:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 83 transitions. [2022-04-28 10:07:46,963 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-28 10:07:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 83 transitions. [2022-04-28 10:07:46,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 83 transitions. [2022-04-28 10:07:47,032 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-28 10:07:47,033 INFO L225 Difference]: With dead ends: 108 [2022-04-28 10:07:47,033 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 10:07:47,034 INFO L412 NwaCegarLoop]: 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-28 10:07:47,034 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 80 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:47,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 136 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:07:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 10:07:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 49. [2022-04-28 10:07:47,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:47,472 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-28 10:07:47,472 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-28 10:07:47,472 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-28 10:07:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:47,473 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-28 10:07:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-28 10:07:47,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:47,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:47,473 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-28 10:07:47,473 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-28 10:07:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:47,474 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-28 10:07:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-28 10:07:47,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:47,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:47,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:47,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:47,474 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-28 10:07:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-04-28 10:07:47,475 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 29 [2022-04-28 10:07:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:47,475 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-04-28 10:07:47,475 INFO L496 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-28 10:07:47,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 59 transitions. [2022-04-28 10:07:48,079 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-28 10:07:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-28 10:07:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:07:48,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:48,079 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:48,095 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-28 10:07:48,280 WARN L477 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-28 10:07:48,280 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:48,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:48,280 INFO L85 PathProgramCache]: Analyzing trace with hash 117927339, now seen corresponding path program 143 times [2022-04-28 10:07:48,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:48,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257234827] [2022-04-28 10:07:48,282 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:48,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:48,282 INFO L85 PathProgramCache]: Analyzing trace with hash 117927339, now seen corresponding path program 144 times [2022-04-28 10:07:48,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:48,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361148098] [2022-04-28 10:07:48,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:48,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:48,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:48,568 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-28 10:07:48,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {43786#true} assume true; {43786#true} is VALID [2022-04-28 10:07:48,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43786#true} {43786#true} #50#return; {43786#true} is VALID [2022-04-28 10:07:48,569 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-28 10:07:48,569 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-28 10:07:48,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {43786#true} assume true; {43786#true} is VALID [2022-04-28 10:07:48,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43786#true} {43786#true} #50#return; {43786#true} is VALID [2022-04-28 10:07:48,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {43786#true} call #t~ret9 := main(); {43786#true} is VALID [2022-04-28 10:07:48,569 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-28 10:07:48,570 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-28 10:07:48,570 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-28 10:07:48,571 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-28 10:07:48,571 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-28 10:07:48,572 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-28 10:07:48,572 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-28 10:07:48,573 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-28 10:07:48,573 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-28 10:07:48,574 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-28 10:07:48,574 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-28 10:07:48,574 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-28 10:07:48,575 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-28 10:07:48,575 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-28 10:07:48,576 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-28 10:07:48,576 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-28 10:07:48,577 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-28 10:07:48,577 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-28 10:07:48,578 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-28 10:07:48,578 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-28 10:07:48,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {43787#false} assume !(~z~0 % 4294967296 > 0); {43787#false} is VALID [2022-04-28 10:07:48,579 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-28 10:07:48,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {43787#false} ~cond := #in~cond; {43787#false} is VALID [2022-04-28 10:07:48,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {43787#false} assume 0 == ~cond; {43787#false} is VALID [2022-04-28 10:07:48,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {43787#false} assume !false; {43787#false} is VALID [2022-04-28 10:07:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:48,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361148098] [2022-04-28 10:07:48,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361148098] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:48,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590802183] [2022-04-28 10:07:48,579 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:48,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:48,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:48,580 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-28 10:07:48,581 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-28 10:07:48,658 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:07:48,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:48,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:07:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:48,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:48,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {43786#true} call ULTIMATE.init(); {43786#true} is VALID [2022-04-28 10:07:48,939 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-28 10:07:48,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {43786#true} assume true; {43786#true} is VALID [2022-04-28 10:07:48,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43786#true} {43786#true} #50#return; {43786#true} is VALID [2022-04-28 10:07:48,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {43786#true} call #t~ret9 := main(); {43786#true} is VALID [2022-04-28 10:07:48,939 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-28 10:07:48,940 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-28 10:07:48,940 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-28 10:07:48,941 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-28 10:07:48,941 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-28 10:07:48,942 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-28 10:07:48,942 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-28 10:07:48,943 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-28 10:07:48,943 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-28 10:07:48,944 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-28 10:07:48,944 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-28 10:07:48,945 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-28 10:07:48,945 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-28 10:07:48,946 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-28 10:07:48,946 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-28 10:07:48,947 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-28 10:07:48,947 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-28 10:07:48,948 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-28 10:07:48,948 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-28 10:07:48,949 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-28 10:07:48,949 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-28 10:07:48,949 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-28 10:07:48,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {43787#false} ~cond := #in~cond; {43787#false} is VALID [2022-04-28 10:07:48,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {43787#false} assume 0 == ~cond; {43787#false} is VALID [2022-04-28 10:07:48,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {43787#false} assume !false; {43787#false} is VALID [2022-04-28 10:07:48,949 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-28 10:07:48,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:49,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {43787#false} assume !false; {43787#false} is VALID [2022-04-28 10:07:49,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {43787#false} assume 0 == ~cond; {43787#false} is VALID [2022-04-28 10:07:49,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {43787#false} ~cond := #in~cond; {43787#false} is VALID [2022-04-28 10:07:49,511 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-28 10:07:49,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {43913#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43787#false} is VALID [2022-04-28 10:07:49,512 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-28 10:07:49,513 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-28 10:07:49,513 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-28 10:07:49,514 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-28 10:07:49,515 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-28 10:07:49,516 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-28 10:07:49,516 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-28 10:07:49,517 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-28 10:07:49,518 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-28 10:07:49,518 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-28 10:07:49,518 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-28 10:07:49,519 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-28 10:07:49,520 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-28 10:07:49,520 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-28 10:07:49,521 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-28 10:07:49,522 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-28 10:07:49,522 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-28 10:07:49,523 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-28 10:07:49,524 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-28 10:07:49,524 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-28 10:07:49,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {43786#true} call #t~ret9 := main(); {43786#true} is VALID [2022-04-28 10:07:49,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43786#true} {43786#true} #50#return; {43786#true} is VALID [2022-04-28 10:07:49,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {43786#true} assume true; {43786#true} is VALID [2022-04-28 10:07:49,524 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-28 10:07:49,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {43786#true} call ULTIMATE.init(); {43786#true} is VALID [2022-04-28 10:07:49,524 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-28 10:07:49,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590802183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:49,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:49,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2022-04-28 10:07:49,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:49,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1257234827] [2022-04-28 10:07:49,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1257234827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:49,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:49,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:49,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084750639] [2022-04-28 10:07:49,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:49,525 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-28 10:07:49,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:49,525 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-28 10:07:49,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:49,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:49,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:49,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:49,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:07:49,546 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-28 10:07:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:51,354 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 10:07:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:07:51,354 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-28 10:07:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:51,354 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-28 10:07:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 41 transitions. [2022-04-28 10:07:51,354 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-28 10:07:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 41 transitions. [2022-04-28 10:07:51,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 41 transitions. [2022-04-28 10:07:51,389 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-28 10:07:51,390 INFO L225 Difference]: With dead ends: 63 [2022-04-28 10:07:51,390 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:07:51,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=2863, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 10:07:51,390 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:51,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 104 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:07:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:07:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 10:07:51,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:51,784 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-28 10:07:51,784 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-28 10:07:51,784 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-28 10:07:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:51,785 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-28 10:07:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:51,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:51,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:51,785 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-28 10:07:51,785 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-28 10:07:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:51,785 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-28 10:07:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:51,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:51,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:51,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:51,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:51,786 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-28 10:07:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-28 10:07:51,786 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 30 [2022-04-28 10:07:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:51,786 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-28 10:07:51,786 INFO L496 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-28 10:07:51,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-28 10:07:52,376 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-28 10:07:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 10:07:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:07:52,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:52,377 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:52,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2022-04-28 10:07:52,579 WARN L477 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-28 10:07:52,579 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1103456948, now seen corresponding path program 145 times [2022-04-28 10:07:52,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:52,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1029907426] [2022-04-28 10:07:52,582 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:52,582 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1103456948, now seen corresponding path program 146 times [2022-04-28 10:07:52,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:52,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11028844] [2022-04-28 10:07:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:52,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:52,877 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-28 10:07:52,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {44359#true} assume true; {44359#true} is VALID [2022-04-28 10:07:52,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44359#true} {44359#true} #50#return; {44359#true} is VALID [2022-04-28 10:07:52,877 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-28 10:07:52,877 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-28 10:07:52,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {44359#true} assume true; {44359#true} is VALID [2022-04-28 10:07:52,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44359#true} {44359#true} #50#return; {44359#true} is VALID [2022-04-28 10:07:52,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {44359#true} call #t~ret9 := main(); {44359#true} is VALID [2022-04-28 10:07:52,878 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-28 10:07:52,879 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-28 10:07:52,879 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-28 10:07:52,880 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-28 10:07:52,881 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-28 10:07:52,881 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-28 10:07:52,882 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-28 10:07:52,882 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-28 10:07:52,883 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-28 10:07:52,883 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-28 10:07:52,883 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-28 10:07:52,884 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-28 10:07:52,884 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-28 10:07:52,885 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-28 10:07:52,885 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-28 10:07:52,886 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-28 10:07:52,886 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-28 10:07:52,887 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-28 10:07:52,887 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-28 10:07:52,888 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-28 10:07:52,888 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-28 10:07:52,888 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-28 10:07:52,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {44360#false} ~cond := #in~cond; {44360#false} is VALID [2022-04-28 10:07:52,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {44360#false} assume 0 == ~cond; {44360#false} is VALID [2022-04-28 10:07:52,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {44360#false} assume !false; {44360#false} is VALID [2022-04-28 10:07:52,889 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-28 10:07:52,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:52,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11028844] [2022-04-28 10:07:52,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11028844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:52,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529920225] [2022-04-28 10:07:52,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:52,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:52,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:52,890 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-28 10:07:52,890 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-28 10:07:52,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:52,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:52,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:07:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:52,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:53,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {44359#true} call ULTIMATE.init(); {44359#true} is VALID [2022-04-28 10:07:53,212 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-28 10:07:53,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {44359#true} assume true; {44359#true} is VALID [2022-04-28 10:07:53,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44359#true} {44359#true} #50#return; {44359#true} is VALID [2022-04-28 10:07:53,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {44359#true} call #t~ret9 := main(); {44359#true} is VALID [2022-04-28 10:07:53,213 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-28 10:07:53,213 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-28 10:07:53,214 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-28 10:07:53,214 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-28 10:07:53,215 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-28 10:07:53,215 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-28 10:07:53,216 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-28 10:07:53,216 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-28 10:07:53,217 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-28 10:07:53,217 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-28 10:07:53,218 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-28 10:07:53,218 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-28 10:07:53,218 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-28 10:07:53,219 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-28 10:07:53,220 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-28 10:07:53,220 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-28 10:07:53,221 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-28 10:07:53,221 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-28 10:07:53,222 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-28 10:07:53,222 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-28 10:07:53,222 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-28 10:07:53,223 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-28 10:07:53,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {44360#false} ~cond := #in~cond; {44360#false} is VALID [2022-04-28 10:07:53,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {44360#false} assume 0 == ~cond; {44360#false} is VALID [2022-04-28 10:07:53,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {44360#false} assume !false; {44360#false} is VALID [2022-04-28 10:07:53,223 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-28 10:07:53,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:53,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {44360#false} assume !false; {44360#false} is VALID [2022-04-28 10:07:53,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {44360#false} assume 0 == ~cond; {44360#false} is VALID [2022-04-28 10:07:53,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {44360#false} ~cond := #in~cond; {44360#false} is VALID [2022-04-28 10:07:53,783 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-28 10:07:53,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {44487#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {44360#false} is VALID [2022-04-28 10:07:53,785 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-28 10:07:53,785 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-28 10:07:53,786 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-28 10:07:53,787 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-28 10:07:53,787 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-28 10:07:53,788 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-28 10:07:53,789 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-28 10:07:53,789 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-28 10:07:53,790 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-28 10:07:53,790 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-28 10:07:53,791 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-28 10:07:53,791 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-28 10:07:53,792 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-28 10:07:53,793 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-28 10:07:53,793 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-28 10:07:53,794 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-28 10:07:53,795 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-28 10:07:53,795 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-28 10:07:53,796 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-28 10:07:53,796 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-28 10:07:53,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {44359#true} call #t~ret9 := main(); {44359#true} is VALID [2022-04-28 10:07:53,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44359#true} {44359#true} #50#return; {44359#true} is VALID [2022-04-28 10:07:53,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {44359#true} assume true; {44359#true} is VALID [2022-04-28 10:07:53,797 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-28 10:07:53,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {44359#true} call ULTIMATE.init(); {44359#true} is VALID [2022-04-28 10:07:53,797 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-28 10:07:53,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529920225] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:53,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:53,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:07:53,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:53,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1029907426] [2022-04-28 10:07:53,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1029907426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:53,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:53,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:07:53,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057721029] [2022-04-28 10:07:53,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:53,798 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-28 10:07:53,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:53,805 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-28 10:07:53,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:53,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:07:53,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:07:53,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1467, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:07:53,827 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-28 10:07:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:55,687 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-04-28 10:07:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:07:55,688 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-28 10:07:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:55,688 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-28 10:07:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 44 transitions. [2022-04-28 10:07:55,688 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-28 10:07:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 44 transitions. [2022-04-28 10:07:55,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 44 transitions. [2022-04-28 10:07:55,722 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-28 10:07:55,722 INFO L225 Difference]: With dead ends: 62 [2022-04-28 10:07:55,722 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 10:07:55,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=612, Invalid=3048, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:07:55,723 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:55,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:07:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 10:07:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2022-04-28 10:07:56,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:56,181 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-28 10:07:56,181 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-28 10:07:56,181 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-28 10:07:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:56,182 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 10:07:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 10:07:56,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:56,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:56,182 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-28 10:07:56,182 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-28 10:07:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:56,182 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 10:07:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 10:07:56,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:56,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:56,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:56,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:56,183 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-28 10:07:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 10:07:56,183 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-28 10:07:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:56,183 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 10:07:56,183 INFO L496 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-28 10:07:56,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 10:07:56,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-28 10:07:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 10:07:56,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:07:56,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:56,927 INFO L195 NwaCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:56,942 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-28 10:07:57,127 WARN L477 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-28 10:07:57,127 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1004309109, now seen corresponding path program 147 times [2022-04-28 10:07:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:57,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2136921259] [2022-04-28 10:07:57,130 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:57,130 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1004309109, now seen corresponding path program 148 times [2022-04-28 10:07:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977923696] [2022-04-28 10:07:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:57,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:57,444 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-28 10:07:57,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {44955#true} assume true; {44955#true} is VALID [2022-04-28 10:07:57,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44955#true} {44955#true} #50#return; {44955#true} is VALID [2022-04-28 10:07:57,444 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-28 10:07:57,444 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-28 10:07:57,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {44955#true} assume true; {44955#true} is VALID [2022-04-28 10:07:57,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44955#true} {44955#true} #50#return; {44955#true} is VALID [2022-04-28 10:07:57,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {44955#true} call #t~ret9 := main(); {44955#true} is VALID [2022-04-28 10:07:57,445 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-28 10:07:57,445 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-28 10:07:57,446 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-28 10:07:57,446 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-28 10:07:57,447 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-28 10:07:57,447 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-28 10:07:57,448 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-28 10:07:57,448 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-28 10:07:57,449 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-28 10:07:57,449 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-28 10:07:57,450 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-28 10:07:57,450 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-28 10:07:57,450 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-28 10:07:57,451 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-28 10:07:57,451 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-28 10:07:57,452 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-28 10:07:57,452 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-28 10:07:57,453 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-28 10:07:57,453 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-28 10:07:57,454 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-28 10:07:57,454 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-28 10:07:57,454 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-28 10:07:57,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {44956#false} ~cond := #in~cond; {44956#false} is VALID [2022-04-28 10:07:57,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {44956#false} assume 0 == ~cond; {44956#false} is VALID [2022-04-28 10:07:57,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {44956#false} assume !false; {44956#false} is VALID [2022-04-28 10:07:57,455 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-28 10:07:57,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:57,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977923696] [2022-04-28 10:07:57,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977923696] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:57,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974532003] [2022-04-28 10:07:57,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:57,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:57,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:57,456 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-28 10:07:57,456 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-28 10:07:57,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:57,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:57,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:07:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:57,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:57,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {44955#true} call ULTIMATE.init(); {44955#true} is VALID [2022-04-28 10:07:57,777 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-28 10:07:57,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {44955#true} assume true; {44955#true} is VALID [2022-04-28 10:07:57,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44955#true} {44955#true} #50#return; {44955#true} is VALID [2022-04-28 10:07:57,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {44955#true} call #t~ret9 := main(); {44955#true} is VALID [2022-04-28 10:07:57,777 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-28 10:07:57,778 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-28 10:07:57,778 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-28 10:07:57,779 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-28 10:07:57,779 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-28 10:07:57,780 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-28 10:07:57,780 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-28 10:07:57,781 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-28 10:07:57,781 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-28 10:07:57,782 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-28 10:07:57,782 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-28 10:07:57,782 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-28 10:07:57,783 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-28 10:07:57,783 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-28 10:07:57,784 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-28 10:07:57,784 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-28 10:07:57,785 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-28 10:07:57,785 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-28 10:07:57,786 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-28 10:07:57,786 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-28 10:07:57,787 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-28 10:07:57,787 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-28 10:07:57,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {44956#false} ~cond := #in~cond; {44956#false} is VALID [2022-04-28 10:07:57,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {44956#false} assume 0 == ~cond; {44956#false} is VALID [2022-04-28 10:07:57,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {44956#false} assume !false; {44956#false} is VALID [2022-04-28 10:07:57,787 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-28 10:07:57,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:58,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {44956#false} assume !false; {44956#false} is VALID [2022-04-28 10:07:58,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {44956#false} assume 0 == ~cond; {44956#false} is VALID [2022-04-28 10:07:58,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {44956#false} ~cond := #in~cond; {44956#false} is VALID [2022-04-28 10:07:58,376 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-28 10:07:58,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {45083#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {44956#false} is VALID [2022-04-28 10:07:58,377 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-28 10:07:58,378 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-28 10:07:58,379 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-28 10:07:58,379 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-28 10:07:58,380 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-28 10:07:58,381 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-28 10:07:58,381 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-28 10:07:58,382 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-28 10:07:58,382 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-28 10:07:58,383 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-28 10:07:58,383 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-28 10:07:58,384 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-28 10:07:58,385 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-28 10:07:58,385 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-28 10:07:58,386 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-28 10:07:58,387 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-28 10:07:58,387 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-28 10:07:58,388 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-28 10:07:58,389 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-28 10:07:58,389 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-28 10:07:58,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {44955#true} call #t~ret9 := main(); {44955#true} is VALID [2022-04-28 10:07:58,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44955#true} {44955#true} #50#return; {44955#true} is VALID [2022-04-28 10:07:58,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {44955#true} assume true; {44955#true} is VALID [2022-04-28 10:07:58,389 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-28 10:07:58,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {44955#true} call ULTIMATE.init(); {44955#true} is VALID [2022-04-28 10:07:58,389 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-28 10:07:58,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974532003] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:58,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:58,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:07:58,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:58,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2136921259] [2022-04-28 10:07:58,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2136921259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:58,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:58,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:07:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558987483] [2022-04-28 10:07:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:58,390 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-28 10:07:58,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:58,390 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-28 10:07:58,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:58,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:07:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:07:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1458, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:07:58,411 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-28 10:08:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:00,876 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-04-28 10:08:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:08:00,876 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-28 10:08:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:00,876 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-28 10:08:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2022-04-28 10:08:00,876 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-28 10:08:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2022-04-28 10:08:00,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 56 transitions. [2022-04-28 10:08:00,919 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-28 10:08:00,919 INFO L225 Difference]: With dead ends: 71 [2022-04-28 10:08:00,919 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 10:08:00,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=804, Invalid=3752, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:08:00,920 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:00,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 84 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:08:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 10:08:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2022-04-28 10:08:01,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:01,377 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-28 10:08:01,377 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-28 10:08:01,377 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-28 10:08:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:01,377 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 10:08:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 10:08:01,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:01,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:01,378 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-28 10:08:01,378 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-28 10:08:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:01,378 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 10:08:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 10:08:01,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:01,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:01,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:01,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:01,379 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-28 10:08:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 10:08:01,379 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-28 10:08:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:01,379 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 10:08:01,379 INFO L496 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-28 10:08:01,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 10:08:02,230 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-28 10:08:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 10:08:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:08:02,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:02,231 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:02,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:02,435 WARN L477 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-28 10:08:02,435 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:02,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1416752788, now seen corresponding path program 149 times [2022-04-28 10:08:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:02,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318246723] [2022-04-28 10:08:02,438 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:02,438 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1416752788, now seen corresponding path program 150 times [2022-04-28 10:08:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:02,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530173833] [2022-04-28 10:08:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:02,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:02,737 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-28 10:08:02,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {45601#true} assume true; {45601#true} is VALID [2022-04-28 10:08:02,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45601#true} {45601#true} #50#return; {45601#true} is VALID [2022-04-28 10:08:02,737 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-28 10:08:02,737 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-28 10:08:02,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {45601#true} assume true; {45601#true} is VALID [2022-04-28 10:08:02,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45601#true} {45601#true} #50#return; {45601#true} is VALID [2022-04-28 10:08:02,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {45601#true} call #t~ret9 := main(); {45601#true} is VALID [2022-04-28 10:08:02,738 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-28 10:08:02,738 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-28 10:08:02,739 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-28 10:08:02,739 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-28 10:08:02,740 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-28 10:08:02,740 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-28 10:08:02,741 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-28 10:08:02,741 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-28 10:08:02,742 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-28 10:08:02,742 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-28 10:08:02,743 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-28 10:08:02,743 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-28 10:08:02,744 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-28 10:08:02,744 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-28 10:08:02,744 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-28 10:08:02,745 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-28 10:08:02,745 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-28 10:08:02,746 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-28 10:08:02,746 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-28 10:08:02,747 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-28 10:08:02,747 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-28 10:08:02,747 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-28 10:08:02,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {45602#false} ~cond := #in~cond; {45602#false} is VALID [2022-04-28 10:08:02,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {45602#false} assume 0 == ~cond; {45602#false} is VALID [2022-04-28 10:08:02,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {45602#false} assume !false; {45602#false} is VALID [2022-04-28 10:08:02,748 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-28 10:08:02,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:02,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530173833] [2022-04-28 10:08:02,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530173833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:02,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005804441] [2022-04-28 10:08:02,748 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:02,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:02,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:02,749 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-28 10:08:02,750 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-28 10:08:02,824 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:08:02,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:02,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:08:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:02,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:03,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {45601#true} call ULTIMATE.init(); {45601#true} is VALID [2022-04-28 10:08:03,115 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-28 10:08:03,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {45601#true} assume true; {45601#true} is VALID [2022-04-28 10:08:03,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45601#true} {45601#true} #50#return; {45601#true} is VALID [2022-04-28 10:08:03,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {45601#true} call #t~ret9 := main(); {45601#true} is VALID [2022-04-28 10:08:03,115 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-28 10:08:03,116 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-28 10:08:03,116 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-28 10:08:03,117 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-28 10:08:03,117 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-28 10:08:03,118 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-28 10:08:03,118 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-28 10:08:03,119 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-28 10:08:03,119 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-28 10:08:03,120 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-28 10:08:03,120 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-28 10:08:03,121 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-28 10:08:03,121 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-28 10:08:03,121 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-28 10:08:03,122 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-28 10:08:03,122 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-28 10:08:03,123 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-28 10:08:03,124 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-28 10:08:03,124 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-28 10:08:03,125 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-28 10:08:03,125 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-28 10:08:03,125 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-28 10:08:03,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {45602#false} ~cond := #in~cond; {45602#false} is VALID [2022-04-28 10:08:03,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {45602#false} assume 0 == ~cond; {45602#false} is VALID [2022-04-28 10:08:03,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {45602#false} assume !false; {45602#false} is VALID [2022-04-28 10:08:03,125 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-28 10:08:03,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:03,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {45602#false} assume !false; {45602#false} is VALID [2022-04-28 10:08:03,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {45602#false} assume 0 == ~cond; {45602#false} is VALID [2022-04-28 10:08:03,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {45602#false} ~cond := #in~cond; {45602#false} is VALID [2022-04-28 10:08:03,712 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-28 10:08:03,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {45729#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {45602#false} is VALID [2022-04-28 10:08:03,714 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-28 10:08:03,714 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-28 10:08:03,715 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-28 10:08:03,716 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-28 10:08:03,716 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-28 10:08:03,717 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-28 10:08:03,717 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-28 10:08:03,718 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-28 10:08:03,718 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-28 10:08:03,719 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-28 10:08:03,720 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-28 10:08:03,720 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-28 10:08:03,721 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-28 10:08:03,722 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-28 10:08:03,722 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-28 10:08:03,723 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-28 10:08:03,724 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-28 10:08:03,724 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-28 10:08:03,725 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-28 10:08:03,725 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-28 10:08:03,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {45601#true} call #t~ret9 := main(); {45601#true} is VALID [2022-04-28 10:08:03,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45601#true} {45601#true} #50#return; {45601#true} is VALID [2022-04-28 10:08:03,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {45601#true} assume true; {45601#true} is VALID [2022-04-28 10:08:03,725 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-28 10:08:03,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {45601#true} call ULTIMATE.init(); {45601#true} is VALID [2022-04-28 10:08:03,726 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-28 10:08:03,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005804441] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:03,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:03,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:08:03,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:03,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318246723] [2022-04-28 10:08:03,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318246723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:03,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:03,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:08:03,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476104758] [2022-04-28 10:08:03,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:03,726 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-28 10:08:03,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:03,726 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-28 10:08:03,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:03,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:08:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:08:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:08:03,748 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-28 10:08:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:06,860 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-04-28 10:08:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:08:06,860 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-28 10:08:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:06,860 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-28 10:08:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 65 transitions. [2022-04-28 10:08:06,861 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-28 10:08:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 65 transitions. [2022-04-28 10:08:06,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 65 transitions. [2022-04-28 10:08:06,911 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-28 10:08:06,912 INFO L225 Difference]: With dead ends: 79 [2022-04-28 10:08:06,912 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 10:08:06,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=933, Invalid=4179, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 10:08:06,912 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:06,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 107 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:08:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 10:08:07,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2022-04-28 10:08:07,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:07,401 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-28 10:08:07,401 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-28 10:08:07,402 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-28 10:08:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:07,402 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-04-28 10:08:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-04-28 10:08:07,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:07,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:07,402 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-28 10:08:07,402 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-28 10:08:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:07,403 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-04-28 10:08:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-04-28 10:08:07,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:07,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:07,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:07,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:07,403 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-28 10:08:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 10:08:07,404 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-28 10:08:07,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:07,404 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 10:08:07,404 INFO L496 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-28 10:08:07,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 10:08:08,130 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-28 10:08:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 10:08:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:08:08,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:08,131 INFO L195 NwaCegarLoop]: trace histogram [12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:08,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-04-28 10:08:08,338 WARN L477 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-28 10:08:08,338 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 509605227, now seen corresponding path program 151 times [2022-04-28 10:08:08,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:08,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [394205715] [2022-04-28 10:08:08,341 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:08,341 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:08,341 INFO L85 PathProgramCache]: Analyzing trace with hash 509605227, now seen corresponding path program 152 times [2022-04-28 10:08:08,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:08,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486883761] [2022-04-28 10:08:08,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:08,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:08,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:08,709 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-28 10:08:08,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {46287#true} assume true; {46287#true} is VALID [2022-04-28 10:08:08,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46287#true} {46287#true} #50#return; {46287#true} is VALID [2022-04-28 10:08:08,710 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-28 10:08:08,710 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-28 10:08:08,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {46287#true} assume true; {46287#true} is VALID [2022-04-28 10:08:08,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46287#true} {46287#true} #50#return; {46287#true} is VALID [2022-04-28 10:08:08,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {46287#true} call #t~ret9 := main(); {46287#true} is VALID [2022-04-28 10:08:08,710 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-28 10:08:08,711 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-28 10:08:08,712 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-28 10:08:08,712 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-28 10:08:08,713 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-28 10:08:08,714 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-28 10:08:08,714 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-28 10:08:08,715 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-28 10:08:08,716 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-28 10:08:08,716 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-28 10:08:08,717 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-28 10:08:08,717 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-28 10:08:08,718 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-28 10:08:08,718 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-28 10:08:08,719 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-28 10:08:08,720 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-28 10:08:08,720 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-28 10:08:08,721 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-28 10:08:08,721 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-28 10:08:08,722 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-28 10:08:08,723 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-28 10:08:08,723 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-28 10:08:08,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {46288#false} ~cond := #in~cond; {46288#false} is VALID [2022-04-28 10:08:08,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {46288#false} assume 0 == ~cond; {46288#false} is VALID [2022-04-28 10:08:08,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {46288#false} assume !false; {46288#false} is VALID [2022-04-28 10:08:08,723 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-28 10:08:08,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:08,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486883761] [2022-04-28 10:08:08,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486883761] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:08,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658027180] [2022-04-28 10:08:08,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:08,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:08,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:08,725 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-28 10:08:08,726 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-28 10:08:08,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:08,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:08,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:08:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:08,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:09,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {46287#true} call ULTIMATE.init(); {46287#true} is VALID [2022-04-28 10:08:09,075 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-28 10:08:09,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {46287#true} assume true; {46287#true} is VALID [2022-04-28 10:08:09,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46287#true} {46287#true} #50#return; {46287#true} is VALID [2022-04-28 10:08:09,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {46287#true} call #t~ret9 := main(); {46287#true} is VALID [2022-04-28 10:08:09,075 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-28 10:08:09,075 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-28 10:08:09,076 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-28 10:08:09,076 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-28 10:08:09,077 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-28 10:08:09,078 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-28 10:08:09,078 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-28 10:08:09,079 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-28 10:08:09,079 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-28 10:08:09,080 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-28 10:08:09,080 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-28 10:08:09,081 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-28 10:08:09,081 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-28 10:08:09,082 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-28 10:08:09,082 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-28 10:08:09,082 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-28 10:08:09,083 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-28 10:08:09,083 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-28 10:08:09,084 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-28 10:08:09,084 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-28 10:08:09,085 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-28 10:08:09,085 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-28 10:08:09,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {46288#false} ~cond := #in~cond; {46288#false} is VALID [2022-04-28 10:08:09,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {46288#false} assume 0 == ~cond; {46288#false} is VALID [2022-04-28 10:08:09,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {46288#false} assume !false; {46288#false} is VALID [2022-04-28 10:08:09,085 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-28 10:08:09,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:09,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {46288#false} assume !false; {46288#false} is VALID [2022-04-28 10:08:09,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {46288#false} assume 0 == ~cond; {46288#false} is VALID [2022-04-28 10:08:09,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {46288#false} ~cond := #in~cond; {46288#false} is VALID [2022-04-28 10:08:09,693 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-28 10:08:09,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {46415#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46288#false} is VALID [2022-04-28 10:08:09,694 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-28 10:08:09,695 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-28 10:08:09,696 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-28 10:08:09,697 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-28 10:08:09,697 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-28 10:08:09,698 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-28 10:08:09,698 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-28 10:08:09,699 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-28 10:08:09,699 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-28 10:08:09,700 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-28 10:08:09,700 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-28 10:08:09,701 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-28 10:08:09,702 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-28 10:08:09,702 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-28 10:08:09,703 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-28 10:08:09,704 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-28 10:08:09,704 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-28 10:08:09,705 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-28 10:08:09,706 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-28 10:08:09,706 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-28 10:08:09,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {46287#true} call #t~ret9 := main(); {46287#true} is VALID [2022-04-28 10:08:09,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46287#true} {46287#true} #50#return; {46287#true} is VALID [2022-04-28 10:08:09,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {46287#true} assume true; {46287#true} is VALID [2022-04-28 10:08:09,706 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-28 10:08:09,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {46287#true} call ULTIMATE.init(); {46287#true} is VALID [2022-04-28 10:08:09,706 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-28 10:08:09,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658027180] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:09,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:09,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:08:09,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:09,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [394205715] [2022-04-28 10:08:09,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [394205715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:09,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:09,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:08:09,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354050701] [2022-04-28 10:08:09,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:09,707 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-28 10:08:09,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:09,707 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-28 10:08:09,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:09,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:08:09,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:08:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:08:09,728 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-28 10:08:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:13,291 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-28 10:08:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:08:13,291 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-28 10:08:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:13,291 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-28 10:08:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2022-04-28 10:08:13,292 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-28 10:08:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2022-04-28 10:08:13,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 71 transitions. [2022-04-28 10:08:13,352 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-28 10:08:13,353 INFO L225 Difference]: With dead ends: 86 [2022-04-28 10:08:13,353 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 10:08:13,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=985, Invalid=4271, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:08:13,354 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:13,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:08:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 10:08:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2022-04-28 10:08:13,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:13,819 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-28 10:08:13,819 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-28 10:08:13,819 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-28 10:08:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:13,820 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-28 10:08:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-28 10:08:13,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:13,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:13,820 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-28 10:08:13,820 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-28 10:08:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:13,821 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-28 10:08:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-28 10:08:13,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:13,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:13,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:13,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:13,821 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-28 10:08:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 10:08:13,821 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-28 10:08:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:13,821 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 10:08:13,821 INFO L496 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-28 10:08:13,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 10:08:14,511 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-28 10:08:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 10:08:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:08:14,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:14,512 INFO L195 NwaCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:14,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2022-04-28 10:08:14,712 WARN L477 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-28 10:08:14,712 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash 433198476, now seen corresponding path program 153 times [2022-04-28 10:08:14,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:14,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1413855897] [2022-04-28 10:08:14,717 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:14,717 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:14,717 INFO L85 PathProgramCache]: Analyzing trace with hash 433198476, now seen corresponding path program 154 times [2022-04-28 10:08:14,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:14,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734900241] [2022-04-28 10:08:14,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:14,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:15,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:15,016 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-28 10:08:15,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {47003#true} assume true; {47003#true} is VALID [2022-04-28 10:08:15,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47003#true} {47003#true} #50#return; {47003#true} is VALID [2022-04-28 10:08:15,017 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-28 10:08:15,017 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-28 10:08:15,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {47003#true} assume true; {47003#true} is VALID [2022-04-28 10:08:15,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47003#true} {47003#true} #50#return; {47003#true} is VALID [2022-04-28 10:08:15,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {47003#true} call #t~ret9 := main(); {47003#true} is VALID [2022-04-28 10:08:15,017 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-28 10:08:15,018 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-28 10:08:15,018 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-28 10:08:15,019 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-28 10:08:15,019 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-28 10:08:15,020 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-28 10:08:15,021 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-28 10:08:15,021 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-28 10:08:15,022 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-28 10:08:15,022 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-28 10:08:15,023 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-28 10:08:15,023 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-28 10:08:15,024 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-28 10:08:15,024 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-28 10:08:15,025 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-28 10:08:15,025 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-28 10:08:15,025 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-28 10:08:15,026 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-28 10:08:15,027 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-28 10:08:15,027 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-28 10:08:15,028 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-28 10:08:15,028 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-28 10:08:15,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {47004#false} ~cond := #in~cond; {47004#false} is VALID [2022-04-28 10:08:15,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {47004#false} assume 0 == ~cond; {47004#false} is VALID [2022-04-28 10:08:15,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {47004#false} assume !false; {47004#false} is VALID [2022-04-28 10:08:15,028 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-28 10:08:15,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734900241] [2022-04-28 10:08:15,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734900241] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725502951] [2022-04-28 10:08:15,028 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:15,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:15,029 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-28 10:08:15,030 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-28 10:08:15,068 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:15,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:15,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:08:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:15,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:15,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {47003#true} call ULTIMATE.init(); {47003#true} is VALID [2022-04-28 10:08:15,386 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-28 10:08:15,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {47003#true} assume true; {47003#true} is VALID [2022-04-28 10:08:15,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47003#true} {47003#true} #50#return; {47003#true} is VALID [2022-04-28 10:08:15,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {47003#true} call #t~ret9 := main(); {47003#true} is VALID [2022-04-28 10:08:15,387 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-28 10:08:15,387 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-28 10:08:15,387 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-28 10:08:15,388 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-28 10:08:15,389 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-28 10:08:15,389 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-28 10:08:15,390 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-28 10:08:15,390 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-28 10:08:15,391 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-28 10:08:15,391 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-28 10:08:15,392 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-28 10:08:15,392 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-28 10:08:15,393 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-28 10:08:15,393 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-28 10:08:15,393 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-28 10:08:15,394 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-28 10:08:15,394 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-28 10:08:15,395 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-28 10:08:15,395 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-28 10:08:15,396 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-28 10:08:15,396 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-28 10:08:15,396 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-28 10:08:15,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {47004#false} ~cond := #in~cond; {47004#false} is VALID [2022-04-28 10:08:15,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {47004#false} assume 0 == ~cond; {47004#false} is VALID [2022-04-28 10:08:15,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {47004#false} assume !false; {47004#false} is VALID [2022-04-28 10:08:15,397 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-28 10:08:15,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:15,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {47004#false} assume !false; {47004#false} is VALID [2022-04-28 10:08:15,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {47004#false} assume 0 == ~cond; {47004#false} is VALID [2022-04-28 10:08:15,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {47004#false} ~cond := #in~cond; {47004#false} is VALID [2022-04-28 10:08:15,997 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-28 10:08:15,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {47131#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {47004#false} is VALID [2022-04-28 10:08:15,998 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-28 10:08:15,998 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-28 10:08:15,999 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-28 10:08:16,000 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-28 10:08:16,000 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-28 10:08:16,001 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-28 10:08:16,001 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-28 10:08:16,002 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-28 10:08:16,003 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-28 10:08:16,003 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-28 10:08:16,004 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-28 10:08:16,005 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-28 10:08:16,005 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-28 10:08:16,006 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-28 10:08:16,007 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-28 10:08:16,007 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-28 10:08:16,008 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-28 10:08:16,009 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-28 10:08:16,009 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-28 10:08:16,009 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-28 10:08:16,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {47003#true} call #t~ret9 := main(); {47003#true} is VALID [2022-04-28 10:08:16,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47003#true} {47003#true} #50#return; {47003#true} is VALID [2022-04-28 10:08:16,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {47003#true} assume true; {47003#true} is VALID [2022-04-28 10:08:16,010 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-28 10:08:16,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {47003#true} call ULTIMATE.init(); {47003#true} is VALID [2022-04-28 10:08:16,010 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-28 10:08:16,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725502951] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:16,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:16,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:08:16,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:16,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1413855897] [2022-04-28 10:08:16,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1413855897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:16,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:16,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:08:16,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67786240] [2022-04-28 10:08:16,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:16,011 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-28 10:08:16,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:16,011 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-28 10:08:16,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:16,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:08:16,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:08:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:08:16,032 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-28 10:08:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:19,679 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-04-28 10:08:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:08:19,679 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-28 10:08:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:19,679 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-28 10:08:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2022-04-28 10:08:19,680 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-28 10:08:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2022-04-28 10:08:19,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 74 transitions. [2022-04-28 10:08:19,738 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-28 10:08:19,739 INFO L225 Difference]: With dead ends: 92 [2022-04-28 10:08:19,739 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 10:08:19,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=949, Invalid=4021, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 10:08:19,740 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:19,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 113 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:08:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 10:08:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2022-04-28 10:08:20,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:20,221 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-28 10:08:20,221 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-28 10:08:20,221 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-28 10:08:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:20,224 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-28 10:08:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-04-28 10:08:20,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:20,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:20,224 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-28 10:08:20,224 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-28 10:08:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:20,225 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-28 10:08:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-04-28 10:08:20,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:20,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:20,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:20,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:20,226 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-28 10:08:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 10:08:20,226 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-28 10:08:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:20,226 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 10:08:20,227 INFO L496 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-28 10:08:20,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 10:08:20,982 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-28 10:08:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 10:08:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:08:20,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:20,982 INFO L195 NwaCegarLoop]: trace histogram [14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:21,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2022-04-28 10:08:21,183 WARN L477 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-28 10:08:21,183 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:21,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1400565067, now seen corresponding path program 155 times [2022-04-28 10:08:21,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:21,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384939150] [2022-04-28 10:08:21,186 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:21,186 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:21,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1400565067, now seen corresponding path program 156 times [2022-04-28 10:08:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:21,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491479732] [2022-04-28 10:08:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:21,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:21,498 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-28 10:08:21,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {47739#true} assume true; {47739#true} is VALID [2022-04-28 10:08:21,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47739#true} {47739#true} #50#return; {47739#true} is VALID [2022-04-28 10:08:21,498 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-28 10:08:21,498 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-28 10:08:21,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {47739#true} assume true; {47739#true} is VALID [2022-04-28 10:08:21,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47739#true} {47739#true} #50#return; {47739#true} is VALID [2022-04-28 10:08:21,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {47739#true} call #t~ret9 := main(); {47739#true} is VALID [2022-04-28 10:08:21,499 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-28 10:08:21,499 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-28 10:08:21,500 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-28 10:08:21,500 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-28 10:08:21,501 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-28 10:08:21,501 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-28 10:08:21,502 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-28 10:08:21,502 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-28 10:08:21,503 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-28 10:08:21,503 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-28 10:08:21,504 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-28 10:08:21,504 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-28 10:08:21,505 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-28 10:08:21,505 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-28 10:08:21,506 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-28 10:08:21,506 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-28 10:08:21,507 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-28 10:08:21,507 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-28 10:08:21,508 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-28 10:08:21,508 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-28 10:08:21,509 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-28 10:08:21,509 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-28 10:08:21,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {47740#false} ~cond := #in~cond; {47740#false} is VALID [2022-04-28 10:08:21,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {47740#false} assume 0 == ~cond; {47740#false} is VALID [2022-04-28 10:08:21,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {47740#false} assume !false; {47740#false} is VALID [2022-04-28 10:08:21,509 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-28 10:08:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:21,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491479732] [2022-04-28 10:08:21,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491479732] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:21,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605121494] [2022-04-28 10:08:21,509 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:21,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:21,510 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-28 10:08:21,511 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-28 10:08:21,699 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:08:21,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:21,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:08:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:21,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:21,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {47739#true} call ULTIMATE.init(); {47739#true} is VALID [2022-04-28 10:08:21,995 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-28 10:08:21,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {47739#true} assume true; {47739#true} is VALID [2022-04-28 10:08:21,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47739#true} {47739#true} #50#return; {47739#true} is VALID [2022-04-28 10:08:21,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {47739#true} call #t~ret9 := main(); {47739#true} is VALID [2022-04-28 10:08:21,995 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-28 10:08:21,996 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-28 10:08:21,996 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-28 10:08:21,997 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-28 10:08:21,997 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-28 10:08:21,998 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-28 10:08:21,998 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-28 10:08:21,999 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-28 10:08:21,999 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-28 10:08:22,000 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-28 10:08:22,000 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-28 10:08:22,001 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-28 10:08:22,001 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-28 10:08:22,002 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-28 10:08:22,002 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-28 10:08:22,003 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-28 10:08:22,003 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-28 10:08:22,004 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-28 10:08:22,004 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-28 10:08:22,005 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-28 10:08:22,005 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-28 10:08:22,005 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-28 10:08:22,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {47740#false} ~cond := #in~cond; {47740#false} is VALID [2022-04-28 10:08:22,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {47740#false} assume 0 == ~cond; {47740#false} is VALID [2022-04-28 10:08:22,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {47740#false} assume !false; {47740#false} is VALID [2022-04-28 10:08:22,005 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-28 10:08:22,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:22,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {47740#false} assume !false; {47740#false} is VALID [2022-04-28 10:08:22,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {47740#false} assume 0 == ~cond; {47740#false} is VALID [2022-04-28 10:08:22,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {47740#false} ~cond := #in~cond; {47740#false} is VALID [2022-04-28 10:08:22,611 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-28 10:08:22,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {47867#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {47740#false} is VALID [2022-04-28 10:08:22,612 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-28 10:08:22,613 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-28 10:08:22,613 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-28 10:08:22,614 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-28 10:08:22,614 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-28 10:08:22,615 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-28 10:08:22,616 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-28 10:08:22,616 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-28 10:08:22,617 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-28 10:08:22,617 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-28 10:08:22,618 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-28 10:08:22,619 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-28 10:08:22,619 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-28 10:08:22,620 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-28 10:08:22,621 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-28 10:08:22,621 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-28 10:08:22,622 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-28 10:08:22,623 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-28 10:08:22,623 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-28 10:08:22,623 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-28 10:08:22,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {47739#true} call #t~ret9 := main(); {47739#true} is VALID [2022-04-28 10:08:22,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47739#true} {47739#true} #50#return; {47739#true} is VALID [2022-04-28 10:08:22,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {47739#true} assume true; {47739#true} is VALID [2022-04-28 10:08:22,624 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-28 10:08:22,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {47739#true} call ULTIMATE.init(); {47739#true} is VALID [2022-04-28 10:08:22,624 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-28 10:08:22,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605121494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:22,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:22,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:08:22,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:22,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384939150] [2022-04-28 10:08:22,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384939150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:22,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:22,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:08:22,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691651329] [2022-04-28 10:08:22,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:22,625 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-28 10:08:22,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:22,631 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-28 10:08:22,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:22,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:08:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:22,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:08:22,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:08:22,655 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-28 10:08:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:26,434 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-04-28 10:08:26,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:08:26,434 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-28 10:08:26,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:26,435 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-28 10:08:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-28 10:08:26,435 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-28 10:08:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-28 10:08:26,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2022-04-28 10:08:26,494 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-28 10:08:26,495 INFO L225 Difference]: With dead ends: 97 [2022-04-28 10:08:26,495 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 10:08:26,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=869, Invalid=3553, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:08:26,495 INFO L413 NwaCegarLoop]: 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-28 10:08:26,496 INFO L414 NwaCegarLoop]: 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-28 10:08:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 10:08:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2022-04-28 10:08:26,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:26,956 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-28 10:08:26,957 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-28 10:08:26,957 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-28 10:08:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:26,957 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-28 10:08:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-28 10:08:26,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:26,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:26,958 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-28 10:08:26,958 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-28 10:08:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:26,960 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-28 10:08:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-28 10:08:26,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:26,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:26,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:26,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:26,960 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-28 10:08:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 10:08:26,961 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-28 10:08:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:26,961 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 10:08:26,961 INFO L496 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-28 10:08:26,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 10:08:27,774 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-28 10:08:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 10:08:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:08:27,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:27,775 INFO L195 NwaCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:27,779 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-28 10:08:27,975 WARN L477 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-28 10:08:27,975 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash 461939116, now seen corresponding path program 157 times [2022-04-28 10:08:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:27,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1991095527] [2022-04-28 10:08:27,978 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:27,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash 461939116, now seen corresponding path program 158 times [2022-04-28 10:08:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:27,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296152039] [2022-04-28 10:08:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:28,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:28,305 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-28 10:08:28,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {48487#true} assume true; {48487#true} is VALID [2022-04-28 10:08:28,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48487#true} {48487#true} #50#return; {48487#true} is VALID [2022-04-28 10:08:28,306 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-28 10:08:28,306 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-28 10:08:28,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {48487#true} assume true; {48487#true} is VALID [2022-04-28 10:08:28,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48487#true} {48487#true} #50#return; {48487#true} is VALID [2022-04-28 10:08:28,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {48487#true} call #t~ret9 := main(); {48487#true} is VALID [2022-04-28 10:08:28,306 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-28 10:08:28,307 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-28 10:08:28,307 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-28 10:08:28,308 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-28 10:08:28,308 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-28 10:08:28,309 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-28 10:08:28,309 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-28 10:08:28,310 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-28 10:08:28,310 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-28 10:08:28,311 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-28 10:08:28,311 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-28 10:08:28,312 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-28 10:08:28,312 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-28 10:08:28,313 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-28 10:08:28,313 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-28 10:08:28,314 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-28 10:08:28,314 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-28 10:08:28,315 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-28 10:08:28,315 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-28 10:08:28,316 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-28 10:08:28,316 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-28 10:08:28,316 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-28 10:08:28,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {48488#false} ~cond := #in~cond; {48488#false} is VALID [2022-04-28 10:08:28,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {48488#false} assume 0 == ~cond; {48488#false} is VALID [2022-04-28 10:08:28,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {48488#false} assume !false; {48488#false} is VALID [2022-04-28 10:08:28,317 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-28 10:08:28,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296152039] [2022-04-28 10:08:28,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296152039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099136747] [2022-04-28 10:08:28,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:28,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:28,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:28,320 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-28 10:08:28,320 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-28 10:08:28,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:28,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:28,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:08:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:28,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:28,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {48487#true} call ULTIMATE.init(); {48487#true} is VALID [2022-04-28 10:08:28,652 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-28 10:08:28,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {48487#true} assume true; {48487#true} is VALID [2022-04-28 10:08:28,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48487#true} {48487#true} #50#return; {48487#true} is VALID [2022-04-28 10:08:28,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {48487#true} call #t~ret9 := main(); {48487#true} is VALID [2022-04-28 10:08:28,652 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-28 10:08:28,653 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-28 10:08:28,653 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-28 10:08:28,654 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-28 10:08:28,654 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-28 10:08:28,655 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-28 10:08:28,655 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-28 10:08:28,656 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-28 10:08:28,656 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-28 10:08:28,657 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-28 10:08:28,657 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-28 10:08:28,658 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-28 10:08:28,658 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-28 10:08:28,659 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-28 10:08:28,659 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-28 10:08:28,660 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-28 10:08:28,660 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-28 10:08:28,661 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-28 10:08:28,661 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-28 10:08:28,662 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-28 10:08:28,662 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-28 10:08:28,662 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-28 10:08:28,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {48488#false} ~cond := #in~cond; {48488#false} is VALID [2022-04-28 10:08:28,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {48488#false} assume 0 == ~cond; {48488#false} is VALID [2022-04-28 10:08:28,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {48488#false} assume !false; {48488#false} is VALID [2022-04-28 10:08:28,663 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-28 10:08:28,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:29,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {48488#false} assume !false; {48488#false} is VALID [2022-04-28 10:08:29,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {48488#false} assume 0 == ~cond; {48488#false} is VALID [2022-04-28 10:08:29,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {48488#false} ~cond := #in~cond; {48488#false} is VALID [2022-04-28 10:08:29,278 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-28 10:08:29,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {48615#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48488#false} is VALID [2022-04-28 10:08:29,279 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-28 10:08:29,279 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-28 10:08:29,280 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-28 10:08:29,280 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-28 10:08:29,281 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-28 10:08:29,281 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-28 10:08:29,282 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-28 10:08:29,283 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-28 10:08:29,283 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-28 10:08:29,284 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-28 10:08:29,285 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-28 10:08:29,285 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-28 10:08:29,286 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-28 10:08:29,286 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-28 10:08:29,287 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-28 10:08:29,288 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-28 10:08:29,288 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-28 10:08:29,289 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-28 10:08:29,290 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-28 10:08:29,290 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-28 10:08:29,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {48487#true} call #t~ret9 := main(); {48487#true} is VALID [2022-04-28 10:08:29,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48487#true} {48487#true} #50#return; {48487#true} is VALID [2022-04-28 10:08:29,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {48487#true} assume true; {48487#true} is VALID [2022-04-28 10:08:29,290 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-28 10:08:29,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {48487#true} call ULTIMATE.init(); {48487#true} is VALID [2022-04-28 10:08:29,290 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-28 10:08:29,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099136747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:29,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:29,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:08:29,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1991095527] [2022-04-28 10:08:29,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1991095527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:29,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:29,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:08:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215108631] [2022-04-28 10:08:29,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:29,291 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-28 10:08:29,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:29,291 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-28 10:08:29,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:29,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:08:29,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:29,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:08:29,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:08:29,310 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-28 10:08:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,314 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-28 10:08:33,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:08:33,314 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-28 10:08:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:33,314 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-28 10:08:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 77 transitions. [2022-04-28 10:08:33,315 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-28 10:08:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 77 transitions. [2022-04-28 10:08:33,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 77 transitions. [2022-04-28 10:08:33,375 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-28 10:08:33,376 INFO L225 Difference]: With dead ends: 101 [2022-04-28 10:08:33,376 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 10:08:33,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=822, Invalid=3210, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:08:33,377 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:33,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 133 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:08:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 10:08:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 48. [2022-04-28 10:08:33,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:33,847 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-28 10:08:33,847 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-28 10:08:33,847 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-28 10:08:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,848 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2022-04-28 10:08:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2022-04-28 10:08:33,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:33,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:33,848 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-28 10:08:33,848 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-28 10:08:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,849 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2022-04-28 10:08:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2022-04-28 10:08:33,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:33,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:33,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:33,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:33,849 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-28 10:08:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 10:08:33,850 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-28 10:08:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:33,850 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 10:08:33,850 INFO L496 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-28 10:08:33,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 10:08:34,573 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-28 10:08:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 10:08:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:08:34,573 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:34,573 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:34,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2022-04-28 10:08:34,774 WARN L477 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-28 10:08:34,774 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:34,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:34,774 INFO L85 PathProgramCache]: Analyzing trace with hash -122528469, now seen corresponding path program 159 times [2022-04-28 10:08:34,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:34,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [385475512] [2022-04-28 10:08:34,776 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:34,776 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash -122528469, now seen corresponding path program 160 times [2022-04-28 10:08:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:34,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463534189] [2022-04-28 10:08:34,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:34,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:35,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:35,078 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-28 10:08:35,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {49245#true} assume true; {49245#true} is VALID [2022-04-28 10:08:35,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49245#true} {49245#true} #50#return; {49245#true} is VALID [2022-04-28 10:08:35,079 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-28 10:08:35,079 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-28 10:08:35,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {49245#true} assume true; {49245#true} is VALID [2022-04-28 10:08:35,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49245#true} {49245#true} #50#return; {49245#true} is VALID [2022-04-28 10:08:35,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {49245#true} call #t~ret9 := main(); {49245#true} is VALID [2022-04-28 10:08:35,079 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-28 10:08:35,079 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-28 10:08:35,080 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-28 10:08:35,080 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-28 10:08:35,081 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-28 10:08:35,082 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-28 10:08:35,082 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-28 10:08:35,083 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-28 10:08:35,083 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-28 10:08:35,084 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-28 10:08:35,084 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-28 10:08:35,085 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-28 10:08:35,085 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-28 10:08:35,086 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-28 10:08:35,086 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-28 10:08:35,087 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-28 10:08:35,087 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-28 10:08:35,087 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-28 10:08:35,088 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-28 10:08:35,088 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-28 10:08:35,089 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-28 10:08:35,089 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-28 10:08:35,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {49246#false} ~cond := #in~cond; {49246#false} is VALID [2022-04-28 10:08:35,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {49246#false} assume 0 == ~cond; {49246#false} is VALID [2022-04-28 10:08:35,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {49246#false} assume !false; {49246#false} is VALID [2022-04-28 10:08:35,089 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-28 10:08:35,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:35,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463534189] [2022-04-28 10:08:35,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463534189] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:35,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545931656] [2022-04-28 10:08:35,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:35,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:35,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:35,090 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-28 10:08:35,091 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-28 10:08:35,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:35,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:35,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:08:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:35,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:35,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {49245#true} call ULTIMATE.init(); {49245#true} is VALID [2022-04-28 10:08:35,428 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-28 10:08:35,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {49245#true} assume true; {49245#true} is VALID [2022-04-28 10:08:35,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49245#true} {49245#true} #50#return; {49245#true} is VALID [2022-04-28 10:08:35,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {49245#true} call #t~ret9 := main(); {49245#true} is VALID [2022-04-28 10:08:35,428 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-28 10:08:35,428 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-28 10:08:35,429 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-28 10:08:35,429 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-28 10:08:35,430 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-28 10:08:35,430 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-28 10:08:35,431 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-28 10:08:35,431 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-28 10:08:35,432 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-28 10:08:35,432 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-28 10:08:35,433 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-28 10:08:35,434 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-28 10:08:35,434 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-28 10:08:35,435 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-28 10:08:35,435 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-28 10:08:35,436 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-28 10:08:35,436 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-28 10:08:35,436 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-28 10:08:35,437 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-28 10:08:35,437 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-28 10:08:35,438 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-28 10:08:35,438 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-28 10:08:35,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {49246#false} ~cond := #in~cond; {49246#false} is VALID [2022-04-28 10:08:35,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {49246#false} assume 0 == ~cond; {49246#false} is VALID [2022-04-28 10:08:35,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {49246#false} assume !false; {49246#false} is VALID [2022-04-28 10:08:35,438 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-28 10:08:35,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:36,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {49246#false} assume !false; {49246#false} is VALID [2022-04-28 10:08:36,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {49246#false} assume 0 == ~cond; {49246#false} is VALID [2022-04-28 10:08:36,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {49246#false} ~cond := #in~cond; {49246#false} is VALID [2022-04-28 10:08:36,075 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-28 10:08:36,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {49373#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {49246#false} is VALID [2022-04-28 10:08:36,076 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-28 10:08:36,077 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-28 10:08:36,077 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-28 10:08:36,078 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-28 10:08:36,078 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-28 10:08:36,079 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-28 10:08:36,080 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-28 10:08:36,080 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-28 10:08:36,081 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-28 10:08:36,081 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-28 10:08:36,082 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-28 10:08:36,083 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-28 10:08:36,083 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-28 10:08:36,084 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-28 10:08:36,085 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-28 10:08:36,085 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-28 10:08:36,086 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-28 10:08:36,087 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-28 10:08:36,087 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-28 10:08:36,088 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-28 10:08:36,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {49245#true} call #t~ret9 := main(); {49245#true} is VALID [2022-04-28 10:08:36,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49245#true} {49245#true} #50#return; {49245#true} is VALID [2022-04-28 10:08:36,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {49245#true} assume true; {49245#true} is VALID [2022-04-28 10:08:36,088 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-28 10:08:36,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {49245#true} call ULTIMATE.init(); {49245#true} is VALID [2022-04-28 10:08:36,088 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-28 10:08:36,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545931656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:36,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:36,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:08:36,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:36,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [385475512] [2022-04-28 10:08:36,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [385475512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:36,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:36,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:08:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745842221] [2022-04-28 10:08:36,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:36,089 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-28 10:08:36,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:36,089 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-28 10:08:36,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:36,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:08:36,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:36,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:08:36,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:08:36,114 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-28 10:08:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:40,239 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2022-04-28 10:08:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:08:40,239 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-28 10:08:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:40,239 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-28 10:08:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 80 transitions. [2022-04-28 10:08:40,240 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-28 10:08:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 80 transitions. [2022-04-28 10:08:40,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 80 transitions. [2022-04-28 10:08:40,307 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-28 10:08:40,309 INFO L225 Difference]: With dead ends: 104 [2022-04-28 10:08:40,309 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 10:08:40,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=808, Invalid=2974, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:08:40,309 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:40,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:08:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 10:08:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 48. [2022-04-28 10:08:40,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:40,793 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-28 10:08:40,793 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-28 10:08:40,794 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-28 10:08:40,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:40,794 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-04-28 10:08:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2022-04-28 10:08:40,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:40,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:40,795 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-28 10:08:40,795 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-28 10:08:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:40,795 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-04-28 10:08:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2022-04-28 10:08:40,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:40,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:40,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:40,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:40,796 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-28 10:08:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 10:08:40,796 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-28 10:08:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:40,796 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 10:08:40,796 INFO L496 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-28 10:08:40,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 10:08:41,557 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-28 10:08:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 10:08:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:08:41,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:41,557 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:41,573 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-28 10:08:41,757 WARN L477 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-28 10:08:41,758 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:41,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2075375052, now seen corresponding path program 33 times [2022-04-28 10:08:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:41,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [949126952] [2022-04-28 10:08:41,760 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:41,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2075375052, now seen corresponding path program 34 times [2022-04-28 10:08:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:41,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353614531] [2022-04-28 10:08:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:42,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:42,078 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-28 10:08:42,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {50011#true} assume true; {50011#true} is VALID [2022-04-28 10:08:42,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50011#true} {50011#true} #50#return; {50011#true} is VALID [2022-04-28 10:08:42,078 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-28 10:08:42,079 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-28 10:08:42,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {50011#true} assume true; {50011#true} is VALID [2022-04-28 10:08:42,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50011#true} {50011#true} #50#return; {50011#true} is VALID [2022-04-28 10:08:42,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {50011#true} call #t~ret9 := main(); {50011#true} is VALID [2022-04-28 10:08:42,079 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-28 10:08:42,080 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-28 10:08:42,080 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-28 10:08:42,081 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-28 10:08:42,082 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-28 10:08:42,082 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-28 10:08:42,083 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-28 10:08:42,084 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-28 10:08:42,084 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-28 10:08:42,085 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-28 10:08:42,086 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-28 10:08:42,086 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-28 10:08:42,087 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-28 10:08:42,088 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-28 10:08:42,088 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-28 10:08:42,089 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-28 10:08:42,090 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-28 10:08:42,090 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-28 10:08:42,091 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-28 10:08:42,091 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-28 10:08:42,092 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-28 10:08:42,092 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-28 10:08:42,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {50012#false} ~cond := #in~cond; {50012#false} is VALID [2022-04-28 10:08:42,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {50012#false} assume 0 == ~cond; {50012#false} is VALID [2022-04-28 10:08:42,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {50012#false} assume !false; {50012#false} is VALID [2022-04-28 10:08:42,092 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-28 10:08:42,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:42,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353614531] [2022-04-28 10:08:42,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353614531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:42,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942655201] [2022-04-28 10:08:42,093 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:42,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:42,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:42,094 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-28 10:08:42,095 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-28 10:08:42,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:42,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:42,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:08:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:42,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:42,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {50011#true} call ULTIMATE.init(); {50011#true} is VALID [2022-04-28 10:08:42,437 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-28 10:08:42,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {50011#true} assume true; {50011#true} is VALID [2022-04-28 10:08:42,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50011#true} {50011#true} #50#return; {50011#true} is VALID [2022-04-28 10:08:42,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {50011#true} call #t~ret9 := main(); {50011#true} is VALID [2022-04-28 10:08:42,437 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-28 10:08:42,438 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-28 10:08:42,438 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-28 10:08:42,439 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-28 10:08:42,439 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-28 10:08:42,440 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-28 10:08:42,440 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-28 10:08:42,441 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-28 10:08:42,441 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-28 10:08:42,442 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-28 10:08:42,442 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-28 10:08:42,443 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-28 10:08:42,443 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-28 10:08:42,444 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-28 10:08:42,444 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-28 10:08:42,445 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-28 10:08:42,445 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-28 10:08:42,446 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-28 10:08:42,446 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-28 10:08:42,447 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-28 10:08:42,447 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-28 10:08:42,447 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-28 10:08:42,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {50012#false} ~cond := #in~cond; {50012#false} is VALID [2022-04-28 10:08:42,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {50012#false} assume 0 == ~cond; {50012#false} is VALID [2022-04-28 10:08:42,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {50012#false} assume !false; {50012#false} is VALID [2022-04-28 10:08:42,447 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-28 10:08:42,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:43,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {50012#false} assume !false; {50012#false} is VALID [2022-04-28 10:08:43,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {50012#false} assume 0 == ~cond; {50012#false} is VALID [2022-04-28 10:08:43,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {50012#false} ~cond := #in~cond; {50012#false} is VALID [2022-04-28 10:08:43,088 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-28 10:08:43,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {50139#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {50012#false} is VALID [2022-04-28 10:08:43,089 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-28 10:08:43,089 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-28 10:08:43,090 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-28 10:08:43,090 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-28 10:08:43,091 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-28 10:08:43,091 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-28 10:08:43,092 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-28 10:08:43,093 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-28 10:08:43,093 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-28 10:08:43,094 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-28 10:08:43,095 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-28 10:08:43,095 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-28 10:08:43,096 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-28 10:08:43,096 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-28 10:08:43,097 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-28 10:08:43,098 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-28 10:08:43,098 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-28 10:08:43,099 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-28 10:08:43,100 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-28 10:08:43,100 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-28 10:08:43,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {50011#true} call #t~ret9 := main(); {50011#true} is VALID [2022-04-28 10:08:43,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50011#true} {50011#true} #50#return; {50011#true} is VALID [2022-04-28 10:08:43,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {50011#true} assume true; {50011#true} is VALID [2022-04-28 10:08:43,100 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-28 10:08:43,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {50011#true} call ULTIMATE.init(); {50011#true} is VALID [2022-04-28 10:08:43,100 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-28 10:08:43,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942655201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:43,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:43,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:08:43,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:43,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [949126952] [2022-04-28 10:08:43,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [949126952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:43,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:43,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:08:43,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913163987] [2022-04-28 10:08:43,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:43,101 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-28 10:08:43,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:43,101 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-28 10:08:43,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:43,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:08:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:08:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:08:43,120 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-28 10:08:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,474 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2022-04-28 10:08:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:08:47,475 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-28 10:08:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:47,475 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-28 10:08:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-28 10:08:47,475 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-28 10:08:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-28 10:08:47,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 84 transitions. [2022-04-28 10:08:47,540 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-28 10:08:47,541 INFO L225 Difference]: With dead ends: 109 [2022-04-28 10:08:47,541 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 10:08:47,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:08:47,542 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 80 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:47,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 141 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:08:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 10:08:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 50. [2022-04-28 10:08:48,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:48,013 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-28 10:08:48,013 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-28 10:08:48,013 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-28 10:08:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:48,014 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-04-28 10:08:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2022-04-28 10:08:48,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:48,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:48,015 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-28 10:08:48,015 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-28 10:08:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:48,015 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-04-28 10:08:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2022-04-28 10:08:48,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:48,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:48,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:48,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:48,016 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-28 10:08:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-04-28 10:08:48,016 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 30 [2022-04-28 10:08:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:48,016 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-04-28 10:08:48,016 INFO L496 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-28 10:08:48,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 60 transitions. [2022-04-28 10:08:48,768 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-28 10:08:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-28 10:08:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:08:48,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:48,768 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:48,784 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-28 10:08:48,968 WARN L477 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-28 10:08:48,969 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 187068054, now seen corresponding path program 161 times [2022-04-28 10:08:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:48,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [763787954] [2022-04-28 10:08:48,971 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:48,971 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:48,971 INFO L85 PathProgramCache]: Analyzing trace with hash 187068054, now seen corresponding path program 162 times [2022-04-28 10:08:48,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:48,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032173803] [2022-04-28 10:08:48,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:48,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:49,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:49,852 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-28 10:08:49,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {50799#true} assume true; {50799#true} is VALID [2022-04-28 10:08:49,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50799#true} {50799#true} #50#return; {50799#true} is VALID [2022-04-28 10:08:49,853 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-28 10:08:49,853 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-28 10:08:49,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {50799#true} assume true; {50799#true} is VALID [2022-04-28 10:08:49,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50799#true} {50799#true} #50#return; {50799#true} is VALID [2022-04-28 10:08:49,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {50799#true} call #t~ret9 := main(); {50799#true} is VALID [2022-04-28 10:08:49,853 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-28 10:08:49,854 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-28 10:08:49,855 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-28 10:08:49,856 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-28 10:08:49,857 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-28 10:08:49,858 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-28 10:08:49,859 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-28 10:08:49,860 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-28 10:08:49,861 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-28 10:08:49,863 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-28 10:08:49,864 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-28 10:08:49,865 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-28 10:08:49,866 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-28 10:08:49,867 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-28 10:08:49,868 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-28 10:08:49,870 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-28 10:08:49,871 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-28 10:08:49,872 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-28 10:08:49,873 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-28 10:08:49,875 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-28 10:08:49,876 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-28 10:08:49,876 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-28 10:08:49,877 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-28 10:08:49,877 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-28 10:08:49,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {50825#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {50800#false} is VALID [2022-04-28 10:08:49,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {50800#false} assume !false; {50800#false} is VALID [2022-04-28 10:08:49,878 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-28 10:08:49,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:49,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032173803] [2022-04-28 10:08:49,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032173803] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:49,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369210359] [2022-04-28 10:08:49,878 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:49,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:49,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:49,879 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-28 10:08:49,880 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-28 10:08:50,213 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:08:50,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:50,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 10:08:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:50,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:51,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {50799#true} call ULTIMATE.init(); {50799#true} is VALID [2022-04-28 10:08:51,733 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-28 10:08:51,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {50799#true} assume true; {50799#true} is VALID [2022-04-28 10:08:51,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50799#true} {50799#true} #50#return; {50799#true} is VALID [2022-04-28 10:08:51,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {50799#true} call #t~ret9 := main(); {50799#true} is VALID [2022-04-28 10:08:51,733 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-28 10:08:51,734 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-28 10:08:51,735 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-28 10:08:51,736 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-28 10:08:51,737 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-28 10:08:51,738 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-28 10:08:51,739 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-28 10:08:51,739 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-28 10:08:51,740 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-28 10:08:51,741 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-28 10:08:51,742 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-28 10:08:51,742 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-28 10:08:51,743 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-28 10:08:51,744 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-28 10:08:51,744 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-28 10:08:51,745 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-28 10:08:51,746 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-28 10:08:51,747 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-28 10:08:51,748 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-28 10:08:51,749 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-28 10:08:51,749 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-28 10:08:51,750 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-28 10:08:51,751 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-28 10:08:51,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {50920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:51,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {50924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50800#false} is VALID [2022-04-28 10:08:51,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {50800#false} assume !false; {50800#false} is VALID [2022-04-28 10:08:51,752 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-28 10:08:51,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:52,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {50800#false} assume !false; {50800#false} is VALID [2022-04-28 10:08:52,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {50924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50800#false} is VALID [2022-04-28 10:08:52,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {50920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:52,435 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-28 10:08:52,435 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-28 10:08:52,436 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-28 10:08:52,437 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-28 10:08:52,437 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-28 10:08:52,438 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-28 10:08:52,439 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-28 10:08:52,440 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-28 10:08:52,440 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-28 10:08:52,441 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-28 10:08:52,442 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-28 10:08:52,442 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-28 10:08:52,442 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-28 10:08:52,443 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-28 10:08:52,444 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-28 10:08:52,445 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-28 10:08:52,445 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-28 10:08:52,446 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-28 10:08:52,447 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-28 10:08:52,447 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-28 10:08:52,448 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-28 10:08:52,449 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-28 10:08:52,449 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-28 10:08:52,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {50799#true} call #t~ret9 := main(); {50799#true} is VALID [2022-04-28 10:08:52,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50799#true} {50799#true} #50#return; {50799#true} is VALID [2022-04-28 10:08:52,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {50799#true} assume true; {50799#true} is VALID [2022-04-28 10:08:52,449 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-28 10:08:52,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {50799#true} call ULTIMATE.init(); {50799#true} is VALID [2022-04-28 10:08:52,450 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-28 10:08:52,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369210359] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:52,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:52,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 15] total 47 [2022-04-28 10:08:52,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:52,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [763787954] [2022-04-28 10:08:52,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [763787954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:52,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:52,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:08:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011091657] [2022-04-28 10:08:52,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:52,450 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-28 10:08:52,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:52,451 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-28 10:08:52,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:52,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:08:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:08:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2007, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:08:52,499 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-28 10:08:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:55,455 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-28 10:08:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:08:55,455 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-28 10:08:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:55,455 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-28 10:08:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. [2022-04-28 10:08:55,455 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-28 10:08:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. [2022-04-28 10:08:55,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 42 transitions. [2022-04-28 10:08:55,503 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-28 10:08:55,504 INFO L225 Difference]: With dead ends: 64 [2022-04-28 10:08:55,504 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 10:08:55,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=297, Invalid=4259, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:08:55,505 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:55,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:08:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 10:08:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2022-04-28 10:08:56,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:56,073 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-28 10:08:56,073 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-28 10:08:56,073 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-28 10:08:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:56,074 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 10:08:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 10:08:56,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:56,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:56,074 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-28 10:08:56,074 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-28 10:08:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:56,075 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 10:08:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 10:08:56,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:56,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:56,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:56,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:56,075 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-28 10:08:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 10:08:56,075 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-28 10:08:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:56,076 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 10:08:56,076 INFO L496 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-28 10:08:56,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 10:08:57,227 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-28 10:08:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:08:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:08:57,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:57,228 INFO L195 NwaCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:57,232 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-28 10:08:57,429 WARN L477 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-28 10:08:57,429 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:57,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1034316233, now seen corresponding path program 163 times [2022-04-28 10:08:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:57,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1920515797] [2022-04-28 10:08:57,431 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:57,431 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1034316233, now seen corresponding path program 164 times [2022-04-28 10:08:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:57,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409440779] [2022-04-28 10:08:57,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:57,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:57,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:57,793 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-28 10:08:57,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {51424#true} assume true; {51424#true} is VALID [2022-04-28 10:08:57,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51424#true} {51424#true} #50#return; {51424#true} is VALID [2022-04-28 10:08:57,794 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-28 10:08:57,794 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-28 10:08:57,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {51424#true} assume true; {51424#true} is VALID [2022-04-28 10:08:57,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51424#true} {51424#true} #50#return; {51424#true} is VALID [2022-04-28 10:08:57,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {51424#true} call #t~ret9 := main(); {51424#true} is VALID [2022-04-28 10:08:57,794 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-28 10:08:57,795 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-28 10:08:57,795 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-28 10:08:57,796 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-28 10:08:57,796 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-28 10:08:57,797 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-28 10:08:57,797 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-28 10:08:57,798 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-28 10:08:57,798 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-28 10:08:57,799 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-28 10:08:57,799 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-28 10:08:57,800 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-28 10:08:57,800 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-28 10:08:57,801 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-28 10:08:57,801 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-28 10:08:57,802 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-28 10:08:57,802 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-28 10:08:57,803 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-28 10:08:57,803 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-28 10:08:57,804 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-28 10:08:57,804 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-28 10:08:57,805 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-28 10:08:57,805 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-28 10:08:57,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {51425#false} ~cond := #in~cond; {51425#false} is VALID [2022-04-28 10:08:57,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {51425#false} assume 0 == ~cond; {51425#false} is VALID [2022-04-28 10:08:57,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {51425#false} assume !false; {51425#false} is VALID [2022-04-28 10:08:57,805 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-28 10:08:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409440779] [2022-04-28 10:08:57,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409440779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131298736] [2022-04-28 10:08:57,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:57,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:57,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:57,806 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-28 10:08:57,807 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-28 10:08:57,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:57,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:57,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:08:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:57,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:58,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {51424#true} call ULTIMATE.init(); {51424#true} is VALID [2022-04-28 10:08:58,146 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-28 10:08:58,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {51424#true} assume true; {51424#true} is VALID [2022-04-28 10:08:58,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51424#true} {51424#true} #50#return; {51424#true} is VALID [2022-04-28 10:08:58,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {51424#true} call #t~ret9 := main(); {51424#true} is VALID [2022-04-28 10:08:58,146 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-28 10:08:58,146 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-28 10:08:58,147 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-28 10:08:58,147 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-28 10:08:58,148 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-28 10:08:58,149 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-28 10:08:58,149 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-28 10:08:58,150 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-28 10:08:58,150 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-28 10:08:58,151 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-28 10:08:58,151 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-28 10:08:58,152 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-28 10:08:58,152 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-28 10:08:58,153 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-28 10:08:58,153 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-28 10:08:58,154 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-28 10:08:58,154 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-28 10:08:58,155 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-28 10:08:58,155 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-28 10:08:58,156 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-28 10:08:58,156 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-28 10:08:58,157 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-28 10:08:58,157 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-28 10:08:58,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {51425#false} ~cond := #in~cond; {51425#false} is VALID [2022-04-28 10:08:58,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {51425#false} assume 0 == ~cond; {51425#false} is VALID [2022-04-28 10:08:58,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {51425#false} assume !false; {51425#false} is VALID [2022-04-28 10:08:58,157 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-28 10:08:58,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:58,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {51425#false} assume !false; {51425#false} is VALID [2022-04-28 10:08:58,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {51425#false} assume 0 == ~cond; {51425#false} is VALID [2022-04-28 10:08:58,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {51425#false} ~cond := #in~cond; {51425#false} is VALID [2022-04-28 10:08:58,886 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-28 10:08:58,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {51556#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {51425#false} is VALID [2022-04-28 10:08:58,887 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-28 10:08:58,888 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-28 10:08:58,889 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-28 10:08:58,889 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-28 10:08:58,890 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-28 10:08:58,891 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-28 10:08:58,891 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-28 10:08:58,892 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-28 10:08:58,892 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-28 10:08:58,893 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-28 10:08:58,893 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-28 10:08:58,894 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-28 10:08:58,895 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-28 10:08:58,895 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-28 10:08:58,896 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-28 10:08:58,897 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-28 10:08:58,897 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-28 10:08:58,898 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-28 10:08:58,899 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-28 10:08:58,899 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-28 10:08:58,900 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-28 10:08:58,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {51424#true} call #t~ret9 := main(); {51424#true} is VALID [2022-04-28 10:08:58,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51424#true} {51424#true} #50#return; {51424#true} is VALID [2022-04-28 10:08:58,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {51424#true} assume true; {51424#true} is VALID [2022-04-28 10:08:58,900 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-28 10:08:58,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {51424#true} call ULTIMATE.init(); {51424#true} is VALID [2022-04-28 10:08:58,900 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-28 10:08:58,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131298736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:58,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:58,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:08:58,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:58,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1920515797] [2022-04-28 10:08:58,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1920515797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:58,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:58,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:08:58,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740982291] [2022-04-28 10:08:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:58,901 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-28 10:08:58,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:58,901 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-28 10:08:58,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:58,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:08:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:58,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:08:58,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1610, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:08:58,923 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-28 10:09:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,808 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-04-28 10:09:01,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:09:01,809 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-28 10:09:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:01,809 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-28 10:09:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2022-04-28 10:09:01,809 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-28 10:09:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2022-04-28 10:09:01,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 58 transitions. [2022-04-28 10:09:01,853 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-28 10:09:01,854 INFO L225 Difference]: With dead ends: 76 [2022-04-28 10:09:01,854 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 10:09:01,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=884, Invalid=4228, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 10:09:01,855 INFO L413 NwaCegarLoop]: 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-28 10:09:01,855 INFO L414 NwaCegarLoop]: 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-28 10:09:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 10:09:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2022-04-28 10:09:02,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:02,409 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-28 10:09:02,409 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-28 10:09:02,409 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-28 10:09:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:02,410 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-28 10:09:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-28 10:09:02,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:02,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:02,410 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-28 10:09:02,410 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-28 10:09:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:02,411 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-28 10:09:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-28 10:09:02,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:02,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:02,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:02,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:02,411 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-28 10:09:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 10:09:02,411 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-28 10:09:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:02,411 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 10:09:02,411 INFO L496 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-28 10:09:02,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 10:09:03,324 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-28 10:09:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:09:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:03,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:03,325 INFO L195 NwaCegarLoop]: trace histogram [11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:03,340 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-28 10:09:03,525 WARN L477 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-28 10:09:03,525 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:03,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash -935168394, now seen corresponding path program 165 times [2022-04-28 10:09:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:03,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946323350] [2022-04-28 10:09:03,527 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:03,527 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash -935168394, now seen corresponding path program 166 times [2022-04-28 10:09:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:03,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111988602] [2022-04-28 10:09:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,856 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-28 10:09:03,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {52108#true} assume true; {52108#true} is VALID [2022-04-28 10:09:03,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52108#true} {52108#true} #50#return; {52108#true} is VALID [2022-04-28 10:09:03,856 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-28 10:09:03,856 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-28 10:09:03,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {52108#true} assume true; {52108#true} is VALID [2022-04-28 10:09:03,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52108#true} {52108#true} #50#return; {52108#true} is VALID [2022-04-28 10:09:03,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {52108#true} call #t~ret9 := main(); {52108#true} is VALID [2022-04-28 10:09:03,857 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-28 10:09:03,857 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-28 10:09:03,858 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-28 10:09:03,858 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-28 10:09:03,859 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-28 10:09:03,859 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-28 10:09:03,860 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-28 10:09:03,860 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-28 10:09:03,861 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-28 10:09:03,861 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-28 10:09:03,862 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-28 10:09:03,862 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-28 10:09:03,863 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-28 10:09:03,863 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-28 10:09:03,864 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-28 10:09:03,864 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-28 10:09:03,865 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-28 10:09:03,865 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-28 10:09:03,866 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-28 10:09:03,866 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-28 10:09:03,867 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-28 10:09:03,867 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-28 10:09:03,867 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-28 10:09:03,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {52109#false} ~cond := #in~cond; {52109#false} is VALID [2022-04-28 10:09:03,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {52109#false} assume 0 == ~cond; {52109#false} is VALID [2022-04-28 10:09:03,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {52109#false} assume !false; {52109#false} is VALID [2022-04-28 10:09:03,867 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-28 10:09:03,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:03,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111988602] [2022-04-28 10:09:03,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111988602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:03,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416976806] [2022-04-28 10:09:03,878 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:03,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:03,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:03,879 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-28 10:09:03,879 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-28 10:09:03,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:03,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:03,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:09:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:04,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {52108#true} call ULTIMATE.init(); {52108#true} is VALID [2022-04-28 10:09:04,225 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-28 10:09:04,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {52108#true} assume true; {52108#true} is VALID [2022-04-28 10:09:04,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52108#true} {52108#true} #50#return; {52108#true} is VALID [2022-04-28 10:09:04,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {52108#true} call #t~ret9 := main(); {52108#true} is VALID [2022-04-28 10:09:04,226 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-28 10:09:04,226 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-28 10:09:04,227 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-28 10:09:04,227 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-28 10:09:04,228 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-28 10:09:04,228 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-28 10:09:04,229 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-28 10:09:04,229 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-28 10:09:04,230 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-28 10:09:04,230 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-28 10:09:04,231 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-28 10:09:04,231 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-28 10:09:04,232 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-28 10:09:04,232 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-28 10:09:04,233 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-28 10:09:04,233 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-28 10:09:04,234 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-28 10:09:04,234 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-28 10:09:04,235 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-28 10:09:04,235 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-28 10:09:04,236 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-28 10:09:04,236 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-28 10:09:04,236 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-28 10:09:04,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {52109#false} ~cond := #in~cond; {52109#false} is VALID [2022-04-28 10:09:04,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {52109#false} assume 0 == ~cond; {52109#false} is VALID [2022-04-28 10:09:04,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {52109#false} assume !false; {52109#false} is VALID [2022-04-28 10:09:04,236 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-28 10:09:04,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:04,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {52109#false} assume !false; {52109#false} is VALID [2022-04-28 10:09:04,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {52109#false} assume 0 == ~cond; {52109#false} is VALID [2022-04-28 10:09:04,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {52109#false} ~cond := #in~cond; {52109#false} is VALID [2022-04-28 10:09:04,876 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-28 10:09:04,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {52240#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {52109#false} is VALID [2022-04-28 10:09:04,877 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-28 10:09:04,877 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-28 10:09:04,878 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-28 10:09:04,879 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-28 10:09:04,880 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-28 10:09:04,880 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-28 10:09:04,881 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-28 10:09:04,881 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-28 10:09:04,882 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-28 10:09:04,882 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-28 10:09:04,883 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-28 10:09:04,883 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-28 10:09:04,884 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-28 10:09:04,885 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-28 10:09:04,886 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-28 10:09:04,886 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-28 10:09:04,887 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-28 10:09:04,888 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-28 10:09:04,888 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-28 10:09:04,889 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-28 10:09:04,889 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-28 10:09:04,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {52108#true} call #t~ret9 := main(); {52108#true} is VALID [2022-04-28 10:09:04,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52108#true} {52108#true} #50#return; {52108#true} is VALID [2022-04-28 10:09:04,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {52108#true} assume true; {52108#true} is VALID [2022-04-28 10:09:04,889 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-28 10:09:04,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {52108#true} call ULTIMATE.init(); {52108#true} is VALID [2022-04-28 10:09:04,890 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-28 10:09:04,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416976806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:04,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:04,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:09:04,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:04,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946323350] [2022-04-28 10:09:04,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946323350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:04,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:04,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:04,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823821525] [2022-04-28 10:09:04,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:04,890 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-28 10:09:04,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:04,891 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-28 10:09:04,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:04,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:04,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:04,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:04,911 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-28 10:09:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:08,765 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-04-28 10:09:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 10:09:08,765 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-28 10:09:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:08,765 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-28 10:09:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 68 transitions. [2022-04-28 10:09:08,765 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-28 10:09:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 68 transitions. [2022-04-28 10:09:08,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 68 transitions. [2022-04-28 10:09:08,820 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-28 10:09:08,821 INFO L225 Difference]: With dead ends: 85 [2022-04-28 10:09:08,821 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 10:09:08,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1038, Invalid=4814, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 10:09:08,822 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:08,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 122 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:09:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 10:09:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2022-04-28 10:09:09,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:09,396 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-28 10:09:09,396 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-28 10:09:09,396 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-28 10:09:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:09,397 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-28 10:09:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-04-28 10:09:09,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:09,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:09,397 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-28 10:09:09,397 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-28 10:09:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:09,398 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-28 10:09:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-04-28 10:09:09,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:09,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:09,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:09,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:09,398 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-28 10:09:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 10:09:09,399 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-28 10:09:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:09,399 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 10:09:09,399 INFO L496 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-28 10:09:09,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 10:09:10,376 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-28 10:09:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:09:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:10,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:10,376 INFO L195 NwaCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:10,392 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-28 10:09:10,577 WARN L477 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-28 10:09:10,577 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1347612073, now seen corresponding path program 167 times [2022-04-28 10:09:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:10,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1727948661] [2022-04-28 10:09:10,579 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:10,579 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1347612073, now seen corresponding path program 168 times [2022-04-28 10:09:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:10,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441608255] [2022-04-28 10:09:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:10,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:10,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:10,934 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-28 10:09:10,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {52838#true} assume true; {52838#true} is VALID [2022-04-28 10:09:10,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52838#true} {52838#true} #50#return; {52838#true} is VALID [2022-04-28 10:09:10,934 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-28 10:09:10,934 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-28 10:09:10,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {52838#true} assume true; {52838#true} is VALID [2022-04-28 10:09:10,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52838#true} {52838#true} #50#return; {52838#true} is VALID [2022-04-28 10:09:10,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {52838#true} call #t~ret9 := main(); {52838#true} is VALID [2022-04-28 10:09:10,935 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-28 10:09:10,935 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-28 10:09:10,936 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-28 10:09:10,936 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-28 10:09:10,937 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-28 10:09:10,937 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-28 10:09:10,938 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-28 10:09:10,938 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-28 10:09:10,939 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-28 10:09:10,939 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-28 10:09:10,940 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-28 10:09:10,940 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-28 10:09:10,941 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-28 10:09:10,941 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-28 10:09:10,942 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-28 10:09:10,942 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-28 10:09:10,943 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-28 10:09:10,943 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-28 10:09:10,944 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-28 10:09:10,944 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-28 10:09:10,945 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-28 10:09:10,945 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-28 10:09:10,945 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-28 10:09:10,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {52839#false} ~cond := #in~cond; {52839#false} is VALID [2022-04-28 10:09:10,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {52839#false} assume 0 == ~cond; {52839#false} is VALID [2022-04-28 10:09:10,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {52839#false} assume !false; {52839#false} is VALID [2022-04-28 10:09:10,946 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-28 10:09:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:10,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441608255] [2022-04-28 10:09:10,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441608255] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:10,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230954578] [2022-04-28 10:09:10,946 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:10,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:10,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:10,947 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-28 10:09:10,948 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-28 10:09:11,070 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:09:11,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:11,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:09:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:11,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:11,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {52838#true} call ULTIMATE.init(); {52838#true} is VALID [2022-04-28 10:09:11,374 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-28 10:09:11,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {52838#true} assume true; {52838#true} is VALID [2022-04-28 10:09:11,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52838#true} {52838#true} #50#return; {52838#true} is VALID [2022-04-28 10:09:11,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {52838#true} call #t~ret9 := main(); {52838#true} is VALID [2022-04-28 10:09:11,375 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-28 10:09:11,375 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-28 10:09:11,375 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-28 10:09:11,376 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-28 10:09:11,376 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-28 10:09:11,377 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-28 10:09:11,378 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-28 10:09:11,378 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-28 10:09:11,379 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-28 10:09:11,379 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-28 10:09:11,380 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-28 10:09:11,380 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-28 10:09:11,381 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-28 10:09:11,381 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-28 10:09:11,381 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-28 10:09:11,382 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-28 10:09:11,382 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-28 10:09:11,383 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-28 10:09:11,383 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-28 10:09:11,384 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-28 10:09:11,384 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-28 10:09:11,385 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-28 10:09:11,385 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-28 10:09:11,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {52839#false} ~cond := #in~cond; {52839#false} is VALID [2022-04-28 10:09:11,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {52839#false} assume 0 == ~cond; {52839#false} is VALID [2022-04-28 10:09:11,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {52839#false} assume !false; {52839#false} is VALID [2022-04-28 10:09:11,385 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-28 10:09:11,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:12,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {52839#false} assume !false; {52839#false} is VALID [2022-04-28 10:09:12,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {52839#false} assume 0 == ~cond; {52839#false} is VALID [2022-04-28 10:09:12,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {52839#false} ~cond := #in~cond; {52839#false} is VALID [2022-04-28 10:09:12,046 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-28 10:09:12,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {52970#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {52839#false} is VALID [2022-04-28 10:09:12,047 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-28 10:09:12,048 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-28 10:09:12,049 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-28 10:09:12,050 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-28 10:09:12,050 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-28 10:09:12,051 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-28 10:09:12,051 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-28 10:09:12,052 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-28 10:09:12,052 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-28 10:09:12,053 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-28 10:09:12,053 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-28 10:09:12,054 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-28 10:09:12,055 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-28 10:09:12,056 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-28 10:09:12,056 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-28 10:09:12,057 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-28 10:09:12,058 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-28 10:09:12,058 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-28 10:09:12,059 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-28 10:09:12,059 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-28 10:09:12,060 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-28 10:09:12,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {52838#true} call #t~ret9 := main(); {52838#true} is VALID [2022-04-28 10:09:12,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52838#true} {52838#true} #50#return; {52838#true} is VALID [2022-04-28 10:09:12,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {52838#true} assume true; {52838#true} is VALID [2022-04-28 10:09:12,060 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-28 10:09:12,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {52838#true} call ULTIMATE.init(); {52838#true} is VALID [2022-04-28 10:09:12,060 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-28 10:09:12,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230954578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:12,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:12,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:09:12,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:12,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1727948661] [2022-04-28 10:09:12,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1727948661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:12,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:12,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713541192] [2022-04-28 10:09:12,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:12,061 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-28 10:09:12,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:12,061 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-28 10:09:12,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:12,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:12,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:12,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:12,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:12,083 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-28 10:09:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,216 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2022-04-28 10:09:16,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:09:16,216 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-28 10:09:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:16,216 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-28 10:09:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 75 transitions. [2022-04-28 10:09:16,217 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-28 10:09:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 75 transitions. [2022-04-28 10:09:16,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 75 transitions. [2022-04-28 10:09:16,286 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-28 10:09:16,287 INFO L225 Difference]: With dead ends: 93 [2022-04-28 10:09:16,287 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 10:09:16,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1126, Invalid=5036, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 10:09:16,287 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:16,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 100 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:09:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 10:09:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 51. [2022-04-28 10:09:16,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:16,863 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-28 10:09:16,863 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-28 10:09:16,863 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-28 10:09:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,864 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-04-28 10:09:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-04-28 10:09:16,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,864 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-28 10:09:16,864 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-28 10:09:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,865 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-04-28 10:09:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-04-28 10:09:16,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:16,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:16,865 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-28 10:09:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 10:09:16,865 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-28 10:09:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:16,866 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 10:09:16,866 INFO L496 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-28 10:09:16,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 10:09:17,900 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-28 10:09:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:09:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:17,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:17,901 INFO L195 NwaCegarLoop]: trace histogram [13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:17,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:18,101 WARN L477 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-28 10:09:18,101 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:18,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:18,101 INFO L85 PathProgramCache]: Analyzing trace with hash 578745942, now seen corresponding path program 169 times [2022-04-28 10:09:18,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:18,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1722101893] [2022-04-28 10:09:18,104 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:18,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash 578745942, now seen corresponding path program 170 times [2022-04-28 10:09:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:18,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351720336] [2022-04-28 10:09:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,445 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-28 10:09:18,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-04-28 10:09:18,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53604#true} {53604#true} #50#return; {53604#true} is VALID [2022-04-28 10:09:18,446 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-28 10:09:18,446 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-28 10:09:18,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-04-28 10:09:18,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53604#true} {53604#true} #50#return; {53604#true} is VALID [2022-04-28 10:09:18,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {53604#true} call #t~ret9 := main(); {53604#true} is VALID [2022-04-28 10:09:18,446 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-28 10:09:18,446 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-28 10:09:18,447 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-28 10:09:18,447 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-28 10:09:18,448 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-28 10:09:18,448 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-28 10:09:18,449 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-28 10:09:18,450 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-28 10:09:18,450 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-28 10:09:18,451 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-28 10:09:18,451 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-28 10:09:18,452 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-28 10:09:18,452 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-28 10:09:18,453 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-28 10:09:18,453 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-28 10:09:18,453 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-28 10:09:18,454 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-28 10:09:18,454 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-28 10:09:18,455 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-28 10:09:18,455 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-28 10:09:18,456 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-28 10:09:18,456 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-28 10:09:18,456 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-28 10:09:18,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {53605#false} ~cond := #in~cond; {53605#false} is VALID [2022-04-28 10:09:18,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {53605#false} assume 0 == ~cond; {53605#false} is VALID [2022-04-28 10:09:18,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {53605#false} assume !false; {53605#false} is VALID [2022-04-28 10:09:18,457 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-28 10:09:18,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:18,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351720336] [2022-04-28 10:09:18,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351720336] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:18,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25192449] [2022-04-28 10:09:18,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:18,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:18,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:18,458 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-28 10:09:18,458 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-28 10:09:18,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:18,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:18,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:09:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:18,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {53604#true} call ULTIMATE.init(); {53604#true} is VALID [2022-04-28 10:09:18,814 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-28 10:09:18,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-04-28 10:09:18,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53604#true} {53604#true} #50#return; {53604#true} is VALID [2022-04-28 10:09:18,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {53604#true} call #t~ret9 := main(); {53604#true} is VALID [2022-04-28 10:09:18,815 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-28 10:09:18,815 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-28 10:09:18,816 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-28 10:09:18,816 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-28 10:09:18,817 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-28 10:09:18,817 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-28 10:09:18,818 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-28 10:09:18,818 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-28 10:09:18,819 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-28 10:09:18,819 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-28 10:09:18,820 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-28 10:09:18,820 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-28 10:09:18,821 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-28 10:09:18,821 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-28 10:09:18,822 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-28 10:09:18,822 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-28 10:09:18,823 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-28 10:09:18,823 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-28 10:09:18,824 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-28 10:09:18,824 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-28 10:09:18,825 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-28 10:09:18,825 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-28 10:09:18,825 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-28 10:09:18,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {53605#false} ~cond := #in~cond; {53605#false} is VALID [2022-04-28 10:09:18,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {53605#false} assume 0 == ~cond; {53605#false} is VALID [2022-04-28 10:09:18,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {53605#false} assume !false; {53605#false} is VALID [2022-04-28 10:09:18,825 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-28 10:09:18,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:19,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {53605#false} assume !false; {53605#false} is VALID [2022-04-28 10:09:19,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {53605#false} assume 0 == ~cond; {53605#false} is VALID [2022-04-28 10:09:19,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {53605#false} ~cond := #in~cond; {53605#false} is VALID [2022-04-28 10:09:19,482 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-28 10:09:19,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {53736#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53605#false} is VALID [2022-04-28 10:09:19,483 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-28 10:09:19,483 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-28 10:09:19,484 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-28 10:09:19,485 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-28 10:09:19,485 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-28 10:09:19,486 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-28 10:09:19,486 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-28 10:09:19,487 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-28 10:09:19,487 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-28 10:09:19,488 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-28 10:09:19,489 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-28 10:09:19,489 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-28 10:09:19,490 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-28 10:09:19,491 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-28 10:09:19,491 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-28 10:09:19,492 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-28 10:09:19,493 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-28 10:09:19,493 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-28 10:09:19,494 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-28 10:09:19,494 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-28 10:09:19,495 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-28 10:09:19,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {53604#true} call #t~ret9 := main(); {53604#true} is VALID [2022-04-28 10:09:19,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53604#true} {53604#true} #50#return; {53604#true} is VALID [2022-04-28 10:09:19,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-04-28 10:09:19,495 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-28 10:09:19,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {53604#true} call ULTIMATE.init(); {53604#true} is VALID [2022-04-28 10:09:19,495 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-28 10:09:19,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25192449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:19,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:19,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:09:19,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:19,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1722101893] [2022-04-28 10:09:19,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1722101893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:19,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:19,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822636772] [2022-04-28 10:09:19,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:19,496 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-28 10:09:19,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:19,496 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-28 10:09:19,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:19,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:19,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:19,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:19,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1569, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:19,517 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-28 10:09:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:24,039 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2022-04-28 10:09:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 10:09:24,039 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-28 10:09:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:24,039 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-28 10:09:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2022-04-28 10:09:24,040 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-28 10:09:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2022-04-28 10:09:24,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 79 transitions. [2022-04-28 10:09:24,104 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-28 10:09:24,104 INFO L225 Difference]: With dead ends: 100 [2022-04-28 10:09:24,104 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 10:09:24,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1119, Invalid=4887, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 10:09:24,105 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:24,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:09:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 10:09:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 51. [2022-04-28 10:09:24,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:24,697 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-28 10:09:24,698 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-28 10:09:24,698 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-28 10:09:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:24,699 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2022-04-28 10:09:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2022-04-28 10:09:24,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:24,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:24,699 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-28 10:09:24,699 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-28 10:09:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:24,700 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2022-04-28 10:09:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2022-04-28 10:09:24,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:24,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:24,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:24,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:24,701 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-28 10:09:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 10:09:24,701 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-28 10:09:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:24,702 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 10:09:24,702 INFO L496 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-28 10:09:24,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 10:09:25,762 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-28 10:09:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:09:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:25,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:25,762 INFO L195 NwaCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:25,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2022-04-28 10:09:25,962 WARN L477 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-28 10:09:25,963 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:25,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash 502339191, now seen corresponding path program 171 times [2022-04-28 10:09:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:25,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2029048874] [2022-04-28 10:09:25,965 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:25,965 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:25,965 INFO L85 PathProgramCache]: Analyzing trace with hash 502339191, now seen corresponding path program 172 times [2022-04-28 10:09:25,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:25,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533352709] [2022-04-28 10:09:25,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:25,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,409 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-28 10:09:26,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {54396#true} assume true; {54396#true} is VALID [2022-04-28 10:09:26,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54396#true} {54396#true} #50#return; {54396#true} is VALID [2022-04-28 10:09:26,410 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-28 10:09:26,410 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-28 10:09:26,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {54396#true} assume true; {54396#true} is VALID [2022-04-28 10:09:26,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54396#true} {54396#true} #50#return; {54396#true} is VALID [2022-04-28 10:09:26,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {54396#true} call #t~ret9 := main(); {54396#true} is VALID [2022-04-28 10:09:26,410 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-28 10:09:26,411 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-28 10:09:26,412 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-28 10:09:26,412 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-28 10:09:26,413 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-28 10:09:26,414 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-28 10:09:26,414 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-28 10:09:26,415 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-28 10:09:26,416 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-28 10:09:26,416 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-28 10:09:26,417 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-28 10:09:26,418 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-28 10:09:26,418 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-28 10:09:26,419 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-28 10:09:26,420 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-28 10:09:26,420 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-28 10:09:26,420 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-28 10:09:26,421 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-28 10:09:26,422 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-28 10:09:26,422 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-28 10:09:26,423 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-28 10:09:26,424 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-28 10:09:26,424 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-28 10:09:26,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {54397#false} ~cond := #in~cond; {54397#false} is VALID [2022-04-28 10:09:26,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {54397#false} assume 0 == ~cond; {54397#false} is VALID [2022-04-28 10:09:26,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {54397#false} assume !false; {54397#false} is VALID [2022-04-28 10:09:26,424 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-28 10:09:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533352709] [2022-04-28 10:09:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533352709] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:26,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977716379] [2022-04-28 10:09:26,425 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:26,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:26,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:26,426 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-28 10:09:26,453 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-28 10:09:26,481 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:26,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:26,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:09:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:26,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {54396#true} call ULTIMATE.init(); {54396#true} is VALID [2022-04-28 10:09:26,811 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-28 10:09:26,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {54396#true} assume true; {54396#true} is VALID [2022-04-28 10:09:26,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54396#true} {54396#true} #50#return; {54396#true} is VALID [2022-04-28 10:09:26,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {54396#true} call #t~ret9 := main(); {54396#true} is VALID [2022-04-28 10:09:26,812 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-28 10:09:26,812 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-28 10:09:26,813 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-28 10:09:26,813 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-28 10:09:26,814 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-28 10:09:26,814 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-28 10:09:26,815 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-28 10:09:26,815 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-28 10:09:26,816 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-28 10:09:26,816 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-28 10:09:26,817 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-28 10:09:26,817 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-28 10:09:26,818 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-28 10:09:26,818 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-28 10:09:26,819 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-28 10:09:26,819 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-28 10:09:26,820 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-28 10:09:26,820 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-28 10:09:26,821 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-28 10:09:26,821 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-28 10:09:26,822 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-28 10:09:26,822 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-28 10:09:26,822 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-28 10:09:26,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {54397#false} ~cond := #in~cond; {54397#false} is VALID [2022-04-28 10:09:26,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {54397#false} assume 0 == ~cond; {54397#false} is VALID [2022-04-28 10:09:26,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {54397#false} assume !false; {54397#false} is VALID [2022-04-28 10:09:26,823 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-28 10:09:26,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:27,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {54397#false} assume !false; {54397#false} is VALID [2022-04-28 10:09:27,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {54397#false} assume 0 == ~cond; {54397#false} is VALID [2022-04-28 10:09:27,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {54397#false} ~cond := #in~cond; {54397#false} is VALID [2022-04-28 10:09:27,497 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-28 10:09:27,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {54528#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {54397#false} is VALID [2022-04-28 10:09:27,499 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-28 10:09:27,499 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-28 10:09:27,500 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-28 10:09:27,501 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-28 10:09:27,501 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-28 10:09:27,501 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-28 10:09:27,502 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-28 10:09:27,503 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-28 10:09:27,503 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-28 10:09:27,504 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-28 10:09:27,505 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-28 10:09:27,505 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-28 10:09:27,506 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-28 10:09:27,507 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-28 10:09:27,507 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-28 10:09:27,508 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-28 10:09:27,509 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-28 10:09:27,509 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-28 10:09:27,510 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-28 10:09:27,510 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-28 10:09:27,511 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-28 10:09:27,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {54396#true} call #t~ret9 := main(); {54396#true} is VALID [2022-04-28 10:09:27,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54396#true} {54396#true} #50#return; {54396#true} is VALID [2022-04-28 10:09:27,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {54396#true} assume true; {54396#true} is VALID [2022-04-28 10:09:27,511 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-28 10:09:27,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {54396#true} call ULTIMATE.init(); {54396#true} is VALID [2022-04-28 10:09:27,511 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-28 10:09:27,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977716379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:27,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:27,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:09:27,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:27,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2029048874] [2022-04-28 10:09:27,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2029048874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:27,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:27,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:27,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009128592] [2022-04-28 10:09:27,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:27,512 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-28 10:09:27,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:27,512 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-28 10:09:27,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:27,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:27,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:27,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1552, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:27,533 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-28 10:09:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:32,229 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2022-04-28 10:09:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:09:32,229 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-28 10:09:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:32,229 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-28 10:09:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-28 10:09:32,230 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-28 10:09:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-28 10:09:32,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 80 transitions. [2022-04-28 10:09:32,294 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-28 10:09:32,295 INFO L225 Difference]: With dead ends: 106 [2022-04-28 10:09:32,295 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 10:09:32,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1030, Invalid=4372, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 10:09:32,296 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 48 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:32,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 117 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:09:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 10:09:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 51. [2022-04-28 10:09:32,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:32,883 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-28 10:09:32,883 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-28 10:09:32,883 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-28 10:09:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:32,884 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-28 10:09:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2022-04-28 10:09:32,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:32,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:32,884 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-28 10:09:32,884 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-28 10:09:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:32,885 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-28 10:09:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2022-04-28 10:09:32,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:32,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:32,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:32,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:32,885 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-28 10:09:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 10:09:32,886 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-28 10:09:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:32,886 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 10:09:32,886 INFO L496 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-28 10:09:32,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 10:09:33,860 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-28 10:09:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:09:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:33,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:33,860 INFO L195 NwaCegarLoop]: trace histogram [15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:33,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Ended with exit code 0 [2022-04-28 10:09:34,061 WARN L477 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-28 10:09:34,061 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1469705782, now seen corresponding path program 173 times [2022-04-28 10:09:34,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:34,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1934677515] [2022-04-28 10:09:34,063 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:34,063 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1469705782, now seen corresponding path program 174 times [2022-04-28 10:09:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:34,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546584965] [2022-04-28 10:09:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:34,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:34,394 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-28 10:09:34,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {55204#true} assume true; {55204#true} is VALID [2022-04-28 10:09:34,394 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55204#true} {55204#true} #50#return; {55204#true} is VALID [2022-04-28 10:09:34,395 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-28 10:09:34,395 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-28 10:09:34,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {55204#true} assume true; {55204#true} is VALID [2022-04-28 10:09:34,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55204#true} {55204#true} #50#return; {55204#true} is VALID [2022-04-28 10:09:34,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {55204#true} call #t~ret9 := main(); {55204#true} is VALID [2022-04-28 10:09:34,395 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-28 10:09:34,396 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-28 10:09:34,396 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-28 10:09:34,397 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-28 10:09:34,397 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-28 10:09:34,398 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-28 10:09:34,398 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-28 10:09:34,399 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-28 10:09:34,399 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-28 10:09:34,400 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-28 10:09:34,400 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-28 10:09:34,401 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-28 10:09:34,401 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-28 10:09:34,402 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-28 10:09:34,402 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-28 10:09:34,403 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-28 10:09:34,403 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-28 10:09:34,404 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-28 10:09:34,404 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-28 10:09:34,405 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-28 10:09:34,405 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-28 10:09:34,406 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-28 10:09:34,406 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-28 10:09:34,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {55205#false} ~cond := #in~cond; {55205#false} is VALID [2022-04-28 10:09:34,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {55205#false} assume 0 == ~cond; {55205#false} is VALID [2022-04-28 10:09:34,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {55205#false} assume !false; {55205#false} is VALID [2022-04-28 10:09:34,406 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-28 10:09:34,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:34,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546584965] [2022-04-28 10:09:34,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546584965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:34,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164796330] [2022-04-28 10:09:34,406 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:34,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:34,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:34,408 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-28 10:09:34,409 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-28 10:09:34,772 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:09:34,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:34,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 10:09:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:34,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:35,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {55204#true} call ULTIMATE.init(); {55204#true} is VALID [2022-04-28 10:09:35,150 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-28 10:09:35,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {55204#true} assume true; {55204#true} is VALID [2022-04-28 10:09:35,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55204#true} {55204#true} #50#return; {55204#true} is VALID [2022-04-28 10:09:35,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {55204#true} call #t~ret9 := main(); {55204#true} is VALID [2022-04-28 10:09:35,150 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-28 10:09:35,151 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-28 10:09:35,151 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-28 10:09:35,152 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-28 10:09:35,152 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-28 10:09:35,153 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-28 10:09:35,153 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-28 10:09:35,154 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-28 10:09:35,154 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-28 10:09:35,155 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-28 10:09:35,155 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-28 10:09:35,156 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-28 10:09:35,156 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-28 10:09:35,157 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-28 10:09:35,158 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-28 10:09:35,158 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-28 10:09:35,158 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-28 10:09:35,159 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-28 10:09:35,159 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-28 10:09:35,160 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-28 10:09:35,160 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-28 10:09:35,161 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-28 10:09:35,161 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-28 10:09:35,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {55205#false} ~cond := #in~cond; {55205#false} is VALID [2022-04-28 10:09:35,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {55205#false} assume 0 == ~cond; {55205#false} is VALID [2022-04-28 10:09:35,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {55205#false} assume !false; {55205#false} is VALID [2022-04-28 10:09:35,161 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-28 10:09:35,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:35,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {55205#false} assume !false; {55205#false} is VALID [2022-04-28 10:09:35,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {55205#false} assume 0 == ~cond; {55205#false} is VALID [2022-04-28 10:09:35,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {55205#false} ~cond := #in~cond; {55205#false} is VALID [2022-04-28 10:09:35,899 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-28 10:09:35,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {55336#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {55205#false} is VALID [2022-04-28 10:09:35,900 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-28 10:09:35,901 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-28 10:09:35,904 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-28 10:09:35,904 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-28 10:09:35,904 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-28 10:09:35,905 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-28 10:09:35,906 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-28 10:09:35,907 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-28 10:09:35,908 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-28 10:09:35,908 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-28 10:09:35,909 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-28 10:09:35,910 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-28 10:09:35,911 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-28 10:09:35,912 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-28 10:09:35,912 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-28 10:09:35,913 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-28 10:09:35,914 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-28 10:09:35,915 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-28 10:09:35,915 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-28 10:09:35,916 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-28 10:09:35,916 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-28 10:09:35,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {55204#true} call #t~ret9 := main(); {55204#true} is VALID [2022-04-28 10:09:35,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55204#true} {55204#true} #50#return; {55204#true} is VALID [2022-04-28 10:09:35,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {55204#true} assume true; {55204#true} is VALID [2022-04-28 10:09:35,917 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-28 10:09:35,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {55204#true} call ULTIMATE.init(); {55204#true} is VALID [2022-04-28 10:09:35,917 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-28 10:09:35,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164796330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:35,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:35,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:09:35,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:35,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1934677515] [2022-04-28 10:09:35,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1934677515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:35,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:35,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:35,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932631927] [2022-04-28 10:09:35,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:35,918 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-28 10:09:35,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:35,918 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-28 10:09:35,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:35,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:35,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:35,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:35,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1531, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:35,940 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-28 10:09:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:40,808 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2022-04-28 10:09:40,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:09:40,808 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-28 10:09:40,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:40,808 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-28 10:09:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 81 transitions. [2022-04-28 10:09:40,809 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-28 10:09:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 81 transitions. [2022-04-28 10:09:40,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 81 transitions. [2022-04-28 10:09:40,883 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-28 10:09:40,884 INFO L225 Difference]: With dead ends: 111 [2022-04-28 10:09:40,884 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 10:09:40,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=949, Invalid=3881, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:09:40,884 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 55 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:40,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 122 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:09:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 10:09:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 51. [2022-04-28 10:09:41,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:41,472 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-28 10:09:41,472 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-28 10:09:41,472 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-28 10:09:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:41,473 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-04-28 10:09:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-04-28 10:09:41,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:41,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:41,474 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-28 10:09:41,474 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-28 10:09:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:41,478 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-04-28 10:09:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-04-28 10:09:41,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:41,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:41,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:41,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:41,478 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-28 10:09:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 10:09:41,478 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-28 10:09:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:41,478 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 10:09:41,479 INFO L496 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-28 10:09:41,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 10:09:42,527 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-28 10:09:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:09:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:42,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:42,528 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:42,533 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-28 10:09:42,728 WARN L477 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-28 10:09:42,728 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash 531079831, now seen corresponding path program 175 times [2022-04-28 10:09:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:42,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452477433] [2022-04-28 10:09:42,730 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:42,730 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 531079831, now seen corresponding path program 176 times [2022-04-28 10:09:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:42,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732279232] [2022-04-28 10:09:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:43,070 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-28 10:09:43,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {56024#true} assume true; {56024#true} is VALID [2022-04-28 10:09:43,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56024#true} {56024#true} #50#return; {56024#true} is VALID [2022-04-28 10:09:43,070 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-28 10:09:43,070 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-28 10:09:43,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {56024#true} assume true; {56024#true} is VALID [2022-04-28 10:09:43,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56024#true} {56024#true} #50#return; {56024#true} is VALID [2022-04-28 10:09:43,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {56024#true} call #t~ret9 := main(); {56024#true} is VALID [2022-04-28 10:09:43,071 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-28 10:09:43,071 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-28 10:09:43,072 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-28 10:09:43,072 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-28 10:09:43,073 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-28 10:09:43,073 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-28 10:09:43,074 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-28 10:09:43,074 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-28 10:09:43,075 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-28 10:09:43,075 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-28 10:09:43,077 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-28 10:09:43,077 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-28 10:09:43,078 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-28 10:09:43,078 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-28 10:09:43,079 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-28 10:09:43,080 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-28 10:09:43,080 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-28 10:09:43,081 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-28 10:09:43,081 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-28 10:09:43,082 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-28 10:09:43,082 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-28 10:09:43,083 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-28 10:09:43,083 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-28 10:09:43,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {56025#false} ~cond := #in~cond; {56025#false} is VALID [2022-04-28 10:09:43,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {56025#false} assume 0 == ~cond; {56025#false} is VALID [2022-04-28 10:09:43,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {56025#false} assume !false; {56025#false} is VALID [2022-04-28 10:09:43,083 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-28 10:09:43,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:43,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732279232] [2022-04-28 10:09:43,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732279232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:43,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258222517] [2022-04-28 10:09:43,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:43,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:43,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:43,084 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-28 10:09:43,085 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-28 10:09:43,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:43,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:43,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:09:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:43,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:43,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {56024#true} call ULTIMATE.init(); {56024#true} is VALID [2022-04-28 10:09:43,443 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-28 10:09:43,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {56024#true} assume true; {56024#true} is VALID [2022-04-28 10:09:43,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56024#true} {56024#true} #50#return; {56024#true} is VALID [2022-04-28 10:09:43,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {56024#true} call #t~ret9 := main(); {56024#true} is VALID [2022-04-28 10:09:43,443 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-28 10:09:43,444 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-28 10:09:43,444 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-28 10:09:43,445 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-28 10:09:43,445 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-28 10:09:43,446 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-28 10:09:43,446 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-28 10:09:43,447 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-28 10:09:43,448 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-28 10:09:43,448 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-28 10:09:43,449 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-28 10:09:43,450 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-28 10:09:43,450 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-28 10:09:43,451 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-28 10:09:43,452 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-28 10:09:43,452 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-28 10:09:43,453 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-28 10:09:43,454 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-28 10:09:43,454 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-28 10:09:43,454 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-28 10:09:43,455 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-28 10:09:43,455 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-28 10:09:43,456 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-28 10:09:43,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {56025#false} ~cond := #in~cond; {56025#false} is VALID [2022-04-28 10:09:43,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {56025#false} assume 0 == ~cond; {56025#false} is VALID [2022-04-28 10:09:43,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {56025#false} assume !false; {56025#false} is VALID [2022-04-28 10:09:43,456 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-28 10:09:43,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:44,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {56025#false} assume !false; {56025#false} is VALID [2022-04-28 10:09:44,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {56025#false} assume 0 == ~cond; {56025#false} is VALID [2022-04-28 10:09:44,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {56025#false} ~cond := #in~cond; {56025#false} is VALID [2022-04-28 10:09:44,160 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-28 10:09:44,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {56156#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {56025#false} is VALID [2022-04-28 10:09:44,161 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-28 10:09:44,162 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-28 10:09:44,162 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-28 10:09:44,163 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-28 10:09:44,164 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-28 10:09:44,164 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-28 10:09:44,165 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-28 10:09:44,166 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-28 10:09:44,166 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-28 10:09:44,167 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-28 10:09:44,168 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-28 10:09:44,168 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-28 10:09:44,169 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-28 10:09:44,170 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-28 10:09:44,170 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-28 10:09:44,171 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-28 10:09:44,172 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-28 10:09:44,172 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-28 10:09:44,173 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-28 10:09:44,174 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-28 10:09:44,174 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-28 10:09:44,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {56024#true} call #t~ret9 := main(); {56024#true} is VALID [2022-04-28 10:09:44,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56024#true} {56024#true} #50#return; {56024#true} is VALID [2022-04-28 10:09:44,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {56024#true} assume true; {56024#true} is VALID [2022-04-28 10:09:44,174 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-28 10:09:44,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {56024#true} call ULTIMATE.init(); {56024#true} is VALID [2022-04-28 10:09:44,174 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-28 10:09:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258222517] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:44,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:44,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:09:44,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452477433] [2022-04-28 10:09:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452477433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:44,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:44,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929273162] [2022-04-28 10:09:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:44,175 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-28 10:09:44,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:44,175 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-28 10:09:44,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:44,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:44,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1506, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:44,197 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-28 10:09:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:49,455 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2022-04-28 10:09:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:09:49,455 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-28 10:09:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:49,455 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-28 10:09:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-28 10:09:49,456 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-28 10:09:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-28 10:09:49,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 83 transitions. [2022-04-28 10:09:49,522 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-28 10:09:49,523 INFO L225 Difference]: With dead ends: 115 [2022-04-28 10:09:49,523 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 10:09:49,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=902, Invalid=3520, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:09:49,523 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 63 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:49,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 142 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:09:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 10:09:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 51. [2022-04-28 10:09:50,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:50,108 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-28 10:09:50,108 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-28 10:09:50,108 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-28 10:09:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:50,109 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 10:09:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 10:09:50,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:50,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:50,109 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-28 10:09:50,109 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-28 10:09:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:50,110 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 10:09:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 10:09:50,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:50,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:50,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:50,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:50,110 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-28 10:09:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 10:09:50,111 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-28 10:09:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:50,111 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 10:09:50,111 INFO L496 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-28 10:09:50,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 10:09:51,208 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-28 10:09:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:09:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:51,209 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:51,209 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:51,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-04-28 10:09:51,409 WARN L477 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-28 10:09:51,409 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:51,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash -53387754, now seen corresponding path program 177 times [2022-04-28 10:09:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:51,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1095821126] [2022-04-28 10:09:51,412 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:51,413 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash -53387754, now seen corresponding path program 178 times [2022-04-28 10:09:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:51,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959648991] [2022-04-28 10:09:51,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:51,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:51,822 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-28 10:09:51,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {56854#true} assume true; {56854#true} is VALID [2022-04-28 10:09:51,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56854#true} {56854#true} #50#return; {56854#true} is VALID [2022-04-28 10:09:51,823 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-28 10:09:51,823 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-28 10:09:51,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {56854#true} assume true; {56854#true} is VALID [2022-04-28 10:09:51,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56854#true} {56854#true} #50#return; {56854#true} is VALID [2022-04-28 10:09:51,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {56854#true} call #t~ret9 := main(); {56854#true} is VALID [2022-04-28 10:09:51,823 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-28 10:09:51,824 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-28 10:09:51,824 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-28 10:09:51,825 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-28 10:09:51,826 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-28 10:09:51,826 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-28 10:09:51,827 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-28 10:09:51,828 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-28 10:09:51,828 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-28 10:09:51,829 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-28 10:09:51,830 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-28 10:09:51,830 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-28 10:09:51,831 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-28 10:09:51,832 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-28 10:09:51,832 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-28 10:09:51,833 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-28 10:09:51,834 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-28 10:09:51,834 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-28 10:09:51,835 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-28 10:09:51,835 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-28 10:09:51,836 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-28 10:09:51,837 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-28 10:09:51,837 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-28 10:09:51,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {56855#false} ~cond := #in~cond; {56855#false} is VALID [2022-04-28 10:09:51,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {56855#false} assume 0 == ~cond; {56855#false} is VALID [2022-04-28 10:09:51,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {56855#false} assume !false; {56855#false} is VALID [2022-04-28 10:09:51,837 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-28 10:09:51,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:51,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959648991] [2022-04-28 10:09:51,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959648991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:51,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193211691] [2022-04-28 10:09:51,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:51,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:51,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:51,838 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-28 10:09:51,839 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-28 10:09:51,884 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:51,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:51,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:09:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:51,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:52,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {56854#true} call ULTIMATE.init(); {56854#true} is VALID [2022-04-28 10:09:52,215 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-28 10:09:52,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {56854#true} assume true; {56854#true} is VALID [2022-04-28 10:09:52,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56854#true} {56854#true} #50#return; {56854#true} is VALID [2022-04-28 10:09:52,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {56854#true} call #t~ret9 := main(); {56854#true} is VALID [2022-04-28 10:09:52,215 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-28 10:09:52,216 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-28 10:09:52,216 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-28 10:09:52,217 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-28 10:09:52,218 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-28 10:09:52,218 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-28 10:09:52,219 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-28 10:09:52,220 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-28 10:09:52,220 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-28 10:09:52,221 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-28 10:09:52,222 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-28 10:09:52,222 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-28 10:09:52,223 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-28 10:09:52,224 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-28 10:09:52,224 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-28 10:09:52,225 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-28 10:09:52,226 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-28 10:09:52,226 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-28 10:09:52,227 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-28 10:09:52,227 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-28 10:09:52,228 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-28 10:09:52,228 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-28 10:09:52,229 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-28 10:09:52,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {56855#false} ~cond := #in~cond; {56855#false} is VALID [2022-04-28 10:09:52,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {56855#false} assume 0 == ~cond; {56855#false} is VALID [2022-04-28 10:09:52,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {56855#false} assume !false; {56855#false} is VALID [2022-04-28 10:09:52,229 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-28 10:09:52,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:52,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {56855#false} assume !false; {56855#false} is VALID [2022-04-28 10:09:52,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {56855#false} assume 0 == ~cond; {56855#false} is VALID [2022-04-28 10:09:52,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {56855#false} ~cond := #in~cond; {56855#false} is VALID [2022-04-28 10:09:52,966 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-28 10:09:52,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {56986#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {56855#false} is VALID [2022-04-28 10:09:52,969 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-28 10:09:52,969 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-28 10:09:52,970 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-28 10:09:52,970 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-28 10:09:52,971 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-28 10:09:52,972 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-28 10:09:52,972 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-28 10:09:52,973 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-28 10:09:52,973 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-28 10:09:52,974 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-28 10:09:52,975 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-28 10:09:52,975 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-28 10:09:52,976 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-28 10:09:52,977 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-28 10:09:52,977 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-28 10:09:52,978 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-28 10:09:52,979 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-28 10:09:52,979 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-28 10:09:52,980 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-28 10:09:52,981 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-28 10:09:52,981 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-28 10:09:52,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {56854#true} call #t~ret9 := main(); {56854#true} is VALID [2022-04-28 10:09:52,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56854#true} {56854#true} #50#return; {56854#true} is VALID [2022-04-28 10:09:52,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {56854#true} assume true; {56854#true} is VALID [2022-04-28 10:09:52,981 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-28 10:09:52,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {56854#true} call ULTIMATE.init(); {56854#true} is VALID [2022-04-28 10:09:52,981 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-28 10:09:52,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193211691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:52,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:52,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:09:52,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:52,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1095821126] [2022-04-28 10:09:52,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1095821126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:52,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:52,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:52,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065215055] [2022-04-28 10:09:52,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:52,982 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-28 10:09:52,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:52,982 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-28 10:09:53,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:53,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:53,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:53,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1477, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:53,002 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-28 10:09:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:58,282 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-04-28 10:09:58,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:09:58,282 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-28 10:09:58,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:58,282 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-28 10:09:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 86 transitions. [2022-04-28 10:09:58,283 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-28 10:09:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 86 transitions. [2022-04-28 10:09:58,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 86 transitions. [2022-04-28 10:09:58,354 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-28 10:09:58,355 INFO L225 Difference]: With dead ends: 118 [2022-04-28 10:09:58,355 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 10:09:58,355 INFO L412 NwaCegarLoop]: 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-28 10:09:58,355 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:58,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 142 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:09:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 10:09:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2022-04-28 10:09:58,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:58,954 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-28 10:09:58,954 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-28 10:09:58,954 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-28 10:09:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:58,955 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-04-28 10:09:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2022-04-28 10:09:58,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:58,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:58,955 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-28 10:09:58,955 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-28 10:09:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:58,956 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-04-28 10:09:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2022-04-28 10:09:58,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:58,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:58,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:58,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:58,956 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-28 10:09:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 10:09:58,957 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-28 10:09:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:58,957 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 10:09:58,957 INFO L496 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-28 10:09:58,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 10:10:00,001 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-28 10:10:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:10:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:10:00,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:00,002 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:00,020 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-28 10:10:00,207 WARN L477 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-28 10:10:00,208 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:00,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2144515767, now seen corresponding path program 35 times [2022-04-28 10:10:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:00,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624701757] [2022-04-28 10:10:00,214 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:00,214 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2144515767, now seen corresponding path program 36 times [2022-04-28 10:10:00,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:00,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388500767] [2022-04-28 10:10:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:00,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:00,575 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-28 10:10:00,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {57692#true} assume true; {57692#true} is VALID [2022-04-28 10:10:00,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57692#true} {57692#true} #50#return; {57692#true} is VALID [2022-04-28 10:10:00,575 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-28 10:10:00,575 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-28 10:10:00,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {57692#true} assume true; {57692#true} is VALID [2022-04-28 10:10:00,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57692#true} {57692#true} #50#return; {57692#true} is VALID [2022-04-28 10:10:00,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {57692#true} call #t~ret9 := main(); {57692#true} is VALID [2022-04-28 10:10:00,576 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-28 10:10:00,576 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-28 10:10:00,577 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-28 10:10:00,577 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-28 10:10:00,578 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-28 10:10:00,578 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-28 10:10:00,579 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-28 10:10:00,583 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-28 10:10:00,584 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-28 10:10:00,585 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-28 10:10:00,585 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-28 10:10:00,586 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-28 10:10:00,587 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-28 10:10:00,587 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-28 10:10:00,588 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-28 10:10:00,589 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-28 10:10:00,589 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-28 10:10:00,590 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-28 10:10:00,590 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-28 10:10:00,591 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-28 10:10:00,591 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-28 10:10:00,592 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-28 10:10:00,592 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-28 10:10:00,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#false} ~cond := #in~cond; {57693#false} is VALID [2022-04-28 10:10:00,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#false} assume 0 == ~cond; {57693#false} is VALID [2022-04-28 10:10:00,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {57693#false} assume !false; {57693#false} is VALID [2022-04-28 10:10:00,592 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-28 10:10:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:00,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388500767] [2022-04-28 10:10:00,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388500767] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:00,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897981287] [2022-04-28 10:10:00,592 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:00,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:00,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:00,593 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-28 10:10:00,594 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-28 10:10:00,808 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:10:00,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:00,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 10:10:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:00,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:01,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {57692#true} call ULTIMATE.init(); {57692#true} is VALID [2022-04-28 10:10:01,175 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-28 10:10:01,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {57692#true} assume true; {57692#true} is VALID [2022-04-28 10:10:01,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57692#true} {57692#true} #50#return; {57692#true} is VALID [2022-04-28 10:10:01,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {57692#true} call #t~ret9 := main(); {57692#true} is VALID [2022-04-28 10:10:01,176 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-28 10:10:01,176 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-28 10:10:01,177 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-28 10:10:01,177 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-28 10:10:01,178 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-28 10:10:01,178 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-28 10:10:01,179 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-28 10:10:01,179 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-28 10:10:01,180 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-28 10:10:01,181 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-28 10:10:01,181 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-28 10:10:01,182 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-28 10:10:01,182 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-28 10:10:01,183 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-28 10:10:01,183 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-28 10:10:01,184 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-28 10:10:01,184 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-28 10:10:01,185 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-28 10:10:01,185 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-28 10:10:01,186 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-28 10:10:01,186 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-28 10:10:01,186 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-28 10:10:01,186 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-28 10:10:01,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#false} ~cond := #in~cond; {57693#false} is VALID [2022-04-28 10:10:01,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#false} assume 0 == ~cond; {57693#false} is VALID [2022-04-28 10:10:01,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {57693#false} assume !false; {57693#false} is VALID [2022-04-28 10:10:01,187 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-28 10:10:01,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:01,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {57693#false} assume !false; {57693#false} is VALID [2022-04-28 10:10:01,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#false} assume 0 == ~cond; {57693#false} is VALID [2022-04-28 10:10:01,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#false} ~cond := #in~cond; {57693#false} is VALID [2022-04-28 10:10:01,967 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-28 10:10:01,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {57824#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {57693#false} is VALID [2022-04-28 10:10:01,968 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-28 10:10:01,968 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-28 10:10:01,969 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-28 10:10:01,970 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-28 10:10:01,971 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-28 10:10:01,971 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-28 10:10:01,972 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-28 10:10:01,973 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-28 10:10:01,973 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-28 10:10:01,974 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-28 10:10:01,975 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-28 10:10:01,975 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-28 10:10:01,976 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-28 10:10:01,977 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-28 10:10:01,977 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-28 10:10:01,978 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-28 10:10:01,979 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-28 10:10:01,979 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-28 10:10:01,980 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-28 10:10:01,981 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-28 10:10:01,981 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-28 10:10:01,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {57692#true} call #t~ret9 := main(); {57692#true} is VALID [2022-04-28 10:10:01,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57692#true} {57692#true} #50#return; {57692#true} is VALID [2022-04-28 10:10:01,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {57692#true} assume true; {57692#true} is VALID [2022-04-28 10:10:01,981 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-28 10:10:01,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {57692#true} call ULTIMATE.init(); {57692#true} is VALID [2022-04-28 10:10:01,981 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-28 10:10:01,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897981287] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:01,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:01,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:10:01,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624701757] [2022-04-28 10:10:01,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624701757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:01,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:01,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:10:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424687509] [2022-04-28 10:10:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:01,982 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-28 10:10:01,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:01,982 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-28 10:10:02,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:02,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:10:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:10:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:10:02,002 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-28 10:10:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:07,566 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2022-04-28 10:10:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:10:07,567 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-28 10:10:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:07,567 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-28 10:10:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 90 transitions. [2022-04-28 10:10:07,567 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-28 10:10:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 90 transitions. [2022-04-28 10:10:07,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 90 transitions. [2022-04-28 10:10:07,640 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-28 10:10:07,641 INFO L225 Difference]: With dead ends: 123 [2022-04-28 10:10:07,641 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 10:10:07,642 INFO L412 NwaCegarLoop]: 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-28 10:10:07,642 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 88 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:07,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 150 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:10:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 10:10:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 53. [2022-04-28 10:10:08,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:08,270 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-28 10:10:08,270 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-28 10:10:08,270 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-28 10:10:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:08,271 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2022-04-28 10:10:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-04-28 10:10:08,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:08,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:08,271 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-28 10:10:08,271 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-28 10:10:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:08,272 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2022-04-28 10:10:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-04-28 10:10:08,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:08,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:08,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:08,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:08,272 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-28 10:10:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2022-04-28 10:10:08,273 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 31 [2022-04-28 10:10:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:08,273 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2022-04-28 10:10:08,273 INFO L496 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-28 10:10:08,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 64 transitions. [2022-04-28 10:10:09,390 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-28 10:10:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-28 10:10:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:09,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:09,390 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:09,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2022-04-28 10:10:09,590 WARN L477 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-28 10:10:09,591 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:09,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1538637452, now seen corresponding path program 179 times [2022-04-28 10:10:09,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:09,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718816864] [2022-04-28 10:10:09,593 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:09,593 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1538637452, now seen corresponding path program 180 times [2022-04-28 10:10:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:09,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428784112] [2022-04-28 10:10:09,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:09,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:09,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:09,918 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-28 10:10:09,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {58552#true} assume true; {58552#true} is VALID [2022-04-28 10:10:09,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58552#true} {58552#true} #50#return; {58552#true} is VALID [2022-04-28 10:10:09,919 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-28 10:10:09,919 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-28 10:10:09,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {58552#true} assume true; {58552#true} is VALID [2022-04-28 10:10:09,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58552#true} {58552#true} #50#return; {58552#true} is VALID [2022-04-28 10:10:09,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {58552#true} call #t~ret9 := main(); {58552#true} is VALID [2022-04-28 10:10:09,919 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-28 10:10:09,920 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-28 10:10:09,920 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-28 10:10:09,921 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-28 10:10:09,921 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-28 10:10:09,922 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-28 10:10:09,922 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-28 10:10:09,923 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-28 10:10:09,923 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-28 10:10:09,924 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-28 10:10:09,924 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-28 10:10:09,925 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-28 10:10:09,925 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-28 10:10:09,926 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-28 10:10:09,926 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-28 10:10:09,927 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-28 10:10:09,927 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-28 10:10:09,928 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-28 10:10:09,928 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-28 10:10:09,929 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-28 10:10:09,939 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-28 10:10:09,941 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-28 10:10:09,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {58553#false} assume !(~z~0 % 4294967296 > 0); {58553#false} is VALID [2022-04-28 10:10:09,941 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-28 10:10:09,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {58553#false} ~cond := #in~cond; {58553#false} is VALID [2022-04-28 10:10:09,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {58553#false} assume 0 == ~cond; {58553#false} is VALID [2022-04-28 10:10:09,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {58553#false} assume !false; {58553#false} is VALID [2022-04-28 10:10:09,941 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-28 10:10:09,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:09,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428784112] [2022-04-28 10:10:09,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428784112] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:09,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611491743] [2022-04-28 10:10:09,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:09,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:09,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:09,942 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-28 10:10:09,951 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-28 10:10:10,031 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:10:10,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:10,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:10:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:10,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:10,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {58552#true} call ULTIMATE.init(); {58552#true} is VALID [2022-04-28 10:10:10,343 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-28 10:10:10,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {58552#true} assume true; {58552#true} is VALID [2022-04-28 10:10:10,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58552#true} {58552#true} #50#return; {58552#true} is VALID [2022-04-28 10:10:10,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {58552#true} call #t~ret9 := main(); {58552#true} is VALID [2022-04-28 10:10:10,343 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-28 10:10:10,343 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-28 10:10:10,344 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-28 10:10:10,345 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-28 10:10:10,345 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-28 10:10:10,346 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-28 10:10:10,346 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-28 10:10:10,347 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-28 10:10:10,347 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-28 10:10:10,348 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-28 10:10:10,348 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-28 10:10:10,348 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-28 10:10:10,349 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-28 10:10:10,349 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-28 10:10:10,350 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-28 10:10:10,350 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-28 10:10:10,351 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-28 10:10:10,351 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-28 10:10:10,352 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-28 10:10:10,353 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-28 10:10:10,353 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-28 10:10:10,354 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-28 10:10:10,354 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-28 10:10:10,354 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-28 10:10:10,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {58553#false} ~cond := #in~cond; {58553#false} is VALID [2022-04-28 10:10:10,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {58553#false} assume 0 == ~cond; {58553#false} is VALID [2022-04-28 10:10:10,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {58553#false} assume !false; {58553#false} is VALID [2022-04-28 10:10:10,354 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-28 10:10:10,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:11,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {58553#false} assume !false; {58553#false} is VALID [2022-04-28 10:10:11,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {58553#false} assume 0 == ~cond; {58553#false} is VALID [2022-04-28 10:10:11,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {58553#false} ~cond := #in~cond; {58553#false} is VALID [2022-04-28 10:10:11,050 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-28 10:10:11,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {58687#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {58553#false} is VALID [2022-04-28 10:10:11,052 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-28 10:10:11,052 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-28 10:10:11,053 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-28 10:10:11,054 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-28 10:10:11,054 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-28 10:10:11,055 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-28 10:10:11,056 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-28 10:10:11,057 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-28 10:10:11,058 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-28 10:10:11,058 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-28 10:10:11,059 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-28 10:10:11,059 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-28 10:10:11,060 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-28 10:10:11,061 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-28 10:10:11,062 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-28 10:10:11,062 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-28 10:10:11,063 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-28 10:10:11,064 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-28 10:10:11,064 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-28 10:10:11,065 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-28 10:10:11,066 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-28 10:10:11,066 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-28 10:10:11,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {58552#true} call #t~ret9 := main(); {58552#true} is VALID [2022-04-28 10:10:11,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58552#true} {58552#true} #50#return; {58552#true} is VALID [2022-04-28 10:10:11,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {58552#true} assume true; {58552#true} is VALID [2022-04-28 10:10:11,066 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-28 10:10:11,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {58552#true} call ULTIMATE.init(); {58552#true} is VALID [2022-04-28 10:10:11,066 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-28 10:10:11,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611491743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:11,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:11,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2022-04-28 10:10:11,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:11,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718816864] [2022-04-28 10:10:11,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718816864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:11,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:11,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:10:11,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849596131] [2022-04-28 10:10:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:11,067 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-28 10:10:11,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:11,068 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-28 10:10:11,090 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-28 10:10:11,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:10:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:11,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:10:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1691, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 10:10:11,091 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-28 10:10:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:13,402 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-04-28 10:10:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:10:13,402 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-28 10:10:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:13,402 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-28 10:10:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 43 transitions. [2022-04-28 10:10:13,402 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-28 10:10:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 43 transitions. [2022-04-28 10:10:13,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 43 transitions. [2022-04-28 10:10:13,435 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-28 10:10:13,435 INFO L225 Difference]: With dead ends: 68 [2022-04-28 10:10:13,435 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 10:10:13,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=670, Invalid=3490, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 10:10:13,436 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:13,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 114 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:10:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 10:10:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 10:10:13,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:13,978 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-28 10:10:13,978 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-28 10:10:13,978 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-28 10:10:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:13,979 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-04-28 10:10:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:10:13,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:13,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:13,979 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-28 10:10:13,979 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-28 10:10:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:13,980 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-04-28 10:10:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:10:13,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:13,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:13,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:13,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:13,980 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-28 10:10:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 10:10:13,980 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 32 [2022-04-28 10:10:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:13,980 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 10:10:13,980 INFO L496 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-28 10:10:13,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 10:10:14,943 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-28 10:10:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 10:10:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:14,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:14,943 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:14,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2022-04-28 10:10:15,143 WARN L477 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-28 10:10:15,144 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1964537077, now seen corresponding path program 181 times [2022-04-28 10:10:15,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:15,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980382138] [2022-04-28 10:10:15,146 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:15,146 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1964537077, now seen corresponding path program 182 times [2022-04-28 10:10:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:15,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819389477] [2022-04-28 10:10:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:15,496 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-28 10:10:15,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {59171#true} assume true; {59171#true} is VALID [2022-04-28 10:10:15,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59171#true} {59171#true} #50#return; {59171#true} is VALID [2022-04-28 10:10:15,497 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-28 10:10:15,497 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-28 10:10:15,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {59171#true} assume true; {59171#true} is VALID [2022-04-28 10:10:15,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59171#true} {59171#true} #50#return; {59171#true} is VALID [2022-04-28 10:10:15,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {59171#true} call #t~ret9 := main(); {59171#true} is VALID [2022-04-28 10:10:15,498 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-28 10:10:15,498 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-28 10:10:15,499 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-28 10:10:15,500 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-28 10:10:15,500 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-28 10:10:15,501 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-28 10:10:15,501 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-28 10:10:15,502 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-28 10:10:15,503 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-28 10:10:15,503 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-28 10:10:15,504 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-28 10:10:15,504 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-28 10:10:15,504 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-28 10:10:15,505 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-28 10:10:15,505 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-28 10:10:15,506 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-28 10:10:15,506 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-28 10:10:15,507 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-28 10:10:15,507 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-28 10:10:15,508 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-28 10:10:15,508 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-28 10:10:15,509 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-28 10:10:15,509 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-28 10:10:15,509 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-28 10:10:15,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {59172#false} ~cond := #in~cond; {59172#false} is VALID [2022-04-28 10:10:15,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {59172#false} assume 0 == ~cond; {59172#false} is VALID [2022-04-28 10:10:15,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {59172#false} assume !false; {59172#false} is VALID [2022-04-28 10:10:15,510 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-28 10:10:15,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:15,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819389477] [2022-04-28 10:10:15,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819389477] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:15,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939260622] [2022-04-28 10:10:15,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:15,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:15,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:15,511 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-28 10:10:15,512 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-28 10:10:15,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:15,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:15,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:10:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:15,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:15,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {59171#true} call ULTIMATE.init(); {59171#true} is VALID [2022-04-28 10:10:15,873 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-28 10:10:15,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {59171#true} assume true; {59171#true} is VALID [2022-04-28 10:10:15,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59171#true} {59171#true} #50#return; {59171#true} is VALID [2022-04-28 10:10:15,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {59171#true} call #t~ret9 := main(); {59171#true} is VALID [2022-04-28 10:10:15,873 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-28 10:10:15,874 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-28 10:10:15,874 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-28 10:10:15,875 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-28 10:10:15,875 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-28 10:10:15,876 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-28 10:10:15,876 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-28 10:10:15,877 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-28 10:10:15,877 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-28 10:10:15,878 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-28 10:10:15,878 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-28 10:10:15,879 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-28 10:10:15,879 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-28 10:10:15,880 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-28 10:10:15,880 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-28 10:10:15,881 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-28 10:10:15,881 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-28 10:10:15,882 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-28 10:10:15,882 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-28 10:10:15,883 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-28 10:10:15,883 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-28 10:10:15,884 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-28 10:10:15,884 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-28 10:10:15,884 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-28 10:10:15,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {59172#false} ~cond := #in~cond; {59172#false} is VALID [2022-04-28 10:10:15,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {59172#false} assume 0 == ~cond; {59172#false} is VALID [2022-04-28 10:10:15,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {59172#false} assume !false; {59172#false} is VALID [2022-04-28 10:10:15,885 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-28 10:10:15,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:16,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {59172#false} assume !false; {59172#false} is VALID [2022-04-28 10:10:16,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {59172#false} assume 0 == ~cond; {59172#false} is VALID [2022-04-28 10:10:16,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {59172#false} ~cond := #in~cond; {59172#false} is VALID [2022-04-28 10:10:16,571 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-28 10:10:16,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {59307#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59172#false} is VALID [2022-04-28 10:10:16,573 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-28 10:10:16,574 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-28 10:10:16,575 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-28 10:10:16,575 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-28 10:10:16,576 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-28 10:10:16,577 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-28 10:10:16,577 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-28 10:10:16,578 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-28 10:10:16,579 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-28 10:10:16,579 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-28 10:10:16,579 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-28 10:10:16,580 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-28 10:10:16,581 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-28 10:10:16,581 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-28 10:10:16,582 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-28 10:10:16,583 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-28 10:10:16,583 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-28 10:10:16,584 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-28 10:10:16,585 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-28 10:10:16,585 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-28 10:10:16,586 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-28 10:10:16,586 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-28 10:10:16,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {59171#true} call #t~ret9 := main(); {59171#true} is VALID [2022-04-28 10:10:16,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59171#true} {59171#true} #50#return; {59171#true} is VALID [2022-04-28 10:10:16,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {59171#true} assume true; {59171#true} is VALID [2022-04-28 10:10:16,586 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-28 10:10:16,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {59171#true} call ULTIMATE.init(); {59171#true} is VALID [2022-04-28 10:10:16,587 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-28 10:10:16,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939260622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:16,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:16,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:10:16,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:16,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980382138] [2022-04-28 10:10:16,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980382138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:16,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:16,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:10:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262452445] [2022-04-28 10:10:16,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:16,587 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-28 10:10:16,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:16,588 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-28 10:10:16,611 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-28 10:10:16,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:10:16,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:16,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:10:16,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1768, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:10:16,611 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-28 10:10:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:18,876 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-28 10:10:18,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:10:18,876 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-28 10:10:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:18,876 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-28 10:10:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 46 transitions. [2022-04-28 10:10:18,877 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-28 10:10:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 46 transitions. [2022-04-28 10:10:18,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 46 transitions. [2022-04-28 10:10:18,913 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-28 10:10:18,913 INFO L225 Difference]: With dead ends: 67 [2022-04-28 10:10:18,913 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 10:10:18,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=3694, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:10:18,914 INFO L413 NwaCegarLoop]: 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-28 10:10:18,914 INFO L414 NwaCegarLoop]: 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-28 10:10:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 10:10:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-04-28 10:10:19,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:19,521 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-28 10:10:19,521 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-28 10:10:19,521 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-28 10:10:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:19,521 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-28 10:10:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-28 10:10:19,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:19,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:19,522 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-28 10:10:19,522 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-28 10:10:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:19,522 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-28 10:10:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-28 10:10:19,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:19,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:19,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:19,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:19,523 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-28 10:10:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-28 10:10:19,523 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-28 10:10:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:19,523 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-28 10:10:19,523 INFO L496 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-28 10:10:19,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-28 10:10:20,667 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-28 10:10:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-28 10:10:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:20,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:20,668 INFO L195 NwaCegarLoop]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:20,684 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-28 10:10:20,870 WARN L477 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-28 10:10:20,870 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:20,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1109045932, now seen corresponding path program 183 times [2022-04-28 10:10:20,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:20,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1977975905] [2022-04-28 10:10:20,873 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:20,873 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:20,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1109045932, now seen corresponding path program 184 times [2022-04-28 10:10:20,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:20,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917345984] [2022-04-28 10:10:20,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:20,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:21,243 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-28 10:10:21,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {59815#true} assume true; {59815#true} is VALID [2022-04-28 10:10:21,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59815#true} {59815#true} #50#return; {59815#true} is VALID [2022-04-28 10:10:21,244 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-28 10:10:21,244 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-28 10:10:21,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {59815#true} assume true; {59815#true} is VALID [2022-04-28 10:10:21,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59815#true} {59815#true} #50#return; {59815#true} is VALID [2022-04-28 10:10:21,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {59815#true} call #t~ret9 := main(); {59815#true} is VALID [2022-04-28 10:10:21,245 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-28 10:10:21,245 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-28 10:10:21,246 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-28 10:10:21,247 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-28 10:10:21,248 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-28 10:10:21,248 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-28 10:10:21,249 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-28 10:10:21,250 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-28 10:10:21,250 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-28 10:10:21,251 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-28 10:10:21,252 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-28 10:10:21,252 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-28 10:10:21,253 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-28 10:10:21,253 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-28 10:10:21,254 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-28 10:10:21,255 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-28 10:10:21,255 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-28 10:10:21,256 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-28 10:10:21,257 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-28 10:10:21,257 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-28 10:10:21,258 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-28 10:10:21,259 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-28 10:10:21,259 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-28 10:10:21,259 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-28 10:10:21,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {59816#false} ~cond := #in~cond; {59816#false} is VALID [2022-04-28 10:10:21,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {59816#false} assume 0 == ~cond; {59816#false} is VALID [2022-04-28 10:10:21,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {59816#false} assume !false; {59816#false} is VALID [2022-04-28 10:10:21,260 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-28 10:10:21,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:21,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917345984] [2022-04-28 10:10:21,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917345984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:21,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548424777] [2022-04-28 10:10:21,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:21,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:21,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:21,264 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-28 10:10:21,306 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-28 10:10:21,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:21,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:21,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:10:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:21,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:21,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {59815#true} call ULTIMATE.init(); {59815#true} is VALID [2022-04-28 10:10:21,637 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-28 10:10:21,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {59815#true} assume true; {59815#true} is VALID [2022-04-28 10:10:21,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59815#true} {59815#true} #50#return; {59815#true} is VALID [2022-04-28 10:10:21,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {59815#true} call #t~ret9 := main(); {59815#true} is VALID [2022-04-28 10:10:21,638 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-28 10:10:21,638 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-28 10:10:21,639 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-28 10:10:21,639 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-28 10:10:21,640 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-28 10:10:21,640 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-28 10:10:21,641 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-28 10:10:21,641 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-28 10:10:21,642 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-28 10:10:21,643 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-28 10:10:21,643 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-28 10:10:21,644 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-28 10:10:21,644 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-28 10:10:21,644 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-28 10:10:21,645 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-28 10:10:21,645 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-28 10:10:21,646 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-28 10:10:21,646 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-28 10:10:21,647 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-28 10:10:21,647 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-28 10:10:21,648 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-28 10:10:21,648 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-28 10:10:21,649 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-28 10:10:21,657 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-28 10:10:21,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {59816#false} ~cond := #in~cond; {59816#false} is VALID [2022-04-28 10:10:21,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {59816#false} assume 0 == ~cond; {59816#false} is VALID [2022-04-28 10:10:21,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {59816#false} assume !false; {59816#false} is VALID [2022-04-28 10:10:21,658 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-28 10:10:21,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:22,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {59816#false} assume !false; {59816#false} is VALID [2022-04-28 10:10:22,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {59816#false} assume 0 == ~cond; {59816#false} is VALID [2022-04-28 10:10:22,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {59816#false} ~cond := #in~cond; {59816#false} is VALID [2022-04-28 10:10:22,391 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-28 10:10:22,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {59951#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59816#false} is VALID [2022-04-28 10:10:22,393 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-28 10:10:22,393 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-28 10:10:22,394 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-28 10:10:22,395 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-28 10:10:22,395 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-28 10:10:22,396 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-28 10:10:22,397 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-28 10:10:22,397 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-28 10:10:22,398 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-28 10:10:22,398 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-28 10:10:22,399 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-28 10:10:22,399 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-28 10:10:22,400 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-28 10:10:22,401 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-28 10:10:22,401 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-28 10:10:22,402 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-28 10:10:22,403 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-28 10:10:22,403 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-28 10:10:22,404 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-28 10:10:22,405 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-28 10:10:22,405 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-28 10:10:22,406 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-28 10:10:22,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {59815#true} call #t~ret9 := main(); {59815#true} is VALID [2022-04-28 10:10:22,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59815#true} {59815#true} #50#return; {59815#true} is VALID [2022-04-28 10:10:22,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {59815#true} assume true; {59815#true} is VALID [2022-04-28 10:10:22,406 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-28 10:10:22,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {59815#true} call ULTIMATE.init(); {59815#true} is VALID [2022-04-28 10:10:22,406 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-28 10:10:22,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548424777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:22,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:22,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:10:22,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:22,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1977975905] [2022-04-28 10:10:22,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1977975905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:22,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:22,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:10:22,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962607244] [2022-04-28 10:10:22,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:22,407 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-28 10:10:22,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:22,407 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-28 10:10:22,428 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-28 10:10:22,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:10:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:22,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:10:22,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1759, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:10:22,429 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-28 10:10:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:25,742 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-04-28 10:10:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:10:25,742 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-28 10:10:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:25,742 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-28 10:10:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2022-04-28 10:10:25,742 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-28 10:10:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2022-04-28 10:10:25,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 59 transitions. [2022-04-28 10:10:25,788 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-28 10:10:25,788 INFO L225 Difference]: With dead ends: 77 [2022-04-28 10:10:25,788 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 10:10:25,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=961, Invalid=4589, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 10:10:25,789 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:25,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 114 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:10:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 10:10:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2022-04-28 10:10:26,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:26,413 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-28 10:10:26,413 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-28 10:10:26,413 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-28 10:10:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:26,414 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-28 10:10:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-04-28 10:10:26,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:26,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:26,414 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-28 10:10:26,414 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-28 10:10:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:26,415 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-28 10:10:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-04-28 10:10:26,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:26,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:26,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:26,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:26,415 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-28 10:10:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-28 10:10:26,415 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-28 10:10:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:26,416 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-28 10:10:26,416 INFO L496 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-28 10:10:26,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-28 10:10:27,539 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-28 10:10:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-28 10:10:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:27,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:27,540 INFO L195 NwaCegarLoop]: trace histogram [12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:27,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2022-04-28 10:10:27,740 WARN L477 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-28 10:10:27,740 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1208193771, now seen corresponding path program 185 times [2022-04-28 10:10:27,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:27,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1942093871] [2022-04-28 10:10:27,743 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:27,743 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1208193771, now seen corresponding path program 186 times [2022-04-28 10:10:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:27,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383766184] [2022-04-28 10:10:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:27,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:28,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:28,115 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-28 10:10:28,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {60515#true} assume true; {60515#true} is VALID [2022-04-28 10:10:28,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60515#true} {60515#true} #50#return; {60515#true} is VALID [2022-04-28 10:10:28,115 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-28 10:10:28,115 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-28 10:10:28,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {60515#true} assume true; {60515#true} is VALID [2022-04-28 10:10:28,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60515#true} {60515#true} #50#return; {60515#true} is VALID [2022-04-28 10:10:28,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {60515#true} call #t~ret9 := main(); {60515#true} is VALID [2022-04-28 10:10:28,116 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-28 10:10:28,116 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-28 10:10:28,117 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-28 10:10:28,117 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-28 10:10:28,118 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-28 10:10:28,118 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-28 10:10:28,119 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-28 10:10:28,119 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-28 10:10:28,120 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-28 10:10:28,120 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-28 10:10:28,121 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-28 10:10:28,121 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-28 10:10:28,122 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-28 10:10:28,122 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-28 10:10:28,123 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-28 10:10:28,123 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-28 10:10:28,124 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-28 10:10:28,124 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-28 10:10:28,125 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-28 10:10:28,125 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-28 10:10:28,126 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-28 10:10:28,126 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-28 10:10:28,127 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-28 10:10:28,127 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-28 10:10:28,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {60516#false} ~cond := #in~cond; {60516#false} is VALID [2022-04-28 10:10:28,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {60516#false} assume 0 == ~cond; {60516#false} is VALID [2022-04-28 10:10:28,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {60516#false} assume !false; {60516#false} is VALID [2022-04-28 10:10:28,127 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-28 10:10:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:28,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383766184] [2022-04-28 10:10:28,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383766184] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:28,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614172281] [2022-04-28 10:10:28,127 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:28,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:28,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:28,128 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-28 10:10:28,129 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-28 10:10:28,199 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:10:28,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:28,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:10:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:28,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:28,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {60515#true} call ULTIMATE.init(); {60515#true} is VALID [2022-04-28 10:10:28,529 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-28 10:10:28,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {60515#true} assume true; {60515#true} is VALID [2022-04-28 10:10:28,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60515#true} {60515#true} #50#return; {60515#true} is VALID [2022-04-28 10:10:28,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {60515#true} call #t~ret9 := main(); {60515#true} is VALID [2022-04-28 10:10:28,530 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-28 10:10:28,530 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-28 10:10:28,531 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-28 10:10:28,531 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-28 10:10:28,532 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-28 10:10:28,533 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-28 10:10:28,533 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-28 10:10:28,534 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-28 10:10:28,534 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-28 10:10:28,535 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-28 10:10:28,535 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-28 10:10:28,536 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-28 10:10:28,536 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-28 10:10:28,537 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-28 10:10:28,537 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-28 10:10:28,537 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-28 10:10:28,538 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-28 10:10:28,539 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-28 10:10:28,539 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-28 10:10:28,540 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-28 10:10:28,540 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-28 10:10:28,541 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-28 10:10:28,541 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-28 10:10:28,541 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-28 10:10:28,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {60516#false} ~cond := #in~cond; {60516#false} is VALID [2022-04-28 10:10:28,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {60516#false} assume 0 == ~cond; {60516#false} is VALID [2022-04-28 10:10:28,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {60516#false} assume !false; {60516#false} is VALID [2022-04-28 10:10:28,541 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-28 10:10:28,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:29,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {60516#false} assume !false; {60516#false} is VALID [2022-04-28 10:10:29,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {60516#false} assume 0 == ~cond; {60516#false} is VALID [2022-04-28 10:10:29,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {60516#false} ~cond := #in~cond; {60516#false} is VALID [2022-04-28 10:10:29,280 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-28 10:10:29,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {60651#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {60516#false} is VALID [2022-04-28 10:10:29,281 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-28 10:10:29,282 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-28 10:10:29,283 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-28 10:10:29,283 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-28 10:10:29,284 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-28 10:10:29,285 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-28 10:10:29,286 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-28 10:10:29,286 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-28 10:10:29,286 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-28 10:10:29,287 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-28 10:10:29,288 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-28 10:10:29,288 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-28 10:10:29,289 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-28 10:10:29,290 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-28 10:10:29,290 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-28 10:10:29,291 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-28 10:10:29,292 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-28 10:10:29,292 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-28 10:10:29,293 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-28 10:10:29,294 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-28 10:10:29,294 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-28 10:10:29,295 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-28 10:10:29,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {60515#true} call #t~ret9 := main(); {60515#true} is VALID [2022-04-28 10:10:29,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60515#true} {60515#true} #50#return; {60515#true} is VALID [2022-04-28 10:10:29,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {60515#true} assume true; {60515#true} is VALID [2022-04-28 10:10:29,295 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-28 10:10:29,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {60515#true} call ULTIMATE.init(); {60515#true} is VALID [2022-04-28 10:10:29,295 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-28 10:10:29,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614172281] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:29,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:29,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:10:29,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:29,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1942093871] [2022-04-28 10:10:29,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1942093871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:29,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:29,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:10:29,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352819393] [2022-04-28 10:10:29,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:29,296 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-28 10:10:29,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:29,296 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-28 10:10:29,317 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-28 10:10:29,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:10:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:29,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:10:29,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1746, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:10:29,318 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-28 10:10:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:33,500 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-28 10:10:33,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 10:10:33,500 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-28 10:10:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:33,500 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-28 10:10:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 69 transitions. [2022-04-28 10:10:33,501 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-28 10:10:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 69 transitions. [2022-04-28 10:10:33,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 69 transitions. [2022-04-28 10:10:33,555 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-28 10:10:33,555 INFO L225 Difference]: With dead ends: 86 [2022-04-28 10:10:33,555 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 10:10:33,556 INFO L412 NwaCegarLoop]: 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-28 10:10:33,556 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:33,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 127 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:10:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 10:10:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 52. [2022-04-28 10:10:34,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:34,180 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-28 10:10:34,180 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-28 10:10:34,180 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-28 10:10:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:34,180 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-28 10:10:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-28 10:10:34,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:34,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:34,181 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-28 10:10:34,181 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-28 10:10:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:34,181 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-28 10:10:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-28 10:10:34,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:34,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:34,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:34,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:34,182 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-28 10:10:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-28 10:10:34,182 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-28 10:10:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:34,182 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-28 10:10:34,182 INFO L496 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-28 10:10:34,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-28 10:10:35,352 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-28 10:10:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-28 10:10:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:35,353 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:35,353 INFO L195 NwaCegarLoop]: trace histogram [13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:35,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2022-04-28 10:10:35,553 WARN L477 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-28 10:10:35,553 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:35,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash 795750092, now seen corresponding path program 187 times [2022-04-28 10:10:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:35,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980172506] [2022-04-28 10:10:35,556 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:35,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:35,556 INFO L85 PathProgramCache]: Analyzing trace with hash 795750092, now seen corresponding path program 188 times [2022-04-28 10:10:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:35,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565212079] [2022-04-28 10:10:35,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,935 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-28 10:10:35,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {61261#true} assume true; {61261#true} is VALID [2022-04-28 10:10:35,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61261#true} {61261#true} #50#return; {61261#true} is VALID [2022-04-28 10:10:35,935 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-28 10:10:35,935 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-28 10:10:35,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {61261#true} assume true; {61261#true} is VALID [2022-04-28 10:10:35,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61261#true} {61261#true} #50#return; {61261#true} is VALID [2022-04-28 10:10:35,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {61261#true} call #t~ret9 := main(); {61261#true} is VALID [2022-04-28 10:10:35,936 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-28 10:10:35,936 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-28 10:10:35,936 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-28 10:10:35,937 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-28 10:10:35,938 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-28 10:10:35,938 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-28 10:10:35,939 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-28 10:10:35,939 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-28 10:10:35,940 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-28 10:10:35,940 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-28 10:10:35,941 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-28 10:10:35,941 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-28 10:10:35,942 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-28 10:10:35,942 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-28 10:10:35,943 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-28 10:10:35,943 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-28 10:10:35,943 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-28 10:10:35,944 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-28 10:10:35,945 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-28 10:10:35,945 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-28 10:10:35,946 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-28 10:10:35,946 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-28 10:10:35,947 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-28 10:10:35,947 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-28 10:10:35,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {61262#false} ~cond := #in~cond; {61262#false} is VALID [2022-04-28 10:10:35,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {61262#false} assume 0 == ~cond; {61262#false} is VALID [2022-04-28 10:10:35,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {61262#false} assume !false; {61262#false} is VALID [2022-04-28 10:10:35,947 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-28 10:10:35,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:35,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565212079] [2022-04-28 10:10:35,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565212079] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:35,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770198085] [2022-04-28 10:10:35,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:35,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:35,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:35,948 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-28 10:10:35,949 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-28 10:10:35,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:35,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:35,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:10:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:36,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {61261#true} call ULTIMATE.init(); {61261#true} is VALID [2022-04-28 10:10:36,330 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-28 10:10:36,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {61261#true} assume true; {61261#true} is VALID [2022-04-28 10:10:36,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61261#true} {61261#true} #50#return; {61261#true} is VALID [2022-04-28 10:10:36,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {61261#true} call #t~ret9 := main(); {61261#true} is VALID [2022-04-28 10:10:36,330 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-28 10:10:36,331 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-28 10:10:36,331 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-28 10:10:36,332 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-28 10:10:36,333 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-28 10:10:36,333 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-28 10:10:36,334 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-28 10:10:36,334 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-28 10:10:36,335 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-28 10:10:36,335 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-28 10:10:36,336 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-28 10:10:36,336 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-28 10:10:36,337 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-28 10:10:36,337 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-28 10:10:36,338 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-28 10:10:36,338 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-28 10:10:36,339 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-28 10:10:36,339 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-28 10:10:36,340 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-28 10:10:36,340 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-28 10:10:36,341 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-28 10:10:36,341 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-28 10:10:36,342 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-28 10:10:36,342 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-28 10:10:36,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {61262#false} ~cond := #in~cond; {61262#false} is VALID [2022-04-28 10:10:36,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {61262#false} assume 0 == ~cond; {61262#false} is VALID [2022-04-28 10:10:36,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {61262#false} assume !false; {61262#false} is VALID [2022-04-28 10:10:36,342 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-28 10:10:36,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:37,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {61262#false} assume !false; {61262#false} is VALID [2022-04-28 10:10:37,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {61262#false} assume 0 == ~cond; {61262#false} is VALID [2022-04-28 10:10:37,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {61262#false} ~cond := #in~cond; {61262#false} is VALID [2022-04-28 10:10:37,079 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-28 10:10:37,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {61397#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {61262#false} is VALID [2022-04-28 10:10:37,080 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-28 10:10:37,080 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-28 10:10:37,081 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-28 10:10:37,082 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-28 10:10:37,083 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-28 10:10:37,084 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-28 10:10:37,084 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-28 10:10:37,084 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-28 10:10:37,085 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-28 10:10:37,085 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-28 10:10:37,086 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-28 10:10:37,087 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-28 10:10:37,087 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-28 10:10:37,088 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-28 10:10:37,089 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-28 10:10:37,089 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-28 10:10:37,090 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-28 10:10:37,091 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-28 10:10:37,092 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-28 10:10:37,092 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-28 10:10:37,093 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-28 10:10:37,093 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-28 10:10:37,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {61261#true} call #t~ret9 := main(); {61261#true} is VALID [2022-04-28 10:10:37,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61261#true} {61261#true} #50#return; {61261#true} is VALID [2022-04-28 10:10:37,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {61261#true} assume true; {61261#true} is VALID [2022-04-28 10:10:37,094 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-28 10:10:37,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {61261#true} call ULTIMATE.init(); {61261#true} is VALID [2022-04-28 10:10:37,094 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-28 10:10:37,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770198085] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:37,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:37,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:10:37,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:37,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980172506] [2022-04-28 10:10:37,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980172506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:37,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:37,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:10:37,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996449973] [2022-04-28 10:10:37,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:37,095 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-28 10:10:37,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:37,095 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-28 10:10:37,117 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-28 10:10:37,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:10:37,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:37,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:10:37,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1729, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:10:37,117 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-28 10:10:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:41,841 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-04-28 10:10:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 10:10:41,841 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-28 10:10:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:41,841 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-28 10:10:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 76 transitions. [2022-04-28 10:10:41,842 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-28 10:10:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 76 transitions. [2022-04-28 10:10:41,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 76 transitions. [2022-04-28 10:10:41,902 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-28 10:10:41,902 INFO L225 Difference]: With dead ends: 94 [2022-04-28 10:10:41,902 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 10:10:41,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1216, Invalid=5426, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:10:41,903 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:41,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 125 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:10:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 10:10:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2022-04-28 10:10:42,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:42,529 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-28 10:10:42,529 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-28 10:10:42,529 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-28 10:10:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:42,530 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-04-28 10:10:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2022-04-28 10:10:42,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:42,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:42,530 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-28 10:10:42,530 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-28 10:10:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:42,530 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-04-28 10:10:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2022-04-28 10:10:42,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:42,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:42,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:42,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:42,531 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-28 10:10:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-28 10:10:42,531 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-28 10:10:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:42,531 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-28 10:10:42,531 INFO L496 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-28 10:10:42,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-28 10:10:43,718 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-28 10:10:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-28 10:10:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:43,718 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:43,718 INFO L195 NwaCegarLoop]: trace histogram [14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:43,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2022-04-28 10:10:43,919 WARN L477 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-28 10:10:43,919 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:43,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1572859189, now seen corresponding path program 189 times [2022-04-28 10:10:43,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:43,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1889829262] [2022-04-28 10:10:43,921 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:43,921 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:43,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1572859189, now seen corresponding path program 190 times [2022-04-28 10:10:43,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:43,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761941264] [2022-04-28 10:10:43,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:43,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:44,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:44,310 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-28 10:10:44,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {62043#true} assume true; {62043#true} is VALID [2022-04-28 10:10:44,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62043#true} {62043#true} #50#return; {62043#true} is VALID [2022-04-28 10:10:44,310 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-28 10:10:44,310 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-28 10:10:44,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {62043#true} assume true; {62043#true} is VALID [2022-04-28 10:10:44,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62043#true} {62043#true} #50#return; {62043#true} is VALID [2022-04-28 10:10:44,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {62043#true} call #t~ret9 := main(); {62043#true} is VALID [2022-04-28 10:10:44,311 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-28 10:10:44,311 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-28 10:10:44,312 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-28 10:10:44,312 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-28 10:10:44,313 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-28 10:10:44,313 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-28 10:10:44,314 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-28 10:10:44,314 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-28 10:10:44,315 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-28 10:10:44,315 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-28 10:10:44,316 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-28 10:10:44,316 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-28 10:10:44,317 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-28 10:10:44,317 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-28 10:10:44,318 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-28 10:10:44,318 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-28 10:10:44,319 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-28 10:10:44,319 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-28 10:10:44,320 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-28 10:10:44,320 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-28 10:10:44,321 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-28 10:10:44,321 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-28 10:10:44,322 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-28 10:10:44,322 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-28 10:10:44,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {62044#false} ~cond := #in~cond; {62044#false} is VALID [2022-04-28 10:10:44,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {62044#false} assume 0 == ~cond; {62044#false} is VALID [2022-04-28 10:10:44,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {62044#false} assume !false; {62044#false} is VALID [2022-04-28 10:10:44,322 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-28 10:10:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:44,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761941264] [2022-04-28 10:10:44,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761941264] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:44,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967582525] [2022-04-28 10:10:44,323 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:44,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:44,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:44,323 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-28 10:10:44,324 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-28 10:10:44,365 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:44,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:44,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:10:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:44,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:44,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {62043#true} call ULTIMATE.init(); {62043#true} is VALID [2022-04-28 10:10:44,710 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-28 10:10:44,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {62043#true} assume true; {62043#true} is VALID [2022-04-28 10:10:44,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62043#true} {62043#true} #50#return; {62043#true} is VALID [2022-04-28 10:10:44,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {62043#true} call #t~ret9 := main(); {62043#true} is VALID [2022-04-28 10:10:44,710 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-28 10:10:44,711 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-28 10:10:44,711 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-28 10:10:44,712 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-28 10:10:44,712 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-28 10:10:44,713 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-28 10:10:44,713 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-28 10:10:44,714 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-28 10:10:44,715 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-28 10:10:44,715 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-28 10:10:44,716 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-28 10:10:44,716 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-28 10:10:44,717 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-28 10:10:44,717 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-28 10:10:44,718 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-28 10:10:44,718 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-28 10:10:44,718 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-28 10:10:44,719 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-28 10:10:44,719 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-28 10:10:44,720 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-28 10:10:44,721 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-28 10:10:44,721 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-28 10:10:44,722 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-28 10:10:44,722 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-28 10:10:44,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {62044#false} ~cond := #in~cond; {62044#false} is VALID [2022-04-28 10:10:44,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {62044#false} assume 0 == ~cond; {62044#false} is VALID [2022-04-28 10:10:44,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {62044#false} assume !false; {62044#false} is VALID [2022-04-28 10:10:44,722 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-28 10:10:44,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:45,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {62044#false} assume !false; {62044#false} is VALID [2022-04-28 10:10:45,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {62044#false} assume 0 == ~cond; {62044#false} is VALID [2022-04-28 10:10:45,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {62044#false} ~cond := #in~cond; {62044#false} is VALID [2022-04-28 10:10:45,475 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-28 10:10:45,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {62179#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {62044#false} is VALID [2022-04-28 10:10:45,477 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-28 10:10:45,477 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-28 10:10:45,478 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-28 10:10:45,479 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-28 10:10:45,479 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-28 10:10:45,480 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-28 10:10:45,480 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-28 10:10:45,481 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-28 10:10:45,481 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-28 10:10:45,482 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-28 10:10:45,483 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-28 10:10:45,483 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-28 10:10:45,484 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-28 10:10:45,485 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-28 10:10:45,485 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-28 10:10:45,486 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-28 10:10:45,487 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-28 10:10:45,487 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-28 10:10:45,488 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-28 10:10:45,489 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-28 10:10:45,489 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-28 10:10:45,490 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-28 10:10:45,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {62043#true} call #t~ret9 := main(); {62043#true} is VALID [2022-04-28 10:10:45,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62043#true} {62043#true} #50#return; {62043#true} is VALID [2022-04-28 10:10:45,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {62043#true} assume true; {62043#true} is VALID [2022-04-28 10:10:45,490 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-28 10:10:45,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {62043#true} call ULTIMATE.init(); {62043#true} is VALID [2022-04-28 10:10:45,490 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-28 10:10:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967582525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:45,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:45,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:10:45,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1889829262] [2022-04-28 10:10:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1889829262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:45,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:45,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:10:45,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846203014] [2022-04-28 10:10:45,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:45,491 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-28 10:10:45,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:45,491 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-28 10:10:45,513 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-28 10:10:45,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:10:45,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:10:45,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:10:45,513 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-28 10:10:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:50,306 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-04-28 10:10:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:10:50,306 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-28 10:10:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:50,306 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-28 10:10:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 80 transitions. [2022-04-28 10:10:50,306 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-28 10:10:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 80 transitions. [2022-04-28 10:10:50,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 80 transitions. [2022-04-28 10:10:50,371 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-28 10:10:50,371 INFO L225 Difference]: With dead ends: 101 [2022-04-28 10:10:50,372 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 10:10:50,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1205, Invalid=5275, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 10:10:50,372 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:50,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 108 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:10:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 10:10:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 52. [2022-04-28 10:10:51,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:51,025 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-28 10:10:51,025 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-28 10:10:51,025 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-28 10:10:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:51,026 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-04-28 10:10:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-04-28 10:10:51,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:51,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:51,026 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-28 10:10:51,026 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-28 10:10:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:51,027 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-04-28 10:10:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-04-28 10:10:51,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:51,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:51,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:51,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:51,027 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-28 10:10:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-28 10:10:51,028 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-28 10:10:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:51,028 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-28 10:10:51,028 INFO L496 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-28 10:10:51,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-28 10:10:52,283 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-28 10:10:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-28 10:10:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:52,283 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:52,284 INFO L195 NwaCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:52,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2022-04-28 10:10:52,484 WARN L477 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-28 10:10:52,484 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1649265940, now seen corresponding path program 191 times [2022-04-28 10:10:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:52,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [595460846] [2022-04-28 10:10:52,486 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:52,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:52,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1649265940, now seen corresponding path program 192 times [2022-04-28 10:10:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:52,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499313721] [2022-04-28 10:10:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:52,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:52,860 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-28 10:10:52,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {62851#true} assume true; {62851#true} is VALID [2022-04-28 10:10:52,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62851#true} {62851#true} #50#return; {62851#true} is VALID [2022-04-28 10:10:52,860 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-28 10:10:52,860 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-28 10:10:52,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {62851#true} assume true; {62851#true} is VALID [2022-04-28 10:10:52,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62851#true} {62851#true} #50#return; {62851#true} is VALID [2022-04-28 10:10:52,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {62851#true} call #t~ret9 := main(); {62851#true} is VALID [2022-04-28 10:10:52,861 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-28 10:10:52,861 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-28 10:10:52,862 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-28 10:10:52,862 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-28 10:10:52,863 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-28 10:10:52,863 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-28 10:10:52,864 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-28 10:10:52,864 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-28 10:10:52,865 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-28 10:10:52,865 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-28 10:10:52,866 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-28 10:10:52,866 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-28 10:10:52,867 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-28 10:10:52,867 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-28 10:10:52,868 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-28 10:10:52,868 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-28 10:10:52,869 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-28 10:10:52,869 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-28 10:10:52,870 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-28 10:10:52,870 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-28 10:10:52,871 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-28 10:10:52,871 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-28 10:10:52,872 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-28 10:10:52,872 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-28 10:10:52,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {62852#false} ~cond := #in~cond; {62852#false} is VALID [2022-04-28 10:10:52,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {62852#false} assume 0 == ~cond; {62852#false} is VALID [2022-04-28 10:10:52,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {62852#false} assume !false; {62852#false} is VALID [2022-04-28 10:10:52,872 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-28 10:10:52,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:52,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499313721] [2022-04-28 10:10:52,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499313721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:52,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732074860] [2022-04-28 10:10:52,872 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:52,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:52,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:52,873 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-28 10:10:52,874 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-28 10:10:53,090 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:10:53,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:53,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:10:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:53,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:53,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {62851#true} call ULTIMATE.init(); {62851#true} is VALID [2022-04-28 10:10:53,410 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-28 10:10:53,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {62851#true} assume true; {62851#true} is VALID [2022-04-28 10:10:53,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62851#true} {62851#true} #50#return; {62851#true} is VALID [2022-04-28 10:10:53,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {62851#true} call #t~ret9 := main(); {62851#true} is VALID [2022-04-28 10:10:53,411 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-28 10:10:53,411 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-28 10:10:53,412 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-28 10:10:53,412 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-28 10:10:53,413 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-28 10:10:53,413 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-28 10:10:53,414 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-28 10:10:53,414 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-28 10:10:53,415 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-28 10:10:53,415 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-28 10:10:53,416 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-28 10:10:53,416 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-28 10:10:53,417 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-28 10:10:53,418 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-28 10:10:53,418 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-28 10:10:53,419 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-28 10:10:53,419 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-28 10:10:53,419 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-28 10:10:53,420 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-28 10:10:53,420 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-28 10:10:53,421 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-28 10:10:53,421 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-28 10:10:53,422 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-28 10:10:53,422 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-28 10:10:53,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {62852#false} ~cond := #in~cond; {62852#false} is VALID [2022-04-28 10:10:53,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {62852#false} assume 0 == ~cond; {62852#false} is VALID [2022-04-28 10:10:53,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {62852#false} assume !false; {62852#false} is VALID [2022-04-28 10:10:53,422 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-28 10:10:53,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:54,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {62852#false} assume !false; {62852#false} is VALID [2022-04-28 10:10:54,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {62852#false} assume 0 == ~cond; {62852#false} is VALID [2022-04-28 10:10:54,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {62852#false} ~cond := #in~cond; {62852#false} is VALID [2022-04-28 10:10:54,185 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-28 10:10:54,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {62987#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {62852#false} is VALID [2022-04-28 10:10:54,188 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-28 10:10:54,189 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-28 10:10:54,189 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-28 10:10:54,190 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-28 10:10:54,190 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-28 10:10:54,191 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-28 10:10:54,191 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-28 10:10:54,192 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-28 10:10:54,193 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-28 10:10:54,194 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-28 10:10:54,194 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-28 10:10:54,195 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-28 10:10:54,195 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-28 10:10:54,196 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-28 10:10:54,197 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-28 10:10:54,197 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-28 10:10:54,198 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-28 10:10:54,199 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-28 10:10:54,199 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-28 10:10:54,200 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-28 10:10:54,201 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-28 10:10:54,201 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-28 10:10:54,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {62851#true} call #t~ret9 := main(); {62851#true} is VALID [2022-04-28 10:10:54,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62851#true} {62851#true} #50#return; {62851#true} is VALID [2022-04-28 10:10:54,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {62851#true} assume true; {62851#true} is VALID [2022-04-28 10:10:54,201 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-28 10:10:54,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {62851#true} call ULTIMATE.init(); {62851#true} is VALID [2022-04-28 10:10:54,201 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-28 10:10:54,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732074860] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:54,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:54,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:10:54,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:54,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [595460846] [2022-04-28 10:10:54,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [595460846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:54,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:54,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:10:54,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495831287] [2022-04-28 10:10:54,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:54,202 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-28 10:10:54,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:54,202 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-28 10:10:54,223 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-28 10:10:54,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:10:54,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:54,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:10:54,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1695, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:10:54,224 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-28 10:10:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:59,481 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2022-04-28 10:10:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:10:59,481 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-28 10:10:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:59,481 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-28 10:10:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-28 10:10:59,482 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-28 10:10:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-28 10:10:59,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 81 transitions. [2022-04-28 10:10:59,547 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-28 10:10:59,548 INFO L225 Difference]: With dead ends: 107 [2022-04-28 10:10:59,548 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 10:10:59,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1115, Invalid=4737, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 10:10:59,549 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 48 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:59,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 137 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:10:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 10:11:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 52. [2022-04-28 10:11:00,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:00,179 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-28 10:11:00,179 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-28 10:11:00,179 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-28 10:11:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:00,180 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-04-28 10:11:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-04-28 10:11:00,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:00,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:00,180 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-28 10:11:00,180 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-28 10:11:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:00,181 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-04-28 10:11:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-04-28 10:11:00,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:00,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:00,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:00,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:00,181 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-28 10:11:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-28 10:11:00,182 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-28 10:11:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:00,182 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-28 10:11:00,182 INFO L496 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-28 10:11:00,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-28 10:11:01,385 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-28 10:11:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-28 10:11:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:11:01,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:01,385 INFO L195 NwaCegarLoop]: trace histogram [16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:01,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:01,586 WARN L477 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-28 10:11:01,586 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash -681899349, now seen corresponding path program 193 times [2022-04-28 10:11:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:01,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704353110] [2022-04-28 10:11:01,588 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:01,588 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash -681899349, now seen corresponding path program 194 times [2022-04-28 10:11:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:01,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310670039] [2022-04-28 10:11:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:01,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:01,968 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-28 10:11:01,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {63675#true} assume true; {63675#true} is VALID [2022-04-28 10:11:01,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63675#true} {63675#true} #50#return; {63675#true} is VALID [2022-04-28 10:11:01,969 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-28 10:11:01,969 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-28 10:11:01,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {63675#true} assume true; {63675#true} is VALID [2022-04-28 10:11:01,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63675#true} {63675#true} #50#return; {63675#true} is VALID [2022-04-28 10:11:01,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {63675#true} call #t~ret9 := main(); {63675#true} is VALID [2022-04-28 10:11:01,969 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-28 10:11:01,969 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-28 10:11:01,970 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-28 10:11:01,971 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-28 10:11:01,971 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-28 10:11:01,972 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-28 10:11:01,972 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-28 10:11:01,973 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-28 10:11:01,973 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-28 10:11:01,974 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-28 10:11:01,974 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-28 10:11:01,975 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-28 10:11:01,975 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-28 10:11:01,976 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-28 10:11:01,976 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-28 10:11:01,977 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-28 10:11:01,977 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-28 10:11:01,978 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-28 10:11:01,978 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-28 10:11:01,979 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-28 10:11:01,979 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-28 10:11:01,980 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-28 10:11:01,980 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-28 10:11:01,980 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-28 10:11:01,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {63676#false} ~cond := #in~cond; {63676#false} is VALID [2022-04-28 10:11:01,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {63676#false} assume 0 == ~cond; {63676#false} is VALID [2022-04-28 10:11:01,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {63676#false} assume !false; {63676#false} is VALID [2022-04-28 10:11:01,981 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-28 10:11:01,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:01,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310670039] [2022-04-28 10:11:01,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310670039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:01,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401714005] [2022-04-28 10:11:01,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:01,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:01,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:01,982 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-28 10:11:01,982 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-28 10:11:02,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:02,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:02,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:11:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:02,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:02,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {63675#true} call ULTIMATE.init(); {63675#true} is VALID [2022-04-28 10:11:02,339 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-28 10:11:02,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {63675#true} assume true; {63675#true} is VALID [2022-04-28 10:11:02,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63675#true} {63675#true} #50#return; {63675#true} is VALID [2022-04-28 10:11:02,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {63675#true} call #t~ret9 := main(); {63675#true} is VALID [2022-04-28 10:11:02,339 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-28 10:11:02,340 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-28 10:11:02,340 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-28 10:11:02,341 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-28 10:11:02,341 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-28 10:11:02,342 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-28 10:11:02,342 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-28 10:11:02,343 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-28 10:11:02,344 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-28 10:11:02,344 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-28 10:11:02,345 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-28 10:11:02,345 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-28 10:11:02,346 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-28 10:11:02,346 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-28 10:11:02,347 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-28 10:11:02,347 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-28 10:11:02,348 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-28 10:11:02,348 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-28 10:11:02,348 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-28 10:11:02,349 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-28 10:11:02,350 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-28 10:11:02,350 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-28 10:11:02,350 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-28 10:11:02,351 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-28 10:11:02,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {63676#false} ~cond := #in~cond; {63676#false} is VALID [2022-04-28 10:11:02,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {63676#false} assume 0 == ~cond; {63676#false} is VALID [2022-04-28 10:11:02,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {63676#false} assume !false; {63676#false} is VALID [2022-04-28 10:11:02,351 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-28 10:11:02,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:03,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {63676#false} assume !false; {63676#false} is VALID [2022-04-28 10:11:03,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {63676#false} assume 0 == ~cond; {63676#false} is VALID [2022-04-28 10:11:03,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {63676#false} ~cond := #in~cond; {63676#false} is VALID [2022-04-28 10:11:03,100 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-28 10:11:03,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {63811#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {63676#false} is VALID [2022-04-28 10:11:03,102 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-28 10:11:03,103 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-28 10:11:03,103 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-28 10:11:03,104 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-28 10:11:03,104 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-28 10:11:03,105 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-28 10:11:03,105 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-28 10:11:03,106 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-28 10:11:03,107 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-28 10:11:03,107 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-28 10:11:03,108 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-28 10:11:03,109 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-28 10:11:03,109 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-28 10:11:03,110 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-28 10:11:03,111 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-28 10:11:03,111 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-28 10:11:03,112 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-28 10:11:03,113 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-28 10:11:03,113 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-28 10:11:03,114 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-28 10:11:03,115 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-28 10:11:03,115 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-28 10:11:03,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {63675#true} call #t~ret9 := main(); {63675#true} is VALID [2022-04-28 10:11:03,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63675#true} {63675#true} #50#return; {63675#true} is VALID [2022-04-28 10:11:03,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {63675#true} assume true; {63675#true} is VALID [2022-04-28 10:11:03,115 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-28 10:11:03,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {63675#true} call ULTIMATE.init(); {63675#true} is VALID [2022-04-28 10:11:03,115 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-28 10:11:03,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401714005] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:03,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:03,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:11:03,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:03,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704353110] [2022-04-28 10:11:03,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704353110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:03,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:03,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:11:03,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983573673] [2022-04-28 10:11:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:03,116 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-28 10:11:03,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:03,116 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-28 10:11:03,137 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-28 10:11:03,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:11:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:11:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=1672, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:11:03,138 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-28 10:11:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:08,407 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2022-04-28 10:11:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:11:08,407 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-28 10:11:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:08,407 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-28 10:11:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 82 transitions. [2022-04-28 10:11:08,408 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-28 10:11:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 82 transitions. [2022-04-28 10:11:08,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 82 transitions. [2022-04-28 10:11:08,477 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-28 10:11:08,478 INFO L225 Difference]: With dead ends: 112 [2022-04-28 10:11:08,478 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 10:11:08,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1033, Invalid=4223, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:11:08,478 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 55 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:08,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 127 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:11:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 10:11:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 52. [2022-04-28 10:11:09,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:09,127 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-28 10:11:09,127 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-28 10:11:09,127 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-28 10:11:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:09,128 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2022-04-28 10:11:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2022-04-28 10:11:09,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:09,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:09,128 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-28 10:11:09,128 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-28 10:11:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:09,129 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2022-04-28 10:11:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2022-04-28 10:11:09,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:09,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:09,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:09,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:09,129 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-28 10:11:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-28 10:11:09,130 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-28 10:11:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:09,130 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-28 10:11:09,130 INFO L496 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-28 10:11:09,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-28 10:11:10,334 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-28 10:11:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-28 10:11:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:11:10,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:10,335 INFO L195 NwaCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:10,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2022-04-28 10:11:10,535 WARN L477 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-28 10:11:10,535 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1620525300, now seen corresponding path program 195 times [2022-04-28 10:11:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:10,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2005786811] [2022-04-28 10:11:10,540 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:10,540 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1620525300, now seen corresponding path program 196 times [2022-04-28 10:11:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:10,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906046917] [2022-04-28 10:11:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:10,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:10,915 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-28 10:11:10,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {64511#true} assume true; {64511#true} is VALID [2022-04-28 10:11:10,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64511#true} {64511#true} #50#return; {64511#true} is VALID [2022-04-28 10:11:10,916 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-28 10:11:10,916 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-28 10:11:10,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {64511#true} assume true; {64511#true} is VALID [2022-04-28 10:11:10,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64511#true} {64511#true} #50#return; {64511#true} is VALID [2022-04-28 10:11:10,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {64511#true} call #t~ret9 := main(); {64511#true} is VALID [2022-04-28 10:11:10,916 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-28 10:11:10,916 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-28 10:11:10,917 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-28 10:11:10,918 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-28 10:11:10,918 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-28 10:11:10,919 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-28 10:11:10,919 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-28 10:11:10,920 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-28 10:11:10,920 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-28 10:11:10,921 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-28 10:11:10,921 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-28 10:11:10,922 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-28 10:11:10,922 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-28 10:11:10,923 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-28 10:11:10,924 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-28 10:11:10,924 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-28 10:11:10,925 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-28 10:11:10,925 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-28 10:11:10,926 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-28 10:11:10,927 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-28 10:11:10,927 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-28 10:11:10,928 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-28 10:11:10,928 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-28 10:11:10,928 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-28 10:11:10,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {64512#false} ~cond := #in~cond; {64512#false} is VALID [2022-04-28 10:11:10,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {64512#false} assume 0 == ~cond; {64512#false} is VALID [2022-04-28 10:11:10,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {64512#false} assume !false; {64512#false} is VALID [2022-04-28 10:11:10,929 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-28 10:11:10,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:10,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906046917] [2022-04-28 10:11:10,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906046917] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:10,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155680349] [2022-04-28 10:11:10,929 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:10,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:10,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:10,930 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-28 10:11:10,930 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-28 10:11:10,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:10,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:10,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:11:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:10,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:11,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {64511#true} call ULTIMATE.init(); {64511#true} is VALID [2022-04-28 10:11:11,308 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-28 10:11:11,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {64511#true} assume true; {64511#true} is VALID [2022-04-28 10:11:11,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64511#true} {64511#true} #50#return; {64511#true} is VALID [2022-04-28 10:11:11,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {64511#true} call #t~ret9 := main(); {64511#true} is VALID [2022-04-28 10:11:11,308 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-28 10:11:11,309 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-28 10:11:11,309 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-28 10:11:11,310 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-28 10:11:11,310 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-28 10:11:11,311 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-28 10:11:11,311 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-28 10:11:11,312 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-28 10:11:11,312 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-28 10:11:11,313 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-28 10:11:11,313 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-28 10:11:11,314 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-28 10:11:11,314 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-28 10:11:11,315 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-28 10:11:11,315 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-28 10:11:11,316 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-28 10:11:11,316 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-28 10:11:11,317 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-28 10:11:11,317 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-28 10:11:11,318 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-28 10:11:11,318 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-28 10:11:11,319 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-28 10:11:11,319 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-28 10:11:11,319 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-28 10:11:11,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {64512#false} ~cond := #in~cond; {64512#false} is VALID [2022-04-28 10:11:11,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {64512#false} assume 0 == ~cond; {64512#false} is VALID [2022-04-28 10:11:11,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {64512#false} assume !false; {64512#false} is VALID [2022-04-28 10:11:11,320 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-28 10:11:11,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:12,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {64512#false} assume !false; {64512#false} is VALID [2022-04-28 10:11:12,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {64512#false} assume 0 == ~cond; {64512#false} is VALID [2022-04-28 10:11:12,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {64512#false} ~cond := #in~cond; {64512#false} is VALID [2022-04-28 10:11:12,082 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-28 10:11:12,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {64647#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {64512#false} is VALID [2022-04-28 10:11:12,083 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-28 10:11:12,083 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-28 10:11:12,084 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-28 10:11:12,084 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-28 10:11:12,085 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-28 10:11:12,086 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-28 10:11:12,086 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-28 10:11:12,087 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-28 10:11:12,087 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-28 10:11:12,088 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-28 10:11:12,089 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-28 10:11:12,089 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-28 10:11:12,090 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-28 10:11:12,091 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-28 10:11:12,091 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-28 10:11:12,092 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-28 10:11:12,093 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-28 10:11:12,093 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-28 10:11:12,094 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-28 10:11:12,095 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-28 10:11:12,095 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-28 10:11:12,096 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-28 10:11:12,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {64511#true} call #t~ret9 := main(); {64511#true} is VALID [2022-04-28 10:11:12,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64511#true} {64511#true} #50#return; {64511#true} is VALID [2022-04-28 10:11:12,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {64511#true} assume true; {64511#true} is VALID [2022-04-28 10:11:12,096 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-28 10:11:12,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {64511#true} call ULTIMATE.init(); {64511#true} is VALID [2022-04-28 10:11:12,096 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-28 10:11:12,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155680349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:12,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:12,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:11:12,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:12,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2005786811] [2022-04-28 10:11:12,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2005786811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:12,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:12,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:11:12,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010792853] [2022-04-28 10:11:12,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:12,097 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-28 10:11:12,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:12,097 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-28 10:11:12,119 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-28 10:11:12,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:11:12,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:11:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1645, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:11:12,119 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-28 10:11:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:17,564 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2022-04-28 10:11:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:11:17,564 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-28 10:11:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:17,564 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-28 10:11:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 84 transitions. [2022-04-28 10:11:17,565 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-28 10:11:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 84 transitions. [2022-04-28 10:11:17,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 84 transitions. [2022-04-28 10:11:17,634 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-28 10:11:17,635 INFO L225 Difference]: With dead ends: 116 [2022-04-28 10:11:17,635 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 10:11:17,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=986, Invalid=3844, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:11:17,635 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 63 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:17,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 137 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:11:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 10:11:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 52. [2022-04-28 10:11:18,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:18,270 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-28 10:11:18,270 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-28 10:11:18,270 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-28 10:11:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:18,271 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2022-04-28 10:11:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2022-04-28 10:11:18,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:18,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:18,272 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-28 10:11:18,272 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-28 10:11:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:18,273 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2022-04-28 10:11:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2022-04-28 10:11:18,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:18,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:18,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:18,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:18,273 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-28 10:11:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-28 10:11:18,273 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-28 10:11:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:18,273 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-28 10:11:18,273 INFO L496 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-28 10:11:18,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-28 10:11:19,496 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-28 10:11:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-28 10:11:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:11:19,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:19,497 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:19,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:19,697 WARN L477 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-28 10:11:19,697 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2089974411, now seen corresponding path program 197 times [2022-04-28 10:11:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:19,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1299442303] [2022-04-28 10:11:19,699 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:19,700 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:19,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2089974411, now seen corresponding path program 198 times [2022-04-28 10:11:19,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:19,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853101026] [2022-04-28 10:11:19,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:19,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:20,065 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-28 10:11:20,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {65357#true} assume true; {65357#true} is VALID [2022-04-28 10:11:20,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65357#true} {65357#true} #50#return; {65357#true} is VALID [2022-04-28 10:11:20,066 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-28 10:11:20,066 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-28 10:11:20,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {65357#true} assume true; {65357#true} is VALID [2022-04-28 10:11:20,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65357#true} {65357#true} #50#return; {65357#true} is VALID [2022-04-28 10:11:20,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {65357#true} call #t~ret9 := main(); {65357#true} is VALID [2022-04-28 10:11:20,066 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-28 10:11:20,067 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-28 10:11:20,067 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-28 10:11:20,068 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-28 10:11:20,068 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-28 10:11:20,069 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-28 10:11:20,069 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-28 10:11:20,070 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-28 10:11:20,070 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-28 10:11:20,071 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-28 10:11:20,071 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-28 10:11:20,072 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-28 10:11:20,072 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-28 10:11:20,073 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-28 10:11:20,073 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-28 10:11:20,074 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-28 10:11:20,075 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-28 10:11:20,075 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-28 10:11:20,076 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-28 10:11:20,076 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-28 10:11:20,076 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-28 10:11:20,077 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-28 10:11:20,077 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-28 10:11:20,077 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-28 10:11:20,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {65358#false} ~cond := #in~cond; {65358#false} is VALID [2022-04-28 10:11:20,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {65358#false} assume 0 == ~cond; {65358#false} is VALID [2022-04-28 10:11:20,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {65358#false} assume !false; {65358#false} is VALID [2022-04-28 10:11:20,078 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-28 10:11:20,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:20,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853101026] [2022-04-28 10:11:20,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853101026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:20,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954279001] [2022-04-28 10:11:20,078 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:20,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:20,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:20,079 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-28 10:11:20,079 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-28 10:11:20,390 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:11:20,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:20,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:11:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:20,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:20,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {65357#true} call ULTIMATE.init(); {65357#true} is VALID [2022-04-28 10:11:20,729 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-28 10:11:20,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {65357#true} assume true; {65357#true} is VALID [2022-04-28 10:11:20,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65357#true} {65357#true} #50#return; {65357#true} is VALID [2022-04-28 10:11:20,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {65357#true} call #t~ret9 := main(); {65357#true} is VALID [2022-04-28 10:11:20,729 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-28 10:11:20,730 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-28 10:11:20,730 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-28 10:11:20,731 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-28 10:11:20,731 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-28 10:11:20,732 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-28 10:11:20,732 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-28 10:11:20,733 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-28 10:11:20,733 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-28 10:11:20,734 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-28 10:11:20,734 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-28 10:11:20,735 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-28 10:11:20,735 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-28 10:11:20,736 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-28 10:11:20,736 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-28 10:11:20,737 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-28 10:11:20,738 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-28 10:11:20,738 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-28 10:11:20,739 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-28 10:11:20,739 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-28 10:11:20,739 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-28 10:11:20,740 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-28 10:11:20,740 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-28 10:11:20,740 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-28 10:11:20,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {65358#false} ~cond := #in~cond; {65358#false} is VALID [2022-04-28 10:11:20,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {65358#false} assume 0 == ~cond; {65358#false} is VALID [2022-04-28 10:11:20,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {65358#false} assume !false; {65358#false} is VALID [2022-04-28 10:11:20,741 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-28 10:11:20,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:21,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {65358#false} assume !false; {65358#false} is VALID [2022-04-28 10:11:21,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {65358#false} assume 0 == ~cond; {65358#false} is VALID [2022-04-28 10:11:21,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {65358#false} ~cond := #in~cond; {65358#false} is VALID [2022-04-28 10:11:21,515 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-28 10:11:21,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {65493#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {65358#false} is VALID [2022-04-28 10:11:21,516 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-28 10:11:21,516 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-28 10:11:21,517 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-28 10:11:21,517 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-28 10:11:21,518 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-28 10:11:21,519 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-28 10:11:21,519 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-28 10:11:21,520 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-28 10:11:21,521 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-28 10:11:21,521 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-28 10:11:21,522 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-28 10:11:21,523 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-28 10:11:21,523 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-28 10:11:21,524 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-28 10:11:21,525 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-28 10:11:21,525 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-28 10:11:21,526 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-28 10:11:21,527 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-28 10:11:21,527 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-28 10:11:21,528 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-28 10:11:21,528 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-28 10:11:21,529 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-28 10:11:21,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {65357#true} call #t~ret9 := main(); {65357#true} is VALID [2022-04-28 10:11:21,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65357#true} {65357#true} #50#return; {65357#true} is VALID [2022-04-28 10:11:21,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {65357#true} assume true; {65357#true} is VALID [2022-04-28 10:11:21,529 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-28 10:11:21,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {65357#true} call ULTIMATE.init(); {65357#true} is VALID [2022-04-28 10:11:21,529 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-28 10:11:21,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954279001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:21,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:21,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:11:21,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:21,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1299442303] [2022-04-28 10:11:21,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1299442303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:21,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:21,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:11:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661867611] [2022-04-28 10:11:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:21,530 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-28 10:11:21,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:21,530 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-28 10:11:21,550 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-28 10:11:21,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:11:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:21,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:11:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:11:21,551 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-28 10:11:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:27,409 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2022-04-28 10:11:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:11:27,410 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-28 10:11:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:27,410 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-28 10:11:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 87 transitions. [2022-04-28 10:11:27,410 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-28 10:11:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 87 transitions. [2022-04-28 10:11:27,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 87 transitions. [2022-04-28 10:11:27,482 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-28 10:11:27,483 INFO L225 Difference]: With dead ends: 119 [2022-04-28 10:11:27,483 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 10:11:27,483 INFO L412 NwaCegarLoop]: 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-28 10:11:27,483 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:27,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 152 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:11:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 10:11:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 52. [2022-04-28 10:11:28,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:28,123 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-28 10:11:28,123 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-28 10:11:28,123 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-28 10:11:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:28,124 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2022-04-28 10:11:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2022-04-28 10:11:28,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:28,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:28,124 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-28 10:11:28,124 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-28 10:11:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:28,125 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2022-04-28 10:11:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2022-04-28 10:11:28,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:28,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:28,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:28,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:28,125 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-28 10:11:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-28 10:11:28,126 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-28 10:11:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:28,126 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-28 10:11:28,126 INFO L496 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-28 10:11:28,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-28 10:11:29,897 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-28 10:11:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-28 10:11:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:11:29,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:29,898 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:29,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:30,098 WARN L477 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-28 10:11:30,098 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash -7089364, now seen corresponding path program 37 times [2022-04-28 10:11:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:30,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [753291082] [2022-04-28 10:11:30,101 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:30,101 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:30,101 INFO L85 PathProgramCache]: Analyzing trace with hash -7089364, now seen corresponding path program 38 times [2022-04-28 10:11:30,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:30,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717097369] [2022-04-28 10:11:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:30,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:30,500 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-28 10:11:30,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {66211#true} assume true; {66211#true} is VALID [2022-04-28 10:11:30,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66211#true} {66211#true} #50#return; {66211#true} is VALID [2022-04-28 10:11:30,500 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-28 10:11:30,500 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-28 10:11:30,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {66211#true} assume true; {66211#true} is VALID [2022-04-28 10:11:30,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66211#true} {66211#true} #50#return; {66211#true} is VALID [2022-04-28 10:11:30,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {66211#true} call #t~ret9 := main(); {66211#true} is VALID [2022-04-28 10:11:30,501 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-28 10:11:30,501 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-28 10:11:30,502 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-28 10:11:30,502 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-28 10:11:30,503 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-28 10:11:30,503 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-28 10:11:30,504 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-28 10:11:30,504 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-28 10:11:30,505 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-28 10:11:30,505 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-28 10:11:30,506 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-28 10:11:30,506 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-28 10:11:30,507 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-28 10:11:30,507 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-28 10:11:30,508 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-28 10:11:30,508 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-28 10:11:30,509 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-28 10:11:30,510 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-28 10:11:30,510 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-28 10:11:30,511 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-28 10:11:30,511 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-28 10:11:30,511 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-28 10:11:30,512 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-28 10:11:30,512 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-28 10:11:30,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {66212#false} ~cond := #in~cond; {66212#false} is VALID [2022-04-28 10:11:30,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {66212#false} assume 0 == ~cond; {66212#false} is VALID [2022-04-28 10:11:30,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {66212#false} assume !false; {66212#false} is VALID [2022-04-28 10:11:30,512 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-28 10:11:30,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:30,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717097369] [2022-04-28 10:11:30,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717097369] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:30,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404648305] [2022-04-28 10:11:30,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:30,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:30,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:30,513 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-28 10:11:30,514 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-28 10:11:30,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:30,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:30,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:11:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:30,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:30,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {66211#true} call ULTIMATE.init(); {66211#true} is VALID [2022-04-28 10:11:30,886 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-28 10:11:30,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {66211#true} assume true; {66211#true} is VALID [2022-04-28 10:11:30,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66211#true} {66211#true} #50#return; {66211#true} is VALID [2022-04-28 10:11:30,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {66211#true} call #t~ret9 := main(); {66211#true} is VALID [2022-04-28 10:11:30,887 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-28 10:11:30,887 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-28 10:11:30,888 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-28 10:11:30,888 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-28 10:11:30,889 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-28 10:11:30,889 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-28 10:11:30,890 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-28 10:11:30,890 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-28 10:11:30,891 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-28 10:11:30,891 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-28 10:11:30,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-28 10:11:30,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-28 10:11:30,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-28 10:11:30,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-28 10:11:30,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-28 10:11:30,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-28 10:11:30,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-28 10:11:30,896 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-28 10:11:30,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-28 10:11:30,897 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-28 10:11:30,897 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-28 10:11:30,897 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-28 10:11:30,898 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-28 10:11:30,898 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-28 10:11:30,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {66212#false} ~cond := #in~cond; {66212#false} is VALID [2022-04-28 10:11:30,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {66212#false} assume 0 == ~cond; {66212#false} is VALID [2022-04-28 10:11:30,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {66212#false} assume !false; {66212#false} is VALID [2022-04-28 10:11:30,898 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-28 10:11:30,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:31,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {66212#false} assume !false; {66212#false} is VALID [2022-04-28 10:11:31,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {66212#false} assume 0 == ~cond; {66212#false} is VALID [2022-04-28 10:11:31,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {66212#false} ~cond := #in~cond; {66212#false} is VALID [2022-04-28 10:11:31,688 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-28 10:11:31,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {66347#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {66212#false} is VALID [2022-04-28 10:11:31,688 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-28 10:11:31,688 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-28 10:11:31,689 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-28 10:11:31,690 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-28 10:11:31,691 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-28 10:11:31,691 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-28 10:11:31,692 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-28 10:11:31,693 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-28 10:11:31,693 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-28 10:11:31,694 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-28 10:11:31,695 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-28 10:11:31,695 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-28 10:11:31,696 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-28 10:11:31,697 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-28 10:11:31,697 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-28 10:11:31,698 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-28 10:11:31,699 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-28 10:11:31,699 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-28 10:11:31,700 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-28 10:11:31,701 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-28 10:11:31,701 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-28 10:11:31,702 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-28 10:11:31,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {66211#true} call #t~ret9 := main(); {66211#true} is VALID [2022-04-28 10:11:31,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66211#true} {66211#true} #50#return; {66211#true} is VALID [2022-04-28 10:11:31,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {66211#true} assume true; {66211#true} is VALID [2022-04-28 10:11:31,702 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-28 10:11:31,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {66211#true} call ULTIMATE.init(); {66211#true} is VALID [2022-04-28 10:11:31,702 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-28 10:11:31,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404648305] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:31,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:31,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:11:31,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:31,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [753291082] [2022-04-28 10:11:31,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [753291082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:31,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:31,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:11:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207121256] [2022-04-28 10:11:31,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:31,703 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-28 10:11:31,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:31,703 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-28 10:11:31,723 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-28 10:11:31,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:11:31,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:11:31,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:11:31,724 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-28 10:11:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:37,785 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2022-04-28 10:11:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:11:37,785 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-28 10:11:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:37,785 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-28 10:11:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 91 transitions. [2022-04-28 10:11:37,786 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-28 10:11:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 91 transitions. [2022-04-28 10:11:37,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 91 transitions. [2022-04-28 10:11:37,862 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-28 10:11:37,863 INFO L225 Difference]: With dead ends: 124 [2022-04-28 10:11:37,863 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 10:11:37,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:11:37,864 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 88 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:37,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 155 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:11:37,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 10:11:38,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 54. [2022-04-28 10:11:38,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:38,577 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-28 10:11:38,577 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-28 10:11:38,577 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-28 10:11:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:38,578 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2022-04-28 10:11:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-04-28 10:11:38,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:38,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:38,578 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-28 10:11:38,578 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-28 10:11:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:38,579 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2022-04-28 10:11:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-04-28 10:11:38,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:38,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:38,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:38,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:38,579 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-28 10:11:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-28 10:11:38,580 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-28 10:11:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:38,580 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-28 10:11:38,580 INFO L496 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-28 10:11:38,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-28 10:11:39,854 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-28 10:11:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 10:11:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:11:39,854 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:39,855 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:39,871 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-28 10:11:40,055 WARN L477 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-28 10:11:40,055 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash -736612169, now seen corresponding path program 199 times [2022-04-28 10:11:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:40,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2120882958] [2022-04-28 10:11:40,057 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:40,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash -736612169, now seen corresponding path program 200 times [2022-04-28 10:11:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:40,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713416316] [2022-04-28 10:11:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:41,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:41,072 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-28 10:11:41,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {67087#true} assume true; {67087#true} is VALID [2022-04-28 10:11:41,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67087#true} {67087#true} #50#return; {67087#true} is VALID [2022-04-28 10:11:41,073 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-28 10:11:41,073 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-28 10:11:41,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {67087#true} assume true; {67087#true} is VALID [2022-04-28 10:11:41,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67087#true} {67087#true} #50#return; {67087#true} is VALID [2022-04-28 10:11:41,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {67087#true} call #t~ret9 := main(); {67087#true} is VALID [2022-04-28 10:11:41,073 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-28 10:11:41,074 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-28 10:11:41,075 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-28 10:11:41,076 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-28 10:11:41,077 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-28 10:11:41,078 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-28 10:11:41,079 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-28 10:11:41,080 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-28 10:11:41,081 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-28 10:11:41,081 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-28 10:11:41,096 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-28 10:11:41,097 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-28 10:11:41,098 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-28 10:11:41,099 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-28 10:11:41,101 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-28 10:11:41,102 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-28 10:11:41,103 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-28 10:11:41,105 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-28 10:11:41,106 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-28 10:11:41,107 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-28 10:11:41,109 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-28 10:11:41,110 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-28 10:11:41,112 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-28 10:11:41,112 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-28 10:11:41,113 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-28 10:11:41,113 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-28 10:11:41,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {67115#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {67088#false} is VALID [2022-04-28 10:11:41,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {67088#false} assume !false; {67088#false} is VALID [2022-04-28 10:11:41,114 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-28 10:11:41,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:41,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713416316] [2022-04-28 10:11:41,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713416316] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:41,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41889052] [2022-04-28 10:11:41,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:41,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:41,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:41,115 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-28 10:11:41,116 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-28 10:11:41,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:41,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:41,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:11:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:41,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:41,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {67087#true} call ULTIMATE.init(); {67087#true} is VALID [2022-04-28 10:11:41,747 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-28 10:11:41,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {67087#true} assume true; {67087#true} is VALID [2022-04-28 10:11:41,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67087#true} {67087#true} #50#return; {67087#true} is VALID [2022-04-28 10:11:41,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {67087#true} call #t~ret9 := main(); {67087#true} is VALID [2022-04-28 10:11:41,748 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-28 10:11:41,749 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-28 10:11:41,749 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-28 10:11:41,750 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-28 10:11:41,750 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-28 10:11:41,751 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-28 10:11:41,751 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-28 10:11:41,752 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-28 10:11:41,752 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-28 10:11:41,753 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-28 10:11:41,754 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-28 10:11:41,754 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-28 10:11:41,754 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-28 10:11:41,755 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-28 10:11:41,755 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-28 10:11:41,756 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-28 10:11:41,756 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-28 10:11:41,757 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-28 10:11:41,757 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-28 10:11:41,758 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-28 10:11:41,759 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-28 10:11:41,759 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-28 10:11:41,760 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-28 10:11:41,760 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-28 10:11:41,761 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-28 10:11:41,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {67217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {67221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:41,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {67221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {67088#false} is VALID [2022-04-28 10:11:41,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {67088#false} assume !false; {67088#false} is VALID [2022-04-28 10:11:41,762 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-28 10:11:41,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:42,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {67088#false} assume !false; {67088#false} is VALID [2022-04-28 10:11:42,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {67221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {67088#false} is VALID [2022-04-28 10:11:42,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {67217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {67221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:42,470 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-28 10:11:42,470 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-28 10:11:42,471 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-28 10:11:42,472 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-28 10:11:42,473 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-28 10:11:42,474 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-28 10:11:42,474 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-28 10:11:42,475 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-28 10:11:42,476 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-28 10:11:42,477 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-28 10:11:42,477 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-28 10:11:42,478 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-28 10:11:42,479 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-28 10:11:42,479 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-28 10:11:42,480 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-28 10:11:42,480 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-28 10:11:42,483 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-28 10:11:42,483 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-28 10:11:42,484 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-28 10:11:42,485 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-28 10:11:42,486 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-28 10:11:42,486 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-28 10:11:42,487 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-28 10:11:42,488 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-28 10:11:42,488 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-28 10:11:42,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {67087#true} call #t~ret9 := main(); {67087#true} is VALID [2022-04-28 10:11:42,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67087#true} {67087#true} #50#return; {67087#true} is VALID [2022-04-28 10:11:42,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {67087#true} assume true; {67087#true} is VALID [2022-04-28 10:11:42,489 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-28 10:11:42,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {67087#true} call ULTIMATE.init(); {67087#true} is VALID [2022-04-28 10:11:42,489 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-28 10:11:42,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41889052] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:42,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:42,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 50 [2022-04-28 10:11:42,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:42,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2120882958] [2022-04-28 10:11:42,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2120882958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:42,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:42,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:11:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232977463] [2022-04-28 10:11:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:42,490 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-28 10:11:42,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:42,490 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-28 10:11:42,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-28 10:11:42,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:11:42,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:42,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:11:42,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2288, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:11:42,531 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-28 10:11:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:46,047 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 10:11:46,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:11:46,047 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-28 10:11:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:46,048 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-28 10:11:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 44 transitions. [2022-04-28 10:11:46,048 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-28 10:11:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 44 transitions. [2022-04-28 10:11:46,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 44 transitions. [2022-04-28 10:11:46,101 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-28 10:11:46,101 INFO L225 Difference]: With dead ends: 69 [2022-04-28 10:11:46,101 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 10:11:46,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=318, Invalid=4938, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:11:46,102 INFO L413 NwaCegarLoop]: 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-28 10:11:46,102 INFO L414 NwaCegarLoop]: 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-28 10:11:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 10:11:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-28 10:11:46,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:46,855 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-28 10:11:46,855 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-28 10:11:46,855 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-28 10:11:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:46,855 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 10:11:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 10:11:46,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:46,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:46,855 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-28 10:11:46,856 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-28 10:11:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:46,856 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 10:11:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 10:11:46,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:46,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:46,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:46,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:46,856 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-28 10:11:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:11:46,857 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-28 10:11:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:46,857 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:11:46,857 INFO L496 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-28 10:11:46,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:11:48,436 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-28 10:11:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:11:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:11:48,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:48,437 INFO L195 NwaCegarLoop]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:48,454 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-28 10:11:48,638 WARN L477 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-28 10:11:48,638 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash 55180598, now seen corresponding path program 201 times [2022-04-28 10:11:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:48,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1954857416] [2022-04-28 10:11:48,642 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:48,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:48,642 INFO L85 PathProgramCache]: Analyzing trace with hash 55180598, now seen corresponding path program 202 times [2022-04-28 10:11:48,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:48,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585691753] [2022-04-28 10:11:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:49,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:49,046 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-28 10:11:49,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {67759#true} assume true; {67759#true} is VALID [2022-04-28 10:11:49,046 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67759#true} {67759#true} #50#return; {67759#true} is VALID [2022-04-28 10:11:49,046 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-28 10:11:49,047 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-28 10:11:49,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {67759#true} assume true; {67759#true} is VALID [2022-04-28 10:11:49,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67759#true} {67759#true} #50#return; {67759#true} is VALID [2022-04-28 10:11:49,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {67759#true} call #t~ret9 := main(); {67759#true} is VALID [2022-04-28 10:11:49,047 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-28 10:11:49,047 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-28 10:11:49,048 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-28 10:11:49,049 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-28 10:11:49,049 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-28 10:11:49,050 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-28 10:11:49,050 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-28 10:11:49,051 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-28 10:11:49,051 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-28 10:11:49,052 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-28 10:11:49,052 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-28 10:11:49,053 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-28 10:11:49,053 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-28 10:11:49,054 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-28 10:11:49,054 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-28 10:11:49,055 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-28 10:11:49,055 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-28 10:11:49,056 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-28 10:11:49,056 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-28 10:11:49,057 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-28 10:11:49,057 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-28 10:11:49,058 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-28 10:11:49,058 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-28 10:11:49,059 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-28 10:11:49,059 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-28 10:11:49,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {67760#false} ~cond := #in~cond; {67760#false} is VALID [2022-04-28 10:11:49,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {67760#false} assume 0 == ~cond; {67760#false} is VALID [2022-04-28 10:11:49,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {67760#false} assume !false; {67760#false} is VALID [2022-04-28 10:11:49,059 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-28 10:11:49,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:49,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585691753] [2022-04-28 10:11:49,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585691753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:49,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130068795] [2022-04-28 10:11:49,060 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:49,061 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-28 10:11:49,061 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-28 10:11:49,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:49,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:49,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:11:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:49,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:49,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {67759#true} call ULTIMATE.init(); {67759#true} is VALID [2022-04-28 10:11:49,442 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-28 10:11:49,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {67759#true} assume true; {67759#true} is VALID [2022-04-28 10:11:49,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67759#true} {67759#true} #50#return; {67759#true} is VALID [2022-04-28 10:11:49,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {67759#true} call #t~ret9 := main(); {67759#true} is VALID [2022-04-28 10:11:49,442 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-28 10:11:49,443 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-28 10:11:49,443 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-28 10:11:49,444 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-28 10:11:49,445 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-28 10:11:49,445 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-28 10:11:49,446 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-28 10:11:49,446 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-28 10:11:49,447 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-28 10:11:49,447 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-28 10:11:49,448 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-28 10:11:49,448 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-28 10:11:49,449 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-28 10:11:49,449 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-28 10:11:49,450 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-28 10:11:49,450 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-28 10:11:49,451 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-28 10:11:49,451 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-28 10:11:49,452 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-28 10:11:49,452 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-28 10:11:49,453 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-28 10:11:49,453 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-28 10:11:49,454 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-28 10:11:49,454 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-28 10:11:49,454 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-28 10:11:49,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {67760#false} ~cond := #in~cond; {67760#false} is VALID [2022-04-28 10:11:49,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {67760#false} assume 0 == ~cond; {67760#false} is VALID [2022-04-28 10:11:49,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {67760#false} assume !false; {67760#false} is VALID [2022-04-28 10:11:49,455 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-28 10:11:49,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:50,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {67760#false} assume !false; {67760#false} is VALID [2022-04-28 10:11:50,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {67760#false} assume 0 == ~cond; {67760#false} is VALID [2022-04-28 10:11:50,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {67760#false} ~cond := #in~cond; {67760#false} is VALID [2022-04-28 10:11:50,259 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-28 10:11:50,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {67899#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67760#false} is VALID [2022-04-28 10:11:50,261 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-28 10:11:50,261 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-28 10:11:50,262 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-28 10:11:50,263 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-28 10:11:50,263 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-28 10:11:50,264 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-28 10:11:50,265 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-28 10:11:50,265 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-28 10:11:50,266 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-28 10:11:50,266 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-28 10:11:50,267 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-28 10:11:50,268 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-28 10:11:50,268 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-28 10:11:50,269 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-28 10:11:50,270 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-28 10:11:50,270 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-28 10:11:50,271 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-28 10:11:50,272 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-28 10:11:50,272 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-28 10:11:50,273 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-28 10:11:50,274 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-28 10:11:50,274 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-28 10:11:50,275 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-28 10:11:50,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {67759#true} call #t~ret9 := main(); {67759#true} is VALID [2022-04-28 10:11:50,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67759#true} {67759#true} #50#return; {67759#true} is VALID [2022-04-28 10:11:50,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {67759#true} assume true; {67759#true} is VALID [2022-04-28 10:11:50,275 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-28 10:11:50,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {67759#true} call ULTIMATE.init(); {67759#true} is VALID [2022-04-28 10:11:50,275 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-28 10:11:50,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130068795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:50,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:50,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:11:50,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:50,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1954857416] [2022-04-28 10:11:50,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1954857416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:50,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:50,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:11:50,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598182005] [2022-04-28 10:11:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:50,276 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-28 10:11:50,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:50,277 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-28 10:11:50,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:50,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:11:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:50,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:11:50,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:11:50,301 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-28 10:11:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:54,232 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-04-28 10:11:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:11:54,232 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-28 10:11:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:54,233 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-28 10:11:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2022-04-28 10:11:54,233 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-28 10:11:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2022-04-28 10:11:54,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 61 transitions. [2022-04-28 10:11:54,283 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-28 10:11:54,283 INFO L225 Difference]: With dead ends: 82 [2022-04-28 10:11:54,283 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 10:11:54,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1049, Invalid=5113, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 10:11:54,284 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:54,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 99 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:11:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 10:11:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2022-04-28 10:11:55,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:55,047 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-28 10:11:55,047 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-28 10:11:55,047 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-28 10:11:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:55,048 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-28 10:11:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-28 10:11:55,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:55,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:55,048 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-28 10:11:55,048 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-28 10:11:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:55,049 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-28 10:11:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-28 10:11:55,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:55,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:55,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:55,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:55,049 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-28 10:11:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:11:55,049 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-28 10:11:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:55,049 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:11:55,049 INFO L496 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-28 10:11:55,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:11:56,652 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-28 10:11:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:11:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:11:56,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:56,653 INFO L195 NwaCegarLoop]: trace histogram [12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:56,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2022-04-28 10:11:56,853 WARN L477 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-28 10:11:56,853 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:56,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1166203689, now seen corresponding path program 203 times [2022-04-28 10:11:56,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:56,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758383451] [2022-04-28 10:11:56,856 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:56,856 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1166203689, now seen corresponding path program 204 times [2022-04-28 10:11:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:56,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540166674] [2022-04-28 10:11:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:57,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:57,261 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-28 10:11:57,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {68497#true} assume true; {68497#true} is VALID [2022-04-28 10:11:57,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68497#true} {68497#true} #50#return; {68497#true} is VALID [2022-04-28 10:11:57,261 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-28 10:11:57,261 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-28 10:11:57,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {68497#true} assume true; {68497#true} is VALID [2022-04-28 10:11:57,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68497#true} {68497#true} #50#return; {68497#true} is VALID [2022-04-28 10:11:57,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {68497#true} call #t~ret9 := main(); {68497#true} is VALID [2022-04-28 10:11:57,262 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-28 10:11:57,262 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-28 10:11:57,263 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-28 10:11:57,263 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-28 10:11:57,264 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-28 10:11:57,264 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-28 10:11:57,265 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-28 10:11:57,266 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-28 10:11:57,266 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-28 10:11:57,267 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-28 10:11:57,267 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-28 10:11:57,268 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-28 10:11:57,268 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-28 10:11:57,269 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-28 10:11:57,269 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-28 10:11:57,270 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-28 10:11:57,270 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-28 10:11:57,271 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-28 10:11:57,271 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-28 10:11:57,272 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-28 10:11:57,272 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-28 10:11:57,273 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-28 10:11:57,273 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-28 10:11:57,274 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-28 10:11:57,274 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-28 10:11:57,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {68498#false} ~cond := #in~cond; {68498#false} is VALID [2022-04-28 10:11:57,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {68498#false} assume 0 == ~cond; {68498#false} is VALID [2022-04-28 10:11:57,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {68498#false} assume !false; {68498#false} is VALID [2022-04-28 10:11:57,274 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-28 10:11:57,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:57,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540166674] [2022-04-28 10:11:57,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540166674] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:57,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890761661] [2022-04-28 10:11:57,275 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:57,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:57,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:57,276 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-28 10:11:57,276 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-28 10:11:57,348 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:11:57,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:57,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:11:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:57,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:57,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {68497#true} call ULTIMATE.init(); {68497#true} is VALID [2022-04-28 10:11:57,702 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-28 10:11:57,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {68497#true} assume true; {68497#true} is VALID [2022-04-28 10:11:57,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68497#true} {68497#true} #50#return; {68497#true} is VALID [2022-04-28 10:11:57,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {68497#true} call #t~ret9 := main(); {68497#true} is VALID [2022-04-28 10:11:57,702 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-28 10:11:57,703 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-28 10:11:57,703 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-28 10:11:57,704 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-28 10:11:57,704 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-28 10:11:57,705 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-28 10:11:57,706 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-28 10:11:57,706 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-28 10:11:57,707 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-28 10:11:57,707 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-28 10:11:57,708 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-28 10:11:57,708 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-28 10:11:57,709 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-28 10:11:57,709 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-28 10:11:57,710 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-28 10:11:57,710 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-28 10:11:57,711 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-28 10:11:57,711 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-28 10:11:57,712 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-28 10:11:57,712 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-28 10:11:57,713 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-28 10:11:57,713 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-28 10:11:57,714 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-28 10:11:57,714 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-28 10:11:57,714 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-28 10:11:57,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {68498#false} ~cond := #in~cond; {68498#false} is VALID [2022-04-28 10:11:57,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {68498#false} assume 0 == ~cond; {68498#false} is VALID [2022-04-28 10:11:57,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {68498#false} assume !false; {68498#false} is VALID [2022-04-28 10:11:57,715 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-28 10:11:57,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:58,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {68498#false} assume !false; {68498#false} is VALID [2022-04-28 10:11:58,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {68498#false} assume 0 == ~cond; {68498#false} is VALID [2022-04-28 10:11:58,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {68498#false} ~cond := #in~cond; {68498#false} is VALID [2022-04-28 10:11:58,563 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-28 10:11:58,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {68637#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {68498#false} is VALID [2022-04-28 10:11:58,564 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-28 10:11:58,565 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-28 10:11:58,565 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-28 10:11:58,566 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-28 10:11:58,567 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-28 10:11:58,567 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-28 10:11:58,568 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-28 10:11:58,569 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-28 10:11:58,569 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-28 10:11:58,569 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-28 10:11:58,570 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-28 10:11:58,571 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-28 10:11:58,572 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-28 10:11:58,572 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-28 10:11:58,573 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-28 10:11:58,574 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-28 10:11:58,575 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-28 10:11:58,575 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-28 10:11:58,576 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-28 10:11:58,577 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-28 10:11:58,578 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-28 10:11:58,578 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-28 10:11:58,579 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-28 10:11:58,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {68497#true} call #t~ret9 := main(); {68497#true} is VALID [2022-04-28 10:11:58,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68497#true} {68497#true} #50#return; {68497#true} is VALID [2022-04-28 10:11:58,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {68497#true} assume true; {68497#true} is VALID [2022-04-28 10:11:58,579 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-28 10:11:58,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {68497#true} call ULTIMATE.init(); {68497#true} is VALID [2022-04-28 10:11:58,579 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-28 10:11:58,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890761661] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:58,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:58,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:11:58,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:58,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758383451] [2022-04-28 10:11:58,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758383451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:58,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:58,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:11:58,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602219073] [2022-04-28 10:11:58,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:58,580 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-28 10:11:58,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:58,580 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-28 10:11:58,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:58,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:11:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:58,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:11:58,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1914, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:11:58,607 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-28 10:12:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:03,450 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-04-28 10:12:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 10:12:03,450 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-28 10:12:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:03,450 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-28 10:12:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions. [2022-04-28 10:12:03,451 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-28 10:12:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions. [2022-04-28 10:12:03,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 72 transitions. [2022-04-28 10:12:03,510 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-28 10:12:03,510 INFO L225 Difference]: With dead ends: 92 [2022-04-28 10:12:03,510 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 10:12:03,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1241, Invalid=5899, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 10:12:03,511 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:03,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 102 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:12:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 10:12:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2022-04-28 10:12:04,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:04,290 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-28 10:12:04,290 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-28 10:12:04,290 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-28 10:12:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:04,291 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-28 10:12:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-04-28 10:12:04,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:04,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:04,291 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-28 10:12:04,291 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-28 10:12:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:04,292 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-28 10:12:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-04-28 10:12:04,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:04,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:04,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:04,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:04,292 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-28 10:12:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:12:04,292 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-28 10:12:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:04,293 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:12:04,293 INFO L496 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-28 10:12:04,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:12:05,923 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-28 10:12:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:12:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:12:05,924 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:05,924 INFO L195 NwaCegarLoop]: trace histogram [13, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:05,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2022-04-28 10:12:06,124 WARN L477 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-28 10:12:06,124 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1067055850, now seen corresponding path program 205 times [2022-04-28 10:12:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:06,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1522718460] [2022-04-28 10:12:06,127 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:06,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1067055850, now seen corresponding path program 206 times [2022-04-28 10:12:06,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:06,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559742039] [2022-04-28 10:12:06,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:06,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:06,544 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-28 10:12:06,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {69287#true} assume true; {69287#true} is VALID [2022-04-28 10:12:06,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69287#true} {69287#true} #50#return; {69287#true} is VALID [2022-04-28 10:12:06,544 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-28 10:12:06,544 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-28 10:12:06,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {69287#true} assume true; {69287#true} is VALID [2022-04-28 10:12:06,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69287#true} {69287#true} #50#return; {69287#true} is VALID [2022-04-28 10:12:06,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {69287#true} call #t~ret9 := main(); {69287#true} is VALID [2022-04-28 10:12:06,545 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-28 10:12:06,545 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-28 10:12:06,546 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-28 10:12:06,546 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-28 10:12:06,547 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-28 10:12:06,547 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-28 10:12:06,548 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-28 10:12:06,548 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-28 10:12:06,549 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-28 10:12:06,549 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-28 10:12:06,550 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-28 10:12:06,550 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-28 10:12:06,551 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-28 10:12:06,552 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-28 10:12:06,552 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-28 10:12:06,552 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-28 10:12:06,553 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-28 10:12:06,553 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-28 10:12:06,554 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-28 10:12:06,554 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-28 10:12:06,555 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-28 10:12:06,555 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-28 10:12:06,556 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-28 10:12:06,556 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-28 10:12:06,557 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-28 10:12:06,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {69288#false} ~cond := #in~cond; {69288#false} is VALID [2022-04-28 10:12:06,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {69288#false} assume 0 == ~cond; {69288#false} is VALID [2022-04-28 10:12:06,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {69288#false} assume !false; {69288#false} is VALID [2022-04-28 10:12:06,557 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-28 10:12:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559742039] [2022-04-28 10:12:06,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559742039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541682566] [2022-04-28 10:12:06,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:06,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:06,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:06,558 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-28 10:12:06,559 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-28 10:12:06,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:06,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:06,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:12:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:06,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:06,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {69287#true} call ULTIMATE.init(); {69287#true} is VALID [2022-04-28 10:12:06,934 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-28 10:12:06,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {69287#true} assume true; {69287#true} is VALID [2022-04-28 10:12:06,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69287#true} {69287#true} #50#return; {69287#true} is VALID [2022-04-28 10:12:06,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {69287#true} call #t~ret9 := main(); {69287#true} is VALID [2022-04-28 10:12:06,935 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-28 10:12:06,935 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-28 10:12:06,936 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-28 10:12:06,936 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-28 10:12:06,937 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-28 10:12:06,937 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-28 10:12:06,938 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-28 10:12:06,938 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-28 10:12:06,939 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-28 10:12:06,940 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-28 10:12:06,940 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-28 10:12:06,941 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-28 10:12:06,941 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-28 10:12:06,942 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-28 10:12:06,942 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-28 10:12:06,942 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-28 10:12:06,943 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-28 10:12:06,943 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-28 10:12:06,944 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-28 10:12:06,945 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-28 10:12:06,945 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-28 10:12:06,946 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-28 10:12:06,946 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-28 10:12:06,947 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-28 10:12:06,947 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-28 10:12:06,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {69288#false} ~cond := #in~cond; {69288#false} is VALID [2022-04-28 10:12:06,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {69288#false} assume 0 == ~cond; {69288#false} is VALID [2022-04-28 10:12:06,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {69288#false} assume !false; {69288#false} is VALID [2022-04-28 10:12:06,947 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-28 10:12:06,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:07,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {69288#false} assume !false; {69288#false} is VALID [2022-04-28 10:12:07,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {69288#false} assume 0 == ~cond; {69288#false} is VALID [2022-04-28 10:12:07,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {69288#false} ~cond := #in~cond; {69288#false} is VALID [2022-04-28 10:12:07,788 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-28 10:12:07,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {69427#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {69288#false} is VALID [2022-04-28 10:12:07,789 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-28 10:12:07,789 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-28 10:12:07,790 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-28 10:12:07,791 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-28 10:12:07,792 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-28 10:12:07,792 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-28 10:12:07,793 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-28 10:12:07,793 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-28 10:12:07,794 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-28 10:12:07,794 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-28 10:12:07,795 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-28 10:12:07,796 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-28 10:12:07,796 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-28 10:12:07,797 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-28 10:12:07,798 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-28 10:12:07,798 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-28 10:12:07,799 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-28 10:12:07,800 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-28 10:12:07,800 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-28 10:12:07,801 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-28 10:12:07,802 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-28 10:12:07,802 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-28 10:12:07,803 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-28 10:12:07,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {69287#true} call #t~ret9 := main(); {69287#true} is VALID [2022-04-28 10:12:07,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69287#true} {69287#true} #50#return; {69287#true} is VALID [2022-04-28 10:12:07,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {69287#true} assume true; {69287#true} is VALID [2022-04-28 10:12:07,803 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-28 10:12:07,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {69287#true} call ULTIMATE.init(); {69287#true} is VALID [2022-04-28 10:12:07,803 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-28 10:12:07,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541682566] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:07,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:07,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:12:07,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:07,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1522718460] [2022-04-28 10:12:07,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1522718460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:07,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:07,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:12:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081911638] [2022-04-28 10:12:07,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:07,804 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-28 10:12:07,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:07,804 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-28 10:12:07,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:07,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:12:07,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:12:07,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1899, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:12:07,828 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-28 10:12:13,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:13,657 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-04-28 10:12:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 10:12:13,658 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-28 10:12:13,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:13,658 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-28 10:12:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 80 transitions. [2022-04-28 10:12:13,659 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-28 10:12:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 80 transitions. [2022-04-28 10:12:13,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 80 transitions. [2022-04-28 10:12:13,739 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-28 10:12:13,740 INFO L225 Difference]: With dead ends: 101 [2022-04-28 10:12:13,740 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 10:12:13,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1361, Invalid=6295, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:12:13,741 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:13,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:12:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 10:12:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 55. [2022-04-28 10:12:14,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:14,520 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-28 10:12:14,521 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-28 10:12:14,521 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-28 10:12:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:14,521 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-04-28 10:12:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-04-28 10:12:14,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:14,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:14,522 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-28 10:12:14,522 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-28 10:12:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:14,522 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-04-28 10:12:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-04-28 10:12:14,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:14,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:14,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:14,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:14,523 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-28 10:12:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:12:14,523 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-28 10:12:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:14,523 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:12:14,523 INFO L496 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-28 10:12:14,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:12:16,238 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-28 10:12:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:12:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:12:16,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:16,238 INFO L195 NwaCegarLoop]: trace histogram [14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:16,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2022-04-28 10:12:16,438 WARN L477 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-28 10:12:16,439 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:16,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1479499529, now seen corresponding path program 207 times [2022-04-28 10:12:16,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:16,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349433929] [2022-04-28 10:12:16,441 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:16,441 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1479499529, now seen corresponding path program 208 times [2022-04-28 10:12:16,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:16,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040468259] [2022-04-28 10:12:16,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:16,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:16,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:16,868 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-28 10:12:16,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {70119#true} assume true; {70119#true} is VALID [2022-04-28 10:12:16,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70119#true} {70119#true} #50#return; {70119#true} is VALID [2022-04-28 10:12:16,869 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-28 10:12:16,869 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-28 10:12:16,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {70119#true} assume true; {70119#true} is VALID [2022-04-28 10:12:16,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70119#true} {70119#true} #50#return; {70119#true} is VALID [2022-04-28 10:12:16,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {70119#true} call #t~ret9 := main(); {70119#true} is VALID [2022-04-28 10:12:16,869 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-28 10:12:16,870 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-28 10:12:16,870 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-28 10:12:16,871 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-28 10:12:16,871 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-28 10:12:16,872 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-28 10:12:16,873 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-28 10:12:16,873 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-28 10:12:16,874 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-28 10:12:16,874 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-28 10:12:16,875 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-28 10:12:16,875 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-28 10:12:16,876 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-28 10:12:16,876 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-28 10:12:16,877 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-28 10:12:16,877 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-28 10:12:16,878 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-28 10:12:16,878 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-28 10:12:16,879 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-28 10:12:16,879 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-28 10:12:16,880 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-28 10:12:16,880 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-28 10:12:16,881 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-28 10:12:16,881 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-28 10:12:16,882 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-28 10:12:16,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {70120#false} ~cond := #in~cond; {70120#false} is VALID [2022-04-28 10:12:16,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {70120#false} assume 0 == ~cond; {70120#false} is VALID [2022-04-28 10:12:16,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {70120#false} assume !false; {70120#false} is VALID [2022-04-28 10:12:16,882 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-28 10:12:16,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:16,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040468259] [2022-04-28 10:12:16,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040468259] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:16,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795579210] [2022-04-28 10:12:16,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:16,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:16,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:16,883 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-28 10:12:16,884 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-28 10:12:16,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:16,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:16,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:12:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:16,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:17,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {70119#true} call ULTIMATE.init(); {70119#true} is VALID [2022-04-28 10:12:17,283 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-28 10:12:17,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {70119#true} assume true; {70119#true} is VALID [2022-04-28 10:12:17,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70119#true} {70119#true} #50#return; {70119#true} is VALID [2022-04-28 10:12:17,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {70119#true} call #t~ret9 := main(); {70119#true} is VALID [2022-04-28 10:12:17,284 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-28 10:12:17,284 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-28 10:12:17,284 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-28 10:12:17,285 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-28 10:12:17,286 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-28 10:12:17,286 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-28 10:12:17,287 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-28 10:12:17,287 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-28 10:12:17,288 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-28 10:12:17,288 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-28 10:12:17,289 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-28 10:12:17,289 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-28 10:12:17,290 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-28 10:12:17,290 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-28 10:12:17,291 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-28 10:12:17,291 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-28 10:12:17,292 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-28 10:12:17,292 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-28 10:12:17,293 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-28 10:12:17,293 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-28 10:12:17,294 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-28 10:12:17,294 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-28 10:12:17,295 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-28 10:12:17,295 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-28 10:12:17,295 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-28 10:12:17,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {70120#false} ~cond := #in~cond; {70120#false} is VALID [2022-04-28 10:12:17,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {70120#false} assume 0 == ~cond; {70120#false} is VALID [2022-04-28 10:12:17,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {70120#false} assume !false; {70120#false} is VALID [2022-04-28 10:12:17,296 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-28 10:12:17,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:18,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {70120#false} assume !false; {70120#false} is VALID [2022-04-28 10:12:18,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {70120#false} assume 0 == ~cond; {70120#false} is VALID [2022-04-28 10:12:18,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {70120#false} ~cond := #in~cond; {70120#false} is VALID [2022-04-28 10:12:18,151 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-28 10:12:18,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {70259#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70120#false} is VALID [2022-04-28 10:12:18,152 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-28 10:12:18,153 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-28 10:12:18,154 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-28 10:12:18,154 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-28 10:12:18,155 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-28 10:12:18,156 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-28 10:12:18,156 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-28 10:12:18,156 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-28 10:12:18,157 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-28 10:12:18,158 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-28 10:12:18,158 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-28 10:12:18,159 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-28 10:12:18,160 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-28 10:12:18,161 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-28 10:12:18,161 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-28 10:12:18,162 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-28 10:12:18,163 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-28 10:12:18,164 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-28 10:12:18,164 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-28 10:12:18,165 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-28 10:12:18,166 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-28 10:12:18,166 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-28 10:12:18,167 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-28 10:12:18,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {70119#true} call #t~ret9 := main(); {70119#true} is VALID [2022-04-28 10:12:18,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70119#true} {70119#true} #50#return; {70119#true} is VALID [2022-04-28 10:12:18,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {70119#true} assume true; {70119#true} is VALID [2022-04-28 10:12:18,167 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-28 10:12:18,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {70119#true} call ULTIMATE.init(); {70119#true} is VALID [2022-04-28 10:12:18,167 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-28 10:12:18,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795579210] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:18,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:18,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:12:18,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:18,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349433929] [2022-04-28 10:12:18,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349433929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:18,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:18,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:12:18,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734746798] [2022-04-28 10:12:18,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:18,168 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-28 10:12:18,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:18,168 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-28 10:12:18,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:18,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:12:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:18,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:12:18,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1882, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:12:18,192 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-28 10:12:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:24,631 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2022-04-28 10:12:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 10:12:24,631 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-28 10:12:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:24,631 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-28 10:12:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 85 transitions. [2022-04-28 10:12:24,632 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-28 10:12:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 85 transitions. [2022-04-28 10:12:24,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 85 transitions. [2022-04-28 10:12:24,707 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-28 10:12:24,708 INFO L225 Difference]: With dead ends: 109 [2022-04-28 10:12:24,708 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 10:12:24,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1392, Invalid=6264, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:12:24,708 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:24,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 133 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:12:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 10:12:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 55. [2022-04-28 10:12:25,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:25,499 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-28 10:12:25,499 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-28 10:12:25,499 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-28 10:12:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:25,500 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-28 10:12:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-04-28 10:12:25,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:25,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:25,500 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-28 10:12:25,500 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-28 10:12:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:25,501 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-28 10:12:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-04-28 10:12:25,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:25,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:25,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:25,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:25,501 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-28 10:12:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:12:25,501 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-28 10:12:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:25,502 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:12:25,502 INFO L496 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-28 10:12:25,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:12:27,163 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-28 10:12:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:12:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:12:27,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:27,164 INFO L195 NwaCegarLoop]: trace histogram [15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:27,183 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-28 10:12:27,364 WARN L477 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-28 10:12:27,364 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:27,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:27,365 INFO L85 PathProgramCache]: Analyzing trace with hash 446858486, now seen corresponding path program 209 times [2022-04-28 10:12:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:27,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1173211849] [2022-04-28 10:12:27,367 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:27,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash 446858486, now seen corresponding path program 210 times [2022-04-28 10:12:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:27,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941169775] [2022-04-28 10:12:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,782 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-28 10:12:27,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {70983#true} assume true; {70983#true} is VALID [2022-04-28 10:12:27,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70983#true} {70983#true} #50#return; {70983#true} is VALID [2022-04-28 10:12:27,783 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-28 10:12:27,783 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-28 10:12:27,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {70983#true} assume true; {70983#true} is VALID [2022-04-28 10:12:27,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70983#true} {70983#true} #50#return; {70983#true} is VALID [2022-04-28 10:12:27,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {70983#true} call #t~ret9 := main(); {70983#true} is VALID [2022-04-28 10:12:27,783 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-28 10:12:27,784 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-28 10:12:27,785 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-28 10:12:27,785 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-28 10:12:27,786 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-28 10:12:27,786 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-28 10:12:27,787 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-28 10:12:27,787 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-28 10:12:27,788 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-28 10:12:27,788 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-28 10:12:27,789 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-28 10:12:27,790 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-28 10:12:27,790 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-28 10:12:27,791 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-28 10:12:27,791 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-28 10:12:27,792 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-28 10:12:27,792 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-28 10:12:27,792 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-28 10:12:27,793 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-28 10:12:27,793 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-28 10:12:27,794 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-28 10:12:27,795 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-28 10:12:27,795 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-28 10:12:27,796 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-28 10:12:27,796 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-28 10:12:27,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {70984#false} ~cond := #in~cond; {70984#false} is VALID [2022-04-28 10:12:27,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {70984#false} assume 0 == ~cond; {70984#false} is VALID [2022-04-28 10:12:27,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {70984#false} assume !false; {70984#false} is VALID [2022-04-28 10:12:27,796 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-28 10:12:27,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:27,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941169775] [2022-04-28 10:12:27,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941169775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:27,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512707737] [2022-04-28 10:12:27,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:27,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:27,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:27,797 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-28 10:12:27,798 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-28 10:12:28,061 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:12:28,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:28,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:12:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:28,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:28,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {70983#true} call ULTIMATE.init(); {70983#true} is VALID [2022-04-28 10:12:28,402 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-28 10:12:28,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {70983#true} assume true; {70983#true} is VALID [2022-04-28 10:12:28,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70983#true} {70983#true} #50#return; {70983#true} is VALID [2022-04-28 10:12:28,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {70983#true} call #t~ret9 := main(); {70983#true} is VALID [2022-04-28 10:12:28,402 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-28 10:12:28,403 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-28 10:12:28,404 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-28 10:12:28,404 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-28 10:12:28,405 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-28 10:12:28,405 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-28 10:12:28,406 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-28 10:12:28,406 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-28 10:12:28,407 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-28 10:12:28,407 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-28 10:12:28,408 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-28 10:12:28,408 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-28 10:12:28,409 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-28 10:12:28,409 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-28 10:12:28,410 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-28 10:12:28,411 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-28 10:12:28,411 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-28 10:12:28,411 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-28 10:12:28,412 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-28 10:12:28,412 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-28 10:12:28,413 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-28 10:12:28,413 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-28 10:12:28,414 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-28 10:12:28,414 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-28 10:12:28,415 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-28 10:12:28,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {70984#false} ~cond := #in~cond; {70984#false} is VALID [2022-04-28 10:12:28,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {70984#false} assume 0 == ~cond; {70984#false} is VALID [2022-04-28 10:12:28,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {70984#false} assume !false; {70984#false} is VALID [2022-04-28 10:12:28,415 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-28 10:12:28,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:29,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {70984#false} assume !false; {70984#false} is VALID [2022-04-28 10:12:29,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {70984#false} assume 0 == ~cond; {70984#false} is VALID [2022-04-28 10:12:29,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {70984#false} ~cond := #in~cond; {70984#false} is VALID [2022-04-28 10:12:29,293 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-28 10:12:29,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {71123#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70984#false} is VALID [2022-04-28 10:12:29,294 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-28 10:12:29,295 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-28 10:12:29,296 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-28 10:12:29,297 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-28 10:12:29,297 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-28 10:12:29,298 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-28 10:12:29,298 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-28 10:12:29,299 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-28 10:12:29,299 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-28 10:12:29,300 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-28 10:12:29,301 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-28 10:12:29,302 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-28 10:12:29,302 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-28 10:12:29,303 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-28 10:12:29,304 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-28 10:12:29,304 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-28 10:12:29,305 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-28 10:12:29,306 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-28 10:12:29,306 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-28 10:12:29,307 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-28 10:12:29,308 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-28 10:12:29,308 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-28 10:12:29,309 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-28 10:12:29,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {70983#true} call #t~ret9 := main(); {70983#true} is VALID [2022-04-28 10:12:29,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70983#true} {70983#true} #50#return; {70983#true} is VALID [2022-04-28 10:12:29,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {70983#true} assume true; {70983#true} is VALID [2022-04-28 10:12:29,309 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-28 10:12:29,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {70983#true} call ULTIMATE.init(); {70983#true} is VALID [2022-04-28 10:12:29,309 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-28 10:12:29,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512707737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:29,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:29,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:12:29,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:29,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1173211849] [2022-04-28 10:12:29,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1173211849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:29,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:29,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:12:29,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610997021] [2022-04-28 10:12:29,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:29,310 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-28 10:12:29,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:29,310 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-28 10:12:29,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:29,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:12:29,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:29,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:12:29,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:12:29,333 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-28 10:12:36,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:36,001 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-04-28 10:12:36,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 10:12:36,001 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-28 10:12:36,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:36,002 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-28 10:12:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 87 transitions. [2022-04-28 10:12:36,002 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-28 10:12:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 87 transitions. [2022-04-28 10:12:36,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 87 transitions. [2022-04-28 10:12:36,078 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-28 10:12:36,079 INFO L225 Difference]: With dead ends: 116 [2022-04-28 10:12:36,079 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 10:12:36,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1323, Invalid=5817, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 10:12:36,079 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 47 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:36,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 141 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:12:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 10:12:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 55. [2022-04-28 10:12:36,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:36,890 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-28 10:12:36,890 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-28 10:12:36,890 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-28 10:12:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:36,891 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2022-04-28 10:12:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2022-04-28 10:12:36,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:36,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:36,891 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-28 10:12:36,891 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-28 10:12:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:36,892 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2022-04-28 10:12:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2022-04-28 10:12:36,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:36,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:36,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:36,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:36,893 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-28 10:12:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:12:36,893 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-28 10:12:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:36,893 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:12:36,893 INFO L496 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-28 10:12:36,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:12:38,603 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-28 10:12:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:12:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:12:38,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:38,604 INFO L195 NwaCegarLoop]: trace histogram [16, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:38,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:38,807 WARN L477 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-28 10:12:38,807 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 370451735, now seen corresponding path program 211 times [2022-04-28 10:12:38,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:38,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [623183063] [2022-04-28 10:12:38,810 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:38,810 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash 370451735, now seen corresponding path program 212 times [2022-04-28 10:12:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:38,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919239625] [2022-04-28 10:12:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:38,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:39,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:39,210 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-28 10:12:39,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {71869#true} assume true; {71869#true} is VALID [2022-04-28 10:12:39,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71869#true} {71869#true} #50#return; {71869#true} is VALID [2022-04-28 10:12:39,210 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-28 10:12:39,210 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-28 10:12:39,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {71869#true} assume true; {71869#true} is VALID [2022-04-28 10:12:39,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71869#true} {71869#true} #50#return; {71869#true} is VALID [2022-04-28 10:12:39,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {71869#true} call #t~ret9 := main(); {71869#true} is VALID [2022-04-28 10:12:39,211 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-28 10:12:39,211 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-28 10:12:39,212 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-28 10:12:39,212 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-28 10:12:39,213 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-28 10:12:39,213 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-28 10:12:39,214 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-28 10:12:39,214 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-28 10:12:39,215 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-28 10:12:39,215 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-28 10:12:39,216 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-28 10:12:39,216 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-28 10:12:39,217 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-28 10:12:39,218 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-28 10:12:39,218 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-28 10:12:39,219 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-28 10:12:39,219 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-28 10:12:39,220 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-28 10:12:39,220 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-28 10:12:39,220 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-28 10:12:39,221 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-28 10:12:39,221 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-28 10:12:39,222 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-28 10:12:39,222 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-28 10:12:39,223 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-28 10:12:39,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {71870#false} ~cond := #in~cond; {71870#false} is VALID [2022-04-28 10:12:39,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {71870#false} assume 0 == ~cond; {71870#false} is VALID [2022-04-28 10:12:39,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {71870#false} assume !false; {71870#false} is VALID [2022-04-28 10:12:39,223 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-28 10:12:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:39,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919239625] [2022-04-28 10:12:39,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919239625] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:39,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882712973] [2022-04-28 10:12:39,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:39,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:39,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:39,224 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-28 10:12:39,225 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-28 10:12:39,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:39,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:39,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:12:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:39,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:39,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {71869#true} call ULTIMATE.init(); {71869#true} is VALID [2022-04-28 10:12:39,613 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-28 10:12:39,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {71869#true} assume true; {71869#true} is VALID [2022-04-28 10:12:39,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71869#true} {71869#true} #50#return; {71869#true} is VALID [2022-04-28 10:12:39,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {71869#true} call #t~ret9 := main(); {71869#true} is VALID [2022-04-28 10:12:39,613 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-28 10:12:39,614 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-28 10:12:39,615 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-28 10:12:39,615 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-28 10:12:39,616 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-28 10:12:39,616 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-28 10:12:39,617 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-28 10:12:39,617 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-28 10:12:39,618 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-28 10:12:39,618 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-28 10:12:39,619 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-28 10:12:39,619 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-28 10:12:39,620 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-28 10:12:39,620 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-28 10:12:39,621 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-28 10:12:39,622 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-28 10:12:39,622 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-28 10:12:39,622 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-28 10:12:39,623 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-28 10:12:39,623 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-28 10:12:39,624 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-28 10:12:39,624 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-28 10:12:39,625 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-28 10:12:39,626 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-28 10:12:39,626 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-28 10:12:39,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {71870#false} ~cond := #in~cond; {71870#false} is VALID [2022-04-28 10:12:39,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {71870#false} assume 0 == ~cond; {71870#false} is VALID [2022-04-28 10:12:39,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {71870#false} assume !false; {71870#false} is VALID [2022-04-28 10:12:39,626 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-28 10:12:39,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:40,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {71870#false} assume !false; {71870#false} is VALID [2022-04-28 10:12:40,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {71870#false} assume 0 == ~cond; {71870#false} is VALID [2022-04-28 10:12:40,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {71870#false} ~cond := #in~cond; {71870#false} is VALID [2022-04-28 10:12:40,504 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-28 10:12:40,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {72009#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {71870#false} is VALID [2022-04-28 10:12:40,505 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-28 10:12:40,506 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-28 10:12:40,507 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-28 10:12:40,507 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-28 10:12:40,508 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-28 10:12:40,508 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-28 10:12:40,509 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-28 10:12:40,509 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-28 10:12:40,510 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-28 10:12:40,511 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-28 10:12:40,511 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-28 10:12:40,512 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-28 10:12:40,513 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-28 10:12:40,513 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-28 10:12:40,514 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-28 10:12:40,515 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-28 10:12:40,515 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-28 10:12:40,516 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-28 10:12:40,517 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-28 10:12:40,517 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-28 10:12:40,518 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-28 10:12:40,519 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-28 10:12:40,519 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-28 10:12:40,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {71869#true} call #t~ret9 := main(); {71869#true} is VALID [2022-04-28 10:12:40,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71869#true} {71869#true} #50#return; {71869#true} is VALID [2022-04-28 10:12:40,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {71869#true} assume true; {71869#true} is VALID [2022-04-28 10:12:40,519 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-28 10:12:40,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {71869#true} call ULTIMATE.init(); {71869#true} is VALID [2022-04-28 10:12:40,520 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-28 10:12:40,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882712973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:40,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:40,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:12:40,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:40,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [623183063] [2022-04-28 10:12:40,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [623183063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:40,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:40,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:12:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984516085] [2022-04-28 10:12:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:40,520 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-28 10:12:40,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:40,520 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-28 10:12:40,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:40,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:12:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:12:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1844, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:12:40,544 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-28 10:12:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:47,084 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2022-04-28 10:12:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 10:12:47,085 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-28 10:12:47,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:47,085 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-28 10:12:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2022-04-28 10:12:47,086 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-28 10:12:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2022-04-28 10:12:47,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 87 transitions. [2022-04-28 10:12:47,170 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-28 10:12:47,171 INFO L225 Difference]: With dead ends: 122 [2022-04-28 10:12:47,171 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 10:12:47,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1204, Invalid=5116, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 10:12:47,172 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 55 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:47,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 126 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:12:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 10:12:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 55. [2022-04-28 10:12:47,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:47,978 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-28 10:12:47,978 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-28 10:12:47,978 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-28 10:12:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:47,979 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2022-04-28 10:12:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2022-04-28 10:12:47,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:47,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:47,980 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-28 10:12:47,980 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-28 10:12:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:47,981 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2022-04-28 10:12:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2022-04-28 10:12:47,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:47,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:47,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:47,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:47,981 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-28 10:12:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:12:47,982 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-28 10:12:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:47,982 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:12:47,982 INFO L496 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-28 10:12:47,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:12:49,680 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-28 10:12:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:12:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:12:49,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:49,680 INFO L195 NwaCegarLoop]: trace histogram [17, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:49,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2022-04-28 10:12:49,881 WARN L477 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-28 10:12:49,882 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1337818326, now seen corresponding path program 213 times [2022-04-28 10:12:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:49,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [117906630] [2022-04-28 10:12:49,884 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:49,885 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1337818326, now seen corresponding path program 214 times [2022-04-28 10:12:49,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:49,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267786572] [2022-04-28 10:12:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:50,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:50,320 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-28 10:12:50,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {72769#true} assume true; {72769#true} is VALID [2022-04-28 10:12:50,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72769#true} {72769#true} #50#return; {72769#true} is VALID [2022-04-28 10:12:50,337 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-28 10:12:50,337 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-28 10:12:50,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {72769#true} assume true; {72769#true} is VALID [2022-04-28 10:12:50,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72769#true} {72769#true} #50#return; {72769#true} is VALID [2022-04-28 10:12:50,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {72769#true} call #t~ret9 := main(); {72769#true} is VALID [2022-04-28 10:12:50,337 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-28 10:12:50,338 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-28 10:12:50,339 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-28 10:12:50,339 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-28 10:12:50,340 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-28 10:12:50,341 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-28 10:12:50,342 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-28 10:12:50,342 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-28 10:12:50,343 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-28 10:12:50,344 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-28 10:12:50,344 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-28 10:12:50,345 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-28 10:12:50,346 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-28 10:12:50,346 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-28 10:12:50,347 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-28 10:12:50,348 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-28 10:12:50,349 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-28 10:12:50,349 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-28 10:12:50,350 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-28 10:12:50,350 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-28 10:12:50,351 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-28 10:12:50,352 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-28 10:12:50,352 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-28 10:12:50,353 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-28 10:12:50,353 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-28 10:12:50,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {72770#false} ~cond := #in~cond; {72770#false} is VALID [2022-04-28 10:12:50,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {72770#false} assume 0 == ~cond; {72770#false} is VALID [2022-04-28 10:12:50,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {72770#false} assume !false; {72770#false} is VALID [2022-04-28 10:12:50,353 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-28 10:12:50,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:50,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267786572] [2022-04-28 10:12:50,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267786572] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:50,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286075994] [2022-04-28 10:12:50,354 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:50,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:50,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:50,355 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-28 10:12:50,360 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-28 10:12:50,409 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:50,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:50,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:12:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:50,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:50,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {72769#true} call ULTIMATE.init(); {72769#true} is VALID [2022-04-28 10:12:50,753 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-28 10:12:50,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {72769#true} assume true; {72769#true} is VALID [2022-04-28 10:12:50,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72769#true} {72769#true} #50#return; {72769#true} is VALID [2022-04-28 10:12:50,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {72769#true} call #t~ret9 := main(); {72769#true} is VALID [2022-04-28 10:12:50,753 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-28 10:12:50,754 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-28 10:12:50,754 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-28 10:12:50,755 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-28 10:12:50,755 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-28 10:12:50,756 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-28 10:12:50,757 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-28 10:12:50,757 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-28 10:12:50,758 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-28 10:12:50,758 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-28 10:12:50,759 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-28 10:12:50,759 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-28 10:12:50,760 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-28 10:12:50,760 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-28 10:12:50,761 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-28 10:12:50,761 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-28 10:12:50,762 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-28 10:12:50,763 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-28 10:12:50,763 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-28 10:12:50,763 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-28 10:12:50,764 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-28 10:12:50,764 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-28 10:12:50,765 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-28 10:12:50,765 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-28 10:12:50,765 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-28 10:12:50,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {72770#false} ~cond := #in~cond; {72770#false} is VALID [2022-04-28 10:12:50,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {72770#false} assume 0 == ~cond; {72770#false} is VALID [2022-04-28 10:12:50,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {72770#false} assume !false; {72770#false} is VALID [2022-04-28 10:12:50,766 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-28 10:12:50,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:51,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {72770#false} assume !false; {72770#false} is VALID [2022-04-28 10:12:51,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {72770#false} assume 0 == ~cond; {72770#false} is VALID [2022-04-28 10:12:51,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {72770#false} ~cond := #in~cond; {72770#false} is VALID [2022-04-28 10:12:51,654 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-28 10:12:51,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {72909#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {72770#false} is VALID [2022-04-28 10:12:51,655 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-28 10:12:51,655 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-28 10:12:51,656 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-28 10:12:51,657 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-28 10:12:51,657 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-28 10:12:51,657 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-28 10:12:51,658 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-28 10:12:51,659 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-28 10:12:51,660 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-28 10:12:51,660 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-28 10:12:51,661 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-28 10:12:51,662 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-28 10:12:51,662 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-28 10:12:51,663 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-28 10:12:51,664 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-28 10:12:51,664 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-28 10:12:51,665 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-28 10:12:51,666 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-28 10:12:51,666 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-28 10:12:51,667 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-28 10:12:51,668 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-28 10:12:51,669 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-28 10:12:51,669 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-28 10:12:51,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {72769#true} call #t~ret9 := main(); {72769#true} is VALID [2022-04-28 10:12:51,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72769#true} {72769#true} #50#return; {72769#true} is VALID [2022-04-28 10:12:51,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {72769#true} assume true; {72769#true} is VALID [2022-04-28 10:12:51,669 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-28 10:12:51,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {72769#true} call ULTIMATE.init(); {72769#true} is VALID [2022-04-28 10:12:51,669 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-28 10:12:51,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286075994] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:51,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:51,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:12:51,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:51,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [117906630] [2022-04-28 10:12:51,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [117906630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:51,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:51,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:12:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453637101] [2022-04-28 10:12:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:51,671 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-28 10:12:51,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:51,671 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-28 10:12:51,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:51,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:12:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:51,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:12:51,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1819, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:12:51,696 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-28 10:12:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:58,917 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2022-04-28 10:12:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:12:58,917 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-28 10:12:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:58,918 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-28 10:12:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 88 transitions. [2022-04-28 10:12:58,918 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-28 10:12:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 88 transitions. [2022-04-28 10:12:58,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 88 transitions. [2022-04-28 10:12:58,995 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-28 10:12:58,996 INFO L225 Difference]: With dead ends: 127 [2022-04-28 10:12:58,996 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 10:12:58,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1121, Invalid=4579, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:12:58,997 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:58,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 151 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 10:12:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 10:12:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 55. [2022-04-28 10:12:59,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:59,795 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-28 10:12:59,795 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-28 10:12:59,796 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-28 10:12:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:59,797 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-04-28 10:12:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-04-28 10:12:59,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:59,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:59,797 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-28 10:12:59,797 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-28 10:12:59,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:59,798 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-04-28 10:12:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-04-28 10:12:59,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:59,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:59,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:59,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:59,799 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-28 10:12:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:12:59,800 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-28 10:12:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:59,800 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:12:59,800 INFO L496 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-28 10:12:59,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:13:01,501 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-28 10:13:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:13:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:13:01,502 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:01,502 INFO L195 NwaCegarLoop]: trace histogram [18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:01,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2022-04-28 10:13:01,702 WARN L477 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-28 10:13:01,702 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:01,703 INFO L85 PathProgramCache]: Analyzing trace with hash 399192375, now seen corresponding path program 215 times [2022-04-28 10:13:01,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:01,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [110762870] [2022-04-28 10:13:01,708 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:01,708 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:01,709 INFO L85 PathProgramCache]: Analyzing trace with hash 399192375, now seen corresponding path program 216 times [2022-04-28 10:13:01,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:01,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690243627] [2022-04-28 10:13:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:01,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:02,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:02,143 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-28 10:13:02,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {73681#true} assume true; {73681#true} is VALID [2022-04-28 10:13:02,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73681#true} {73681#true} #50#return; {73681#true} is VALID [2022-04-28 10:13:02,144 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-28 10:13:02,144 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-28 10:13:02,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {73681#true} assume true; {73681#true} is VALID [2022-04-28 10:13:02,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73681#true} {73681#true} #50#return; {73681#true} is VALID [2022-04-28 10:13:02,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {73681#true} call #t~ret9 := main(); {73681#true} is VALID [2022-04-28 10:13:02,144 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-28 10:13:02,145 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-28 10:13:02,145 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-28 10:13:02,146 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-28 10:13:02,146 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-28 10:13:02,147 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-28 10:13:02,148 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-28 10:13:02,148 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-28 10:13:02,149 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-28 10:13:02,149 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-28 10:13:02,150 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-28 10:13:02,150 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-28 10:13:02,151 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-28 10:13:02,151 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-28 10:13:02,152 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-28 10:13:02,152 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-28 10:13:02,153 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-28 10:13:02,153 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-28 10:13:02,154 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-28 10:13:02,154 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-28 10:13:02,155 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-28 10:13:02,155 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-28 10:13:02,156 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-28 10:13:02,156 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-28 10:13:02,156 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-28 10:13:02,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {73682#false} ~cond := #in~cond; {73682#false} is VALID [2022-04-28 10:13:02,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {73682#false} assume 0 == ~cond; {73682#false} is VALID [2022-04-28 10:13:02,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {73682#false} assume !false; {73682#false} is VALID [2022-04-28 10:13:02,157 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-28 10:13:02,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:02,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690243627] [2022-04-28 10:13:02,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690243627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:02,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740153453] [2022-04-28 10:13:02,157 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:02,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:02,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:02,160 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-28 10:13:02,164 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-28 10:13:02,347 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:13:02,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:02,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:13:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:02,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:02,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {73681#true} call ULTIMATE.init(); {73681#true} is VALID [2022-04-28 10:13:02,689 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-28 10:13:02,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {73681#true} assume true; {73681#true} is VALID [2022-04-28 10:13:02,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73681#true} {73681#true} #50#return; {73681#true} is VALID [2022-04-28 10:13:02,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {73681#true} call #t~ret9 := main(); {73681#true} is VALID [2022-04-28 10:13:02,690 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-28 10:13:02,690 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-28 10:13:02,691 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-28 10:13:02,691 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-28 10:13:02,692 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-28 10:13:02,692 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-28 10:13:02,693 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-28 10:13:02,693 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-28 10:13:02,694 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-28 10:13:02,694 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-28 10:13:02,695 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-28 10:13:02,696 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-28 10:13:02,696 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-28 10:13:02,697 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-28 10:13:02,697 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-28 10:13:02,698 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-28 10:13:02,698 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-28 10:13:02,699 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-28 10:13:02,699 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-28 10:13:02,700 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-28 10:13:02,700 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-28 10:13:02,701 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-28 10:13:02,701 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-28 10:13:02,702 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-28 10:13:02,702 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-28 10:13:02,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {73682#false} ~cond := #in~cond; {73682#false} is VALID [2022-04-28 10:13:02,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {73682#false} assume 0 == ~cond; {73682#false} is VALID [2022-04-28 10:13:02,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {73682#false} assume !false; {73682#false} is VALID [2022-04-28 10:13:02,702 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-28 10:13:02,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:03,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {73682#false} assume !false; {73682#false} is VALID [2022-04-28 10:13:03,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {73682#false} assume 0 == ~cond; {73682#false} is VALID [2022-04-28 10:13:03,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {73682#false} ~cond := #in~cond; {73682#false} is VALID [2022-04-28 10:13:03,591 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-28 10:13:03,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {73821#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {73682#false} is VALID [2022-04-28 10:13:03,592 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-28 10:13:03,593 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-28 10:13:03,593 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-28 10:13:03,594 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-28 10:13:03,594 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-28 10:13:03,595 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-28 10:13:03,596 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-28 10:13:03,596 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-28 10:13:03,597 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-28 10:13:03,598 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-28 10:13:03,599 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-28 10:13:03,599 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-28 10:13:03,600 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-28 10:13:03,601 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-28 10:13:03,601 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-28 10:13:03,602 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-28 10:13:03,603 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-28 10:13:03,603 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-28 10:13:03,604 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-28 10:13:03,605 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-28 10:13:03,605 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-28 10:13:03,606 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-28 10:13:03,606 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-28 10:13:03,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {73681#true} call #t~ret9 := main(); {73681#true} is VALID [2022-04-28 10:13:03,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73681#true} {73681#true} #50#return; {73681#true} is VALID [2022-04-28 10:13:03,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {73681#true} assume true; {73681#true} is VALID [2022-04-28 10:13:03,607 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-28 10:13:03,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {73681#true} call ULTIMATE.init(); {73681#true} is VALID [2022-04-28 10:13:03,607 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-28 10:13:03,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740153453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:03,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:03,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:13:03,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:03,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [110762870] [2022-04-28 10:13:03,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [110762870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:03,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:03,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:13:03,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081616656] [2022-04-28 10:13:03,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:03,608 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-28 10:13:03,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:03,608 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-28 10:13:03,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:03,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:13:03,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:03,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:13:03,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1790, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:13:03,631 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-28 10:13:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:10,844 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2022-04-28 10:13:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:13:10,844 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-28 10:13:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:10,844 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-28 10:13:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 90 transitions. [2022-04-28 10:13:10,845 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-28 10:13:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 90 transitions. [2022-04-28 10:13:10,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 90 transitions. [2022-04-28 10:13:10,937 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-28 10:13:10,938 INFO L225 Difference]: With dead ends: 131 [2022-04-28 10:13:10,938 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 10:13:10,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1074, Invalid=4182, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:13:10,939 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 70 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:10,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 151 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 10:13:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 10:13:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 55. [2022-04-28 10:13:11,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:11,725 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-28 10:13:11,725 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-28 10:13:11,725 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-28 10:13:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:11,726 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2022-04-28 10:13:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2022-04-28 10:13:11,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:11,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:11,727 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-28 10:13:11,727 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-28 10:13:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:11,728 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2022-04-28 10:13:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2022-04-28 10:13:11,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:11,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:11,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:11,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:11,728 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-28 10:13:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:13:11,729 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-28 10:13:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:11,729 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:13:11,729 INFO L496 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-28 10:13:11,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:13:13,458 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-28 10:13:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:13:13,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:13:13,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:13,459 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:13,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2022-04-28 10:13:13,659 WARN L477 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-28 10:13:13,660 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash -185275210, now seen corresponding path program 217 times [2022-04-28 10:13:13,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:13,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812520063] [2022-04-28 10:13:13,664 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:13,664 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -185275210, now seen corresponding path program 218 times [2022-04-28 10:13:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:13,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331802598] [2022-04-28 10:13:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:14,083 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-28 10:13:14,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {74603#true} assume true; {74603#true} is VALID [2022-04-28 10:13:14,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74603#true} {74603#true} #50#return; {74603#true} is VALID [2022-04-28 10:13:14,083 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-28 10:13:14,083 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-28 10:13:14,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {74603#true} assume true; {74603#true} is VALID [2022-04-28 10:13:14,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74603#true} {74603#true} #50#return; {74603#true} is VALID [2022-04-28 10:13:14,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {74603#true} call #t~ret9 := main(); {74603#true} is VALID [2022-04-28 10:13:14,084 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-28 10:13:14,084 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-28 10:13:14,085 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-28 10:13:14,085 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-28 10:13:14,086 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-28 10:13:14,086 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-28 10:13:14,087 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-28 10:13:14,088 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-28 10:13:14,088 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-28 10:13:14,089 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-28 10:13:14,089 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-28 10:13:14,090 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-28 10:13:14,090 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-28 10:13:14,091 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-28 10:13:14,091 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-28 10:13:14,092 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-28 10:13:14,092 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-28 10:13:14,093 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-28 10:13:14,093 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-28 10:13:14,094 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-28 10:13:14,094 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-28 10:13:14,095 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-28 10:13:14,095 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-28 10:13:14,096 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-28 10:13:14,096 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-28 10:13:14,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {74604#false} ~cond := #in~cond; {74604#false} is VALID [2022-04-28 10:13:14,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {74604#false} assume 0 == ~cond; {74604#false} is VALID [2022-04-28 10:13:14,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {74604#false} assume !false; {74604#false} is VALID [2022-04-28 10:13:14,096 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-28 10:13:14,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:14,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331802598] [2022-04-28 10:13:14,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331802598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:14,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405752019] [2022-04-28 10:13:14,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:14,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:14,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:14,098 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-28 10:13:14,099 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-28 10:13:14,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:14,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:14,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:13:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:14,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:14,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {74603#true} call ULTIMATE.init(); {74603#true} is VALID [2022-04-28 10:13:14,487 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-28 10:13:14,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {74603#true} assume true; {74603#true} is VALID [2022-04-28 10:13:14,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74603#true} {74603#true} #50#return; {74603#true} is VALID [2022-04-28 10:13:14,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {74603#true} call #t~ret9 := main(); {74603#true} is VALID [2022-04-28 10:13:14,487 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-28 10:13:14,488 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-28 10:13:14,488 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-28 10:13:14,489 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-28 10:13:14,490 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-28 10:13:14,490 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-28 10:13:14,491 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-28 10:13:14,491 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-28 10:13:14,492 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-28 10:13:14,492 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-28 10:13:14,493 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-28 10:13:14,493 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-28 10:13:14,494 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-28 10:13:14,494 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-28 10:13:14,495 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-28 10:13:14,496 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-28 10:13:14,496 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-28 10:13:14,497 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-28 10:13:14,497 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-28 10:13:14,498 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-28 10:13:14,498 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-28 10:13:14,498 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-28 10:13:14,499 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-28 10:13:14,503 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-28 10:13:14,503 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-28 10:13:14,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {74604#false} ~cond := #in~cond; {74604#false} is VALID [2022-04-28 10:13:14,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {74604#false} assume 0 == ~cond; {74604#false} is VALID [2022-04-28 10:13:14,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {74604#false} assume !false; {74604#false} is VALID [2022-04-28 10:13:14,504 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-28 10:13:14,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:15,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {74604#false} assume !false; {74604#false} is VALID [2022-04-28 10:13:15,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {74604#false} assume 0 == ~cond; {74604#false} is VALID [2022-04-28 10:13:15,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {74604#false} ~cond := #in~cond; {74604#false} is VALID [2022-04-28 10:13:15,406 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-28 10:13:15,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {74743#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {74604#false} is VALID [2022-04-28 10:13:15,407 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-28 10:13:15,407 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-28 10:13:15,408 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-28 10:13:15,409 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-28 10:13:15,409 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-28 10:13:15,410 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-28 10:13:15,411 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-28 10:13:15,411 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-28 10:13:15,412 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-28 10:13:15,413 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-28 10:13:15,414 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-28 10:13:15,414 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-28 10:13:15,415 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-28 10:13:15,416 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-28 10:13:15,416 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-28 10:13:15,417 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-28 10:13:15,418 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-28 10:13:15,419 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-28 10:13:15,419 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-28 10:13:15,420 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-28 10:13:15,421 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-28 10:13:15,421 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-28 10:13:15,422 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-28 10:13:15,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {74603#true} call #t~ret9 := main(); {74603#true} is VALID [2022-04-28 10:13:15,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74603#true} {74603#true} #50#return; {74603#true} is VALID [2022-04-28 10:13:15,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {74603#true} assume true; {74603#true} is VALID [2022-04-28 10:13:15,422 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-28 10:13:15,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {74603#true} call ULTIMATE.init(); {74603#true} is VALID [2022-04-28 10:13:15,422 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-28 10:13:15,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405752019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:15,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:15,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:13:15,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:15,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812520063] [2022-04-28 10:13:15,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812520063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:15,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:15,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:13:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746839279] [2022-04-28 10:13:15,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:15,423 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-28 10:13:15,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:15,423 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-28 10:13:15,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:15,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:13:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:15,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:13:15,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1757, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:13:15,446 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-28 10:13:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:22,921 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2022-04-28 10:13:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:13:22,921 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-28 10:13:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:22,921 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-28 10:13:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 93 transitions. [2022-04-28 10:13:22,922 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-28 10:13:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 93 transitions. [2022-04-28 10:13:22,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 93 transitions. [2022-04-28 10:13:23,001 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-28 10:13:23,002 INFO L225 Difference]: With dead ends: 134 [2022-04-28 10:13:23,002 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 10:13:23,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1063, Invalid=3907, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 10:13:23,002 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 77 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:23,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 161 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:13:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 10:13:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 55. [2022-04-28 10:13:23,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:23,796 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-28 10:13:23,796 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-28 10:13:23,796 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-28 10:13:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:23,797 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2022-04-28 10:13:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-04-28 10:13:23,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:23,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:23,797 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-28 10:13:23,797 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-28 10:13:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:23,798 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2022-04-28 10:13:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-04-28 10:13:23,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:23,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:23,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:23,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:23,799 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-28 10:13:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:13:23,799 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-28 10:13:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:23,799 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:13:23,799 INFO L496 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-28 10:13:23,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:13:25,734 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-28 10:13:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:13:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:13:25,735 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:25,735 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:25,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Ended with exit code 0 [2022-04-28 10:13:25,935 WARN L477 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-28 10:13:25,935 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:25,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2012628311, now seen corresponding path program 39 times [2022-04-28 10:13:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:25,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469849425] [2022-04-28 10:13:25,938 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:25,938 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:25,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2012628311, now seen corresponding path program 40 times [2022-04-28 10:13:25,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:25,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882803011] [2022-04-28 10:13:25,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:25,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:26,358 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-28 10:13:26,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {75533#true} assume true; {75533#true} is VALID [2022-04-28 10:13:26,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75533#true} {75533#true} #50#return; {75533#true} is VALID [2022-04-28 10:13:26,359 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-28 10:13:26,359 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-28 10:13:26,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {75533#true} assume true; {75533#true} is VALID [2022-04-28 10:13:26,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75533#true} {75533#true} #50#return; {75533#true} is VALID [2022-04-28 10:13:26,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {75533#true} call #t~ret9 := main(); {75533#true} is VALID [2022-04-28 10:13:26,359 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-28 10:13:26,360 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-28 10:13:26,360 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-28 10:13:26,361 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-28 10:13:26,361 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-28 10:13:26,362 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-28 10:13:26,363 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-28 10:13:26,363 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-28 10:13:26,364 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-28 10:13:26,364 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-28 10:13:26,365 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-28 10:13:26,365 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-28 10:13:26,366 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-28 10:13:26,366 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-28 10:13:26,367 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-28 10:13:26,367 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-28 10:13:26,368 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-28 10:13:26,369 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-28 10:13:26,369 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-28 10:13:26,370 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-28 10:13:26,370 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-28 10:13:26,371 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-28 10:13:26,371 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-28 10:13:26,372 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-28 10:13:26,372 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-28 10:13:26,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {75534#false} ~cond := #in~cond; {75534#false} is VALID [2022-04-28 10:13:26,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {75534#false} assume 0 == ~cond; {75534#false} is VALID [2022-04-28 10:13:26,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {75534#false} assume !false; {75534#false} is VALID [2022-04-28 10:13:26,372 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-28 10:13:26,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:26,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882803011] [2022-04-28 10:13:26,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882803011] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:26,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358138694] [2022-04-28 10:13:26,372 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:26,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:26,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:26,373 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-28 10:13:26,374 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-28 10:13:26,412 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:26,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:26,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:13:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:26,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:26,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {75533#true} call ULTIMATE.init(); {75533#true} is VALID [2022-04-28 10:13:26,772 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-28 10:13:26,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {75533#true} assume true; {75533#true} is VALID [2022-04-28 10:13:26,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75533#true} {75533#true} #50#return; {75533#true} is VALID [2022-04-28 10:13:26,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {75533#true} call #t~ret9 := main(); {75533#true} is VALID [2022-04-28 10:13:26,772 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-28 10:13:26,773 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-28 10:13:26,773 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-28 10:13:26,774 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-28 10:13:26,775 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-28 10:13:26,775 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-28 10:13:26,776 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-28 10:13:26,776 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-28 10:13:26,777 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-28 10:13:26,777 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-28 10:13:26,778 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-28 10:13:26,779 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-28 10:13:26,779 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-28 10:13:26,780 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-28 10:13:26,780 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-28 10:13:26,781 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-28 10:13:26,781 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-28 10:13:26,782 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-28 10:13:26,782 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-28 10:13:26,783 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-28 10:13:26,783 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-28 10:13:26,784 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-28 10:13:26,784 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-28 10:13:26,785 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-28 10:13:26,785 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-28 10:13:26,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {75534#false} ~cond := #in~cond; {75534#false} is VALID [2022-04-28 10:13:26,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {75534#false} assume 0 == ~cond; {75534#false} is VALID [2022-04-28 10:13:26,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {75534#false} assume !false; {75534#false} is VALID [2022-04-28 10:13:26,785 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-28 10:13:26,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:27,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {75534#false} assume !false; {75534#false} is VALID [2022-04-28 10:13:27,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {75534#false} assume 0 == ~cond; {75534#false} is VALID [2022-04-28 10:13:27,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {75534#false} ~cond := #in~cond; {75534#false} is VALID [2022-04-28 10:13:27,705 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-28 10:13:27,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {75673#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {75534#false} is VALID [2022-04-28 10:13:27,706 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-28 10:13:27,706 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-28 10:13:27,707 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-28 10:13:27,708 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-28 10:13:27,708 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-28 10:13:27,709 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-28 10:13:27,710 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-28 10:13:27,711 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-28 10:13:27,711 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-28 10:13:27,712 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-28 10:13:27,713 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-28 10:13:27,713 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-28 10:13:27,714 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-28 10:13:27,715 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-28 10:13:27,715 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-28 10:13:27,716 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-28 10:13:27,717 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-28 10:13:27,717 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-28 10:13:27,718 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-28 10:13:27,719 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-28 10:13:27,719 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-28 10:13:27,720 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-28 10:13:27,720 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-28 10:13:27,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {75533#true} call #t~ret9 := main(); {75533#true} is VALID [2022-04-28 10:13:27,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75533#true} {75533#true} #50#return; {75533#true} is VALID [2022-04-28 10:13:27,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {75533#true} assume true; {75533#true} is VALID [2022-04-28 10:13:27,721 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-28 10:13:27,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {75533#true} call ULTIMATE.init(); {75533#true} is VALID [2022-04-28 10:13:27,721 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-28 10:13:27,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358138694] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:27,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:27,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:13:27,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:27,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469849425] [2022-04-28 10:13:27,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469849425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:27,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:27,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:13:27,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34082452] [2022-04-28 10:13:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:27,722 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-28 10:13:27,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:27,722 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-28 10:13:27,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:27,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:13:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:27,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:13:27,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:13:27,743 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-28 10:13:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:35,518 INFO L93 Difference]: Finished difference Result 139 states and 162 transitions. [2022-04-28 10:13:35,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:13:35,519 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-28 10:13:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:35,519 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-28 10:13:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 97 transitions. [2022-04-28 10:13:35,520 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-28 10:13:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 97 transitions. [2022-04-28 10:13:35,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 97 transitions. [2022-04-28 10:13:35,616 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-28 10:13:35,617 INFO L225 Difference]: With dead ends: 139 [2022-04-28 10:13:35,617 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 10:13:35,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:13:35,617 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 96 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:35,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 164 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 10:13:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 10:13:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 57. [2022-04-28 10:13:36,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:36,473 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-28 10:13:36,474 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-28 10:13:36,474 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-28 10:13:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:36,475 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-28 10:13:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-28 10:13:36,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:36,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:36,475 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-28 10:13:36,475 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-28 10:13:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:36,476 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-28 10:13:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-28 10:13:36,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:36,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:36,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:36,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:36,476 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-28 10:13:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-04-28 10:13:36,477 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 33 [2022-04-28 10:13:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:36,477 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-04-28 10:13:36,477 INFO L496 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-28 10:13:36,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 69 transitions. [2022-04-28 10:13:38,224 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-28 10:13:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-28 10:13:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:13:38,224 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:38,224 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:38,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2022-04-28 10:13:38,424 WARN L477 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-28 10:13:38,425 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:38,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1325645685, now seen corresponding path program 219 times [2022-04-28 10:13:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:38,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679811914] [2022-04-28 10:13:38,427 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:38,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:38,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1325645685, now seen corresponding path program 220 times [2022-04-28 10:13:38,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:38,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427307322] [2022-04-28 10:13:38,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:38,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:38,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:38,840 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-28 10:13:38,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {76485#true} assume true; {76485#true} is VALID [2022-04-28 10:13:38,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76485#true} {76485#true} #50#return; {76485#true} is VALID [2022-04-28 10:13:38,841 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-28 10:13:38,841 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-28 10:13:38,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {76485#true} assume true; {76485#true} is VALID [2022-04-28 10:13:38,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76485#true} {76485#true} #50#return; {76485#true} is VALID [2022-04-28 10:13:38,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {76485#true} call #t~ret9 := main(); {76485#true} is VALID [2022-04-28 10:13:38,841 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-28 10:13:38,842 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-28 10:13:38,842 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-28 10:13:38,843 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-28 10:13:38,843 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-28 10:13:38,844 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-28 10:13:38,845 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-28 10:13:38,846 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-28 10:13:38,846 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-28 10:13:38,847 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-28 10:13:38,848 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-28 10:13:38,848 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-28 10:13:38,848 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-28 10:13:38,849 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-28 10:13:38,849 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-28 10:13:38,850 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-28 10:13:38,850 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-28 10:13:38,851 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-28 10:13:38,851 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-28 10:13:38,852 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-28 10:13:38,853 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-28 10:13:38,853 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-28 10:13:38,854 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-28 10:13:38,854 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-28 10:13:38,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {76486#false} assume !(~z~0 % 4294967296 > 0); {76486#false} is VALID [2022-04-28 10:13:38,854 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-28 10:13:38,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {76486#false} ~cond := #in~cond; {76486#false} is VALID [2022-04-28 10:13:38,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {76486#false} assume 0 == ~cond; {76486#false} is VALID [2022-04-28 10:13:38,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {76486#false} assume !false; {76486#false} is VALID [2022-04-28 10:13:38,855 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-28 10:13:38,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:38,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427307322] [2022-04-28 10:13:38,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427307322] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:38,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811063647] [2022-04-28 10:13:38,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:38,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:38,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:38,856 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-28 10:13:38,856 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-28 10:13:38,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:38,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:38,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:13:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:38,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:39,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {76485#true} call ULTIMATE.init(); {76485#true} is VALID [2022-04-28 10:13:39,309 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-28 10:13:39,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {76485#true} assume true; {76485#true} is VALID [2022-04-28 10:13:39,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76485#true} {76485#true} #50#return; {76485#true} is VALID [2022-04-28 10:13:39,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {76485#true} call #t~ret9 := main(); {76485#true} is VALID [2022-04-28 10:13:39,309 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-28 10:13:39,309 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-28 10:13:39,310 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-28 10:13:39,311 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-28 10:13:39,311 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-28 10:13:39,312 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-28 10:13:39,312 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-28 10:13:39,313 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-28 10:13:39,313 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-28 10:13:39,314 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-28 10:13:39,314 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-28 10:13:39,315 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-28 10:13:39,315 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-28 10:13:39,316 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-28 10:13:39,316 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-28 10:13:39,317 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-28 10:13:39,317 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-28 10:13:39,318 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-28 10:13:39,318 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-28 10:13:39,319 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-28 10:13:39,319 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-28 10:13:39,320 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-28 10:13:39,320 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-28 10:13:39,321 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-28 10:13:39,322 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-28 10:13:39,322 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-28 10:13:39,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {76486#false} ~cond := #in~cond; {76486#false} is VALID [2022-04-28 10:13:39,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {76486#false} assume 0 == ~cond; {76486#false} is VALID [2022-04-28 10:13:39,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {76486#false} assume !false; {76486#false} is VALID [2022-04-28 10:13:39,322 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-28 10:13:39,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:40,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {76486#false} assume !false; {76486#false} is VALID [2022-04-28 10:13:40,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {76486#false} assume 0 == ~cond; {76486#false} is VALID [2022-04-28 10:13:40,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {76486#false} ~cond := #in~cond; {76486#false} is VALID [2022-04-28 10:13:40,214 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-28 10:13:40,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {76628#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {76486#false} is VALID [2022-04-28 10:13:40,215 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-28 10:13:40,215 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-28 10:13:40,216 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-28 10:13:40,217 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-28 10:13:40,218 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-28 10:13:40,218 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-28 10:13:40,219 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-28 10:13:40,220 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-28 10:13:40,220 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-28 10:13:40,221 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-28 10:13:40,222 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-28 10:13:40,222 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-28 10:13:40,223 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-28 10:13:40,223 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-28 10:13:40,224 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-28 10:13:40,225 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-28 10:13:40,226 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-28 10:13:40,226 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-28 10:13:40,227 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-28 10:13:40,228 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-28 10:13:40,228 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-28 10:13:40,229 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-28 10:13:40,230 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-28 10:13:40,230 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-28 10:13:40,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {76485#true} call #t~ret9 := main(); {76485#true} is VALID [2022-04-28 10:13:40,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76485#true} {76485#true} #50#return; {76485#true} is VALID [2022-04-28 10:13:40,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {76485#true} assume true; {76485#true} is VALID [2022-04-28 10:13:40,230 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-28 10:13:40,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {76485#true} call ULTIMATE.init(); {76485#true} is VALID [2022-04-28 10:13:40,230 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-28 10:13:40,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811063647] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:40,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:40,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-04-28 10:13:40,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:40,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679811914] [2022-04-28 10:13:40,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679811914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:40,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:40,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:13:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620609609] [2022-04-28 10:13:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:40,231 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-28 10:13:40,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:40,231 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-28 10:13:40,257 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-28 10:13:40,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:13:40,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:40,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:13:40,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=2013, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:13:40,258 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-28 10:13:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:43,314 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-28 10:13:43,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:13:43,314 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-28 10:13:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:43,314 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-28 10:13:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. [2022-04-28 10:13:43,314 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-28 10:13:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. [2022-04-28 10:13:43,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 45 transitions. [2022-04-28 10:13:43,349 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-28 10:13:43,350 INFO L225 Difference]: With dead ends: 73 [2022-04-28 10:13:43,350 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 10:13:43,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=791, Invalid=4179, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 10:13:43,351 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:43,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:13:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 10:13:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 10:13:44,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:44,133 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-28 10:13:44,133 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-28 10:13:44,133 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-28 10:13:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:44,133 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-04-28 10:13:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:13:44,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:44,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:44,134 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-28 10:13:44,134 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-28 10:13:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:44,134 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-04-28 10:13:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:13:44,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:44,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:44,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:44,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:44,135 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-28 10:13:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 10:13:44,135 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 34 [2022-04-28 10:13:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:44,136 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 10:13:44,136 INFO L496 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-28 10:13:44,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 10:13:45,788 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-28 10:13:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 10:13:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:13:45,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:45,788 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:45,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Ended with exit code 0 [2022-04-28 10:13:45,989 WARN L477 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-28 10:13:45,989 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1745093612, now seen corresponding path program 221 times [2022-04-28 10:13:45,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:45,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825243960] [2022-04-28 10:13:46,002 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:46,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:46,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1745093612, now seen corresponding path program 222 times [2022-04-28 10:13:46,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:46,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341717814] [2022-04-28 10:13:46,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:46,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:46,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:46,434 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-28 10:13:46,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {77150#true} assume true; {77150#true} is VALID [2022-04-28 10:13:46,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77150#true} {77150#true} #50#return; {77150#true} is VALID [2022-04-28 10:13:46,434 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-28 10:13:46,434 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-28 10:13:46,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {77150#true} assume true; {77150#true} is VALID [2022-04-28 10:13:46,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77150#true} {77150#true} #50#return; {77150#true} is VALID [2022-04-28 10:13:46,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {77150#true} call #t~ret9 := main(); {77150#true} is VALID [2022-04-28 10:13:46,435 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-28 10:13:46,435 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-28 10:13:46,436 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-28 10:13:46,436 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-28 10:13:46,437 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-28 10:13:46,437 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-28 10:13:46,438 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-28 10:13:46,438 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-28 10:13:46,439 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-28 10:13:46,439 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-28 10:13:46,440 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-28 10:13:46,441 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-28 10:13:46,441 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-28 10:13:46,441 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-28 10:13:46,442 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-28 10:13:46,442 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-28 10:13:46,443 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-28 10:13:46,443 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-28 10:13:46,444 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-28 10:13:46,444 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-28 10:13:46,445 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-28 10:13:46,446 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-28 10:13:46,446 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-28 10:13:46,447 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-28 10:13:46,447 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-28 10:13:46,447 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-28 10:13:46,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {77151#false} ~cond := #in~cond; {77151#false} is VALID [2022-04-28 10:13:46,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {77151#false} assume 0 == ~cond; {77151#false} is VALID [2022-04-28 10:13:46,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {77151#false} assume !false; {77151#false} is VALID [2022-04-28 10:13:46,447 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-28 10:13:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:46,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341717814] [2022-04-28 10:13:46,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341717814] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:46,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856947260] [2022-04-28 10:13:46,448 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:46,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:46,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:46,449 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-28 10:13:46,449 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-28 10:13:46,590 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:13:46,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:46,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:13:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:46,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:46,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {77150#true} call ULTIMATE.init(); {77150#true} is VALID [2022-04-28 10:13:46,948 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-28 10:13:46,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {77150#true} assume true; {77150#true} is VALID [2022-04-28 10:13:46,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77150#true} {77150#true} #50#return; {77150#true} is VALID [2022-04-28 10:13:46,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {77150#true} call #t~ret9 := main(); {77150#true} is VALID [2022-04-28 10:13:46,949 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-28 10:13:46,949 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-28 10:13:46,950 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-28 10:13:46,950 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-28 10:13:46,951 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-28 10:13:46,951 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-28 10:13:46,952 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-28 10:13:46,952 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-28 10:13:46,953 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-28 10:13:46,954 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-28 10:13:46,954 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-28 10:13:46,955 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-28 10:13:46,955 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-28 10:13:46,955 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-28 10:13:46,956 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-28 10:13:46,956 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-28 10:13:46,957 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-28 10:13:46,958 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-28 10:13:46,958 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-28 10:13:46,959 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-28 10:13:46,959 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-28 10:13:46,960 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-28 10:13:46,960 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-28 10:13:46,961 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-28 10:13:46,961 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-28 10:13:46,961 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-28 10:13:46,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {77151#false} ~cond := #in~cond; {77151#false} is VALID [2022-04-28 10:13:46,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {77151#false} assume 0 == ~cond; {77151#false} is VALID [2022-04-28 10:13:46,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {77151#false} assume !false; {77151#false} is VALID [2022-04-28 10:13:46,962 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-28 10:13:46,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:47,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {77151#false} assume !false; {77151#false} is VALID [2022-04-28 10:13:47,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {77151#false} assume 0 == ~cond; {77151#false} is VALID [2022-04-28 10:13:47,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {77151#false} ~cond := #in~cond; {77151#false} is VALID [2022-04-28 10:13:47,855 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-28 10:13:47,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {77294#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {77151#false} is VALID [2022-04-28 10:13:47,856 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-28 10:13:47,857 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-28 10:13:47,858 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-28 10:13:47,859 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-28 10:13:47,859 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-28 10:13:47,860 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-28 10:13:47,861 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-28 10:13:47,862 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-28 10:13:47,862 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-28 10:13:47,863 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-28 10:13:47,863 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-28 10:13:47,864 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-28 10:13:47,864 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-28 10:13:47,865 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-28 10:13:47,866 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-28 10:13:47,866 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-28 10:13:47,867 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-28 10:13:47,868 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-28 10:13:47,869 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-28 10:13:47,869 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-28 10:13:47,870 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-28 10:13:47,871 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-28 10:13:47,871 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-28 10:13:47,872 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-28 10:13:47,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {77150#true} call #t~ret9 := main(); {77150#true} is VALID [2022-04-28 10:13:47,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77150#true} {77150#true} #50#return; {77150#true} is VALID [2022-04-28 10:13:47,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {77150#true} assume true; {77150#true} is VALID [2022-04-28 10:13:47,872 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-28 10:13:47,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {77150#true} call ULTIMATE.init(); {77150#true} is VALID [2022-04-28 10:13:47,872 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-28 10:13:47,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856947260] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:47,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:47,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:13:47,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:47,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825243960] [2022-04-28 10:13:47,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825243960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:47,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:47,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:13:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649130747] [2022-04-28 10:13:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:47,873 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-28 10:13:47,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:47,873 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-28 10:13:47,897 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-28 10:13:47,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:13:47,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:47,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:13:47,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2097, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:13:47,898 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-28 10:13:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:50,801 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-28 10:13:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:13:50,801 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-28 10:13:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:50,801 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-28 10:13:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. [2022-04-28 10:13:50,802 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-28 10:13:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. [2022-04-28 10:13:50,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 48 transitions. [2022-04-28 10:13:50,844 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-28 10:13:50,845 INFO L225 Difference]: With dead ends: 72 [2022-04-28 10:13:50,845 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 10:13:50,845 INFO L412 NwaCegarLoop]: 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-28 10:13:50,846 INFO L413 NwaCegarLoop]: 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-28 10:13:50,846 INFO L414 NwaCegarLoop]: 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-28 10:13:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 10:13:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-04-28 10:13:51,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:51,732 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-28 10:13:51,732 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-28 10:13:51,732 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-28 10:13:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:51,733 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 10:13:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 10:13:51,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:51,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:51,733 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-28 10:13:51,733 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-28 10:13:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:51,734 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 10:13:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 10:13:51,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:51,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:51,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:51,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:51,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-28 10:13:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 10:13:51,735 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-28 10:13:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:51,735 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 10:13:51,735 INFO L496 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-28 10:13:51,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 10:13:53,743 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-28 10:13:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 10:13:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:13:53,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:53,743 INFO L195 NwaCegarLoop]: trace histogram [12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:53,760 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-28 10:13:53,943 WARN L477 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-28 10:13:53,944 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1758080917, now seen corresponding path program 223 times [2022-04-28 10:13:53,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:53,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [648284578] [2022-04-28 10:13:53,946 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:53,946 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1758080917, now seen corresponding path program 224 times [2022-04-28 10:13:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:53,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210057525] [2022-04-28 10:13:53,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:54,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:54,412 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-28 10:13:54,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {77842#true} assume true; {77842#true} is VALID [2022-04-28 10:13:54,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77842#true} {77842#true} #50#return; {77842#true} is VALID [2022-04-28 10:13:54,413 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-28 10:13:54,413 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-28 10:13:54,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {77842#true} assume true; {77842#true} is VALID [2022-04-28 10:13:54,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77842#true} {77842#true} #50#return; {77842#true} is VALID [2022-04-28 10:13:54,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {77842#true} call #t~ret9 := main(); {77842#true} is VALID [2022-04-28 10:13:54,414 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-28 10:13:54,414 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-28 10:13:54,415 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-28 10:13:54,415 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-28 10:13:54,420 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-28 10:13:54,420 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-28 10:13:54,421 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-28 10:13:54,422 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-28 10:13:54,422 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-28 10:13:54,423 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-28 10:13:54,424 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-28 10:13:54,425 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-28 10:13:54,425 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-28 10:13:54,426 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-28 10:13:54,426 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-28 10:13:54,427 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-28 10:13:54,428 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-28 10:13:54,428 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-28 10:13:54,429 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-28 10:13:54,430 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-28 10:13:54,430 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-28 10:13:54,431 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-28 10:13:54,432 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-28 10:13:54,433 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-28 10:13:54,433 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-28 10:13:54,433 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-28 10:13:54,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {77843#false} ~cond := #in~cond; {77843#false} is VALID [2022-04-28 10:13:54,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {77843#false} assume 0 == ~cond; {77843#false} is VALID [2022-04-28 10:13:54,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {77843#false} assume !false; {77843#false} is VALID [2022-04-28 10:13:54,434 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-28 10:13:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:54,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210057525] [2022-04-28 10:13:54,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210057525] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:54,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16704282] [2022-04-28 10:13:54,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:54,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:54,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:54,436 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-28 10:13:54,458 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-28 10:13:54,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:54,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:54,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:13:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:54,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:54,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {77842#true} call ULTIMATE.init(); {77842#true} is VALID [2022-04-28 10:13:54,855 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-28 10:13:54,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {77842#true} assume true; {77842#true} is VALID [2022-04-28 10:13:54,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77842#true} {77842#true} #50#return; {77842#true} is VALID [2022-04-28 10:13:54,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {77842#true} call #t~ret9 := main(); {77842#true} is VALID [2022-04-28 10:13:54,856 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-28 10:13:54,856 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-28 10:13:54,857 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-28 10:13:54,857 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-28 10:13:54,858 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-28 10:13:54,858 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-28 10:13:54,859 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-28 10:13:54,859 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-28 10:13:54,860 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-28 10:13:54,860 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-28 10:13:54,861 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-28 10:13:54,862 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-28 10:13:54,862 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-28 10:13:54,863 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-28 10:13:54,863 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-28 10:13:54,863 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-28 10:13:54,864 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-28 10:13:54,865 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-28 10:13:54,865 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-28 10:13:54,866 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-28 10:13:54,866 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-28 10:13:54,867 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-28 10:13:54,867 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-28 10:13:54,868 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-28 10:13:54,868 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-28 10:13:54,868 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-28 10:13:54,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {77843#false} ~cond := #in~cond; {77843#false} is VALID [2022-04-28 10:13:54,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {77843#false} assume 0 == ~cond; {77843#false} is VALID [2022-04-28 10:13:54,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {77843#false} assume !false; {77843#false} is VALID [2022-04-28 10:13:54,869 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-28 10:13:54,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:55,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {77843#false} assume !false; {77843#false} is VALID [2022-04-28 10:13:55,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {77843#false} assume 0 == ~cond; {77843#false} is VALID [2022-04-28 10:13:55,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {77843#false} ~cond := #in~cond; {77843#false} is VALID [2022-04-28 10:13:55,803 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-28 10:13:55,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {77986#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {77843#false} is VALID [2022-04-28 10:13:55,805 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-28 10:13:55,806 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-28 10:13:55,807 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-28 10:13:55,807 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-28 10:13:55,809 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-28 10:13:55,809 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-28 10:13:55,810 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-28 10:13:55,811 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-28 10:13:55,811 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-28 10:13:55,812 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-28 10:13:55,812 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-28 10:13:55,813 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-28 10:13:55,814 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-28 10:13:55,814 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-28 10:13:55,815 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-28 10:13:55,816 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-28 10:13:55,816 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-28 10:13:55,817 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-28 10:13:55,818 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-28 10:13:55,818 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-28 10:13:55,819 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-28 10:13:55,820 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-28 10:13:55,820 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-28 10:13:55,821 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-28 10:13:55,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {77842#true} call #t~ret9 := main(); {77842#true} is VALID [2022-04-28 10:13:55,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77842#true} {77842#true} #50#return; {77842#true} is VALID [2022-04-28 10:13:55,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {77842#true} assume true; {77842#true} is VALID [2022-04-28 10:13:55,821 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-28 10:13:55,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {77842#true} call ULTIMATE.init(); {77842#true} is VALID [2022-04-28 10:13:55,821 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-28 10:13:55,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16704282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:55,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:55,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:13:55,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:55,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [648284578] [2022-04-28 10:13:55,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [648284578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:55,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:55,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:13:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929738973] [2022-04-28 10:13:55,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:55,822 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-28 10:13:55,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:55,822 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-28 10:13:55,846 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-28 10:13:55,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:13:55,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:55,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:13:55,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2088, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:13:55,847 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-28 10:14:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:00,377 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2022-04-28 10:14:00,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 10:14:00,377 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-28 10:14:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:00,377 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-28 10:14:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2022-04-28 10:14:00,377 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-28 10:14:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2022-04-28 10:14:00,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 62 transitions. [2022-04-28 10:14:00,427 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-28 10:14:00,427 INFO L225 Difference]: With dead ends: 83 [2022-04-28 10:14:00,427 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 10:14:00,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1132, Invalid=5510, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:14:00,428 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:00,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 124 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:14:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 10:14:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2022-04-28 10:14:01,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:01,291 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-28 10:14:01,291 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-28 10:14:01,292 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-28 10:14:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:01,292 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-04-28 10:14:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-04-28 10:14:01,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:01,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:01,292 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-28 10:14:01,293 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-28 10:14:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:01,293 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-04-28 10:14:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-04-28 10:14:01,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:01,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:01,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:01,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:01,293 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-28 10:14:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 10:14:01,294 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-28 10:14:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:01,294 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 10:14:01,294 INFO L496 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-28 10:14:01,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 10:14:03,275 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-28 10:14:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 10:14:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:14:03,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:03,276 INFO L195 NwaCegarLoop]: trace histogram [13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:03,292 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-28 10:14:03,476 WARN L477 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-28 10:14:03,476 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:03,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1315502092, now seen corresponding path program 225 times [2022-04-28 10:14:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:03,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888865033] [2022-04-28 10:14:03,478 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:03,478 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1315502092, now seen corresponding path program 226 times [2022-04-28 10:14:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:03,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802493484] [2022-04-28 10:14:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:03,928 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-28 10:14:03,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {78596#true} assume true; {78596#true} is VALID [2022-04-28 10:14:03,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78596#true} {78596#true} #50#return; {78596#true} is VALID [2022-04-28 10:14:03,929 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-28 10:14:03,929 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-28 10:14:03,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {78596#true} assume true; {78596#true} is VALID [2022-04-28 10:14:03,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78596#true} {78596#true} #50#return; {78596#true} is VALID [2022-04-28 10:14:03,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {78596#true} call #t~ret9 := main(); {78596#true} is VALID [2022-04-28 10:14:03,929 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-28 10:14:03,930 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-28 10:14:03,930 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-28 10:14:03,931 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-28 10:14:03,931 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-28 10:14:03,932 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-28 10:14:03,932 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-28 10:14:03,933 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-28 10:14:03,934 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-28 10:14:03,934 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-28 10:14:03,935 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-28 10:14:03,935 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-28 10:14:03,936 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-28 10:14:03,936 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-28 10:14:03,937 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-28 10:14:03,937 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-28 10:14:03,938 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-28 10:14:03,938 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-28 10:14:03,939 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-28 10:14:03,939 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-28 10:14:03,940 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-28 10:14:03,940 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-28 10:14:03,941 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-28 10:14:03,942 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-28 10:14:03,942 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-28 10:14:03,942 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-28 10:14:03,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {78597#false} ~cond := #in~cond; {78597#false} is VALID [2022-04-28 10:14:03,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {78597#false} assume 0 == ~cond; {78597#false} is VALID [2022-04-28 10:14:03,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {78597#false} assume !false; {78597#false} is VALID [2022-04-28 10:14:03,942 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-28 10:14:03,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:03,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802493484] [2022-04-28 10:14:03,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802493484] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:03,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678459924] [2022-04-28 10:14:03,943 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:03,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:03,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:03,944 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-28 10:14:03,944 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-28 10:14:03,985 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:03,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:03,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:14:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:03,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:04,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {78596#true} call ULTIMATE.init(); {78596#true} is VALID [2022-04-28 10:14:04,349 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-28 10:14:04,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {78596#true} assume true; {78596#true} is VALID [2022-04-28 10:14:04,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78596#true} {78596#true} #50#return; {78596#true} is VALID [2022-04-28 10:14:04,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {78596#true} call #t~ret9 := main(); {78596#true} is VALID [2022-04-28 10:14:04,349 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-28 10:14:04,349 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-28 10:14:04,350 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-28 10:14:04,351 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-28 10:14:04,351 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-28 10:14:04,352 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-28 10:14:04,352 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-28 10:14:04,353 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-28 10:14:04,353 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-28 10:14:04,354 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-28 10:14:04,354 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-28 10:14:04,355 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-28 10:14:04,356 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-28 10:14:04,356 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-28 10:14:04,356 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-28 10:14:04,357 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-28 10:14:04,357 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-28 10:14:04,358 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-28 10:14:04,359 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-28 10:14:04,359 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-28 10:14:04,360 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-28 10:14:04,360 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-28 10:14:04,361 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-28 10:14:04,361 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-28 10:14:04,362 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-28 10:14:04,362 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-28 10:14:04,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {78597#false} ~cond := #in~cond; {78597#false} is VALID [2022-04-28 10:14:04,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {78597#false} assume 0 == ~cond; {78597#false} is VALID [2022-04-28 10:14:04,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {78597#false} assume !false; {78597#false} is VALID [2022-04-28 10:14:04,371 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-28 10:14:04,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:05,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {78597#false} assume !false; {78597#false} is VALID [2022-04-28 10:14:05,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {78597#false} assume 0 == ~cond; {78597#false} is VALID [2022-04-28 10:14:05,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {78597#false} ~cond := #in~cond; {78597#false} is VALID [2022-04-28 10:14:05,286 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-28 10:14:05,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {78740#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {78597#false} is VALID [2022-04-28 10:14:05,288 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-28 10:14:05,289 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-28 10:14:05,290 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-28 10:14:05,290 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-28 10:14:05,291 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-28 10:14:05,293 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-28 10:14:05,294 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-28 10:14:05,294 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-28 10:14:05,295 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-28 10:14:05,295 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-28 10:14:05,296 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-28 10:14:05,297 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-28 10:14:05,298 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-28 10:14:05,298 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-28 10:14:05,299 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-28 10:14:05,300 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-28 10:14:05,301 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-28 10:14:05,301 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-28 10:14:05,302 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-28 10:14:05,303 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-28 10:14:05,303 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-28 10:14:05,304 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-28 10:14:05,305 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-28 10:14:05,305 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-28 10:14:05,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {78596#true} call #t~ret9 := main(); {78596#true} is VALID [2022-04-28 10:14:05,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78596#true} {78596#true} #50#return; {78596#true} is VALID [2022-04-28 10:14:05,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {78596#true} assume true; {78596#true} is VALID [2022-04-28 10:14:05,305 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-28 10:14:05,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {78596#true} call ULTIMATE.init(); {78596#true} is VALID [2022-04-28 10:14:05,305 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-28 10:14:05,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678459924] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:05,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:05,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:14:05,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:05,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888865033] [2022-04-28 10:14:05,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888865033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:05,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:05,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:14:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322126629] [2022-04-28 10:14:05,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:05,306 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-28 10:14:05,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:05,306 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-28 10:14:05,331 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-28 10:14:05,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:14:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:05,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:14:05,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2075, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:14:05,332 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-28 10:14:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:10,747 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2022-04-28 10:14:10,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 10:14:10,747 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-28 10:14:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:10,747 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-28 10:14:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2022-04-28 10:14:10,748 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-28 10:14:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2022-04-28 10:14:10,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 73 transitions. [2022-04-28 10:14:10,807 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-28 10:14:10,808 INFO L225 Difference]: With dead ends: 93 [2022-04-28 10:14:10,808 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 10:14:10,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1335, Invalid=6321, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:14:10,808 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:10,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 107 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:14:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 10:14:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2022-04-28 10:14:11,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:11,676 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-28 10:14:11,676 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-28 10:14:11,676 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-28 10:14:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:11,677 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-04-28 10:14:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-04-28 10:14:11,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:11,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:11,677 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-28 10:14:11,677 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-28 10:14:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:11,678 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-04-28 10:14:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-04-28 10:14:11,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:11,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:11,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:11,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:11,678 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-28 10:14:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 10:14:11,678 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-28 10:14:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:11,679 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 10:14:11,679 INFO L496 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-28 10:14:11,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 10:14:13,657 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-28 10:14:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 10:14:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:14:13,657 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:13,657 INFO L195 NwaCegarLoop]: trace histogram [14, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:13,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:13,858 WARN L477 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-28 10:14:13,858 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:13,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1414649931, now seen corresponding path program 227 times [2022-04-28 10:14:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:13,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [151488965] [2022-04-28 10:14:13,860 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:13,860 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1414649931, now seen corresponding path program 228 times [2022-04-28 10:14:13,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:13,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832481491] [2022-04-28 10:14:13,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:13,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:14,308 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-28 10:14:14,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {79402#true} assume true; {79402#true} is VALID [2022-04-28 10:14:14,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79402#true} {79402#true} #50#return; {79402#true} is VALID [2022-04-28 10:14:14,309 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-28 10:14:14,309 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-28 10:14:14,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {79402#true} assume true; {79402#true} is VALID [2022-04-28 10:14:14,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79402#true} {79402#true} #50#return; {79402#true} is VALID [2022-04-28 10:14:14,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {79402#true} call #t~ret9 := main(); {79402#true} is VALID [2022-04-28 10:14:14,309 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-28 10:14:14,310 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-28 10:14:14,311 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-28 10:14:14,311 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-28 10:14:14,312 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-28 10:14:14,312 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-28 10:14:14,313 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-28 10:14:14,313 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-28 10:14:14,314 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-28 10:14:14,314 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-28 10:14:14,315 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-28 10:14:14,316 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-28 10:14:14,316 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-28 10:14:14,317 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-28 10:14:14,317 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-28 10:14:14,318 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-28 10:14:14,318 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-28 10:14:14,319 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-28 10:14:14,319 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-28 10:14:14,320 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-28 10:14:14,320 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-28 10:14:14,321 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-28 10:14:14,321 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-28 10:14:14,322 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-28 10:14:14,322 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-28 10:14:14,322 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-28 10:14:14,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {79403#false} ~cond := #in~cond; {79403#false} is VALID [2022-04-28 10:14:14,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {79403#false} assume 0 == ~cond; {79403#false} is VALID [2022-04-28 10:14:14,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {79403#false} assume !false; {79403#false} is VALID [2022-04-28 10:14:14,323 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-28 10:14:14,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:14,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832481491] [2022-04-28 10:14:14,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832481491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:14,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975523867] [2022-04-28 10:14:14,323 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:14,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:14,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:14,324 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-28 10:14:14,324 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-28 10:14:14,542 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:14:14,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:14,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:14:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:14,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:14,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {79402#true} call ULTIMATE.init(); {79402#true} is VALID [2022-04-28 10:14:14,894 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-28 10:14:14,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {79402#true} assume true; {79402#true} is VALID [2022-04-28 10:14:14,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79402#true} {79402#true} #50#return; {79402#true} is VALID [2022-04-28 10:14:14,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {79402#true} call #t~ret9 := main(); {79402#true} is VALID [2022-04-28 10:14:14,895 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-28 10:14:14,895 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-28 10:14:14,895 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-28 10:14:14,896 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-28 10:14:14,897 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-28 10:14:14,897 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-28 10:14:14,898 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-28 10:14:14,898 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-28 10:14:14,899 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-28 10:14:14,899 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-28 10:14:14,900 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-28 10:14:14,900 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-28 10:14:14,901 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-28 10:14:14,902 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-28 10:14:14,902 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-28 10:14:14,902 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-28 10:14:14,903 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-28 10:14:14,903 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-28 10:14:14,904 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-28 10:14:14,904 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-28 10:14:14,905 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-28 10:14:14,905 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-28 10:14:14,906 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-28 10:14:14,907 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-28 10:14:14,907 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-28 10:14:14,907 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-28 10:14:14,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {79403#false} ~cond := #in~cond; {79403#false} is VALID [2022-04-28 10:14:14,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {79403#false} assume 0 == ~cond; {79403#false} is VALID [2022-04-28 10:14:14,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {79403#false} assume !false; {79403#false} is VALID [2022-04-28 10:14:14,907 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-28 10:14:14,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:15,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {79403#false} assume !false; {79403#false} is VALID [2022-04-28 10:14:15,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {79403#false} assume 0 == ~cond; {79403#false} is VALID [2022-04-28 10:14:15,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {79403#false} ~cond := #in~cond; {79403#false} is VALID [2022-04-28 10:14:15,844 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-28 10:14:15,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {79546#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {79403#false} is VALID [2022-04-28 10:14:15,845 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-28 10:14:15,846 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-28 10:14:15,846 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-28 10:14:15,847 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-28 10:14:15,848 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-28 10:14:15,848 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-28 10:14:15,849 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-28 10:14:15,849 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-28 10:14:15,850 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-28 10:14:15,851 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-28 10:14:15,851 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-28 10:14:15,852 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-28 10:14:15,853 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-28 10:14:15,853 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-28 10:14:15,854 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-28 10:14:15,855 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-28 10:14:15,856 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-28 10:14:15,856 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-28 10:14:15,865 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-28 10:14:15,866 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-28 10:14:15,867 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-28 10:14:15,867 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-28 10:14:15,868 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-28 10:14:15,868 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-28 10:14:15,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {79402#true} call #t~ret9 := main(); {79402#true} is VALID [2022-04-28 10:14:15,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79402#true} {79402#true} #50#return; {79402#true} is VALID [2022-04-28 10:14:15,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {79402#true} assume true; {79402#true} is VALID [2022-04-28 10:14:15,869 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-28 10:14:15,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {79402#true} call ULTIMATE.init(); {79402#true} is VALID [2022-04-28 10:14:15,869 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-28 10:14:15,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975523867] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:15,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:15,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:14:15,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:15,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [151488965] [2022-04-28 10:14:15,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [151488965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:15,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:15,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:14:15,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224525917] [2022-04-28 10:14:15,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:15,870 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-28 10:14:15,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:15,870 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-28 10:14:15,894 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-28 10:14:15,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:14:15,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:15,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:14:15,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=2058, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:14:15,894 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-28 10:14:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,141 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2022-04-28 10:14:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 10:14:22,141 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-28 10:14:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:22,142 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-28 10:14:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 81 transitions. [2022-04-28 10:14:22,142 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-28 10:14:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 81 transitions. [2022-04-28 10:14:22,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 81 transitions. [2022-04-28 10:14:22,209 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-28 10:14:22,210 INFO L225 Difference]: With dead ends: 102 [2022-04-28 10:14:22,210 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 10:14:22,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1463, Invalid=6727, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 10:14:22,211 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:22,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:14:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 10:14:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2022-04-28 10:14:23,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:23,086 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-28 10:14:23,086 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-28 10:14:23,086 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-28 10:14:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:23,087 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-04-28 10:14:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2022-04-28 10:14:23,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:23,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:23,087 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-28 10:14:23,087 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-28 10:14:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:23,088 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-04-28 10:14:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2022-04-28 10:14:23,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:23,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:23,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:23,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:23,088 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-28 10:14:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 10:14:23,088 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-28 10:14:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:23,089 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 10:14:23,089 INFO L496 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-28 10:14:23,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 10:14:25,091 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-28 10:14:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 10:14:25,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:14:25,091 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:25,091 INFO L195 NwaCegarLoop]: trace histogram [15, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:25,095 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-28 10:14:25,292 WARN L477 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-28 10:14:25,292 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1002206252, now seen corresponding path program 229 times [2022-04-28 10:14:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:25,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [445233334] [2022-04-28 10:14:25,295 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:25,295 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1002206252, now seen corresponding path program 230 times [2022-04-28 10:14:25,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:25,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950115506] [2022-04-28 10:14:25,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:25,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:25,783 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-28 10:14:25,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {80250#true} assume true; {80250#true} is VALID [2022-04-28 10:14:25,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80250#true} {80250#true} #50#return; {80250#true} is VALID [2022-04-28 10:14:25,784 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-28 10:14:25,784 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-28 10:14:25,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {80250#true} assume true; {80250#true} is VALID [2022-04-28 10:14:25,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80250#true} {80250#true} #50#return; {80250#true} is VALID [2022-04-28 10:14:25,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {80250#true} call #t~ret9 := main(); {80250#true} is VALID [2022-04-28 10:14:25,784 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-28 10:14:25,785 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-28 10:14:25,785 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-28 10:14:25,786 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-28 10:14:25,786 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-28 10:14:25,787 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-28 10:14:25,787 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-28 10:14:25,788 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-28 10:14:25,788 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-28 10:14:25,789 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-28 10:14:25,790 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-28 10:14:25,790 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-28 10:14:25,791 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-28 10:14:25,791 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-28 10:14:25,792 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-28 10:14:25,792 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-28 10:14:25,793 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-28 10:14:25,793 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-28 10:14:25,794 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-28 10:14:25,794 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-28 10:14:25,795 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-28 10:14:25,795 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-28 10:14:25,796 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-28 10:14:25,796 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-28 10:14:25,797 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-28 10:14:25,797 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-28 10:14:25,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {80251#false} ~cond := #in~cond; {80251#false} is VALID [2022-04-28 10:14:25,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {80251#false} assume 0 == ~cond; {80251#false} is VALID [2022-04-28 10:14:25,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {80251#false} assume !false; {80251#false} is VALID [2022-04-28 10:14:25,797 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-28 10:14:25,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:25,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950115506] [2022-04-28 10:14:25,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950115506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:25,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759762344] [2022-04-28 10:14:25,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:25,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:25,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:25,798 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-28 10:14:25,799 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-28 10:14:25,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:25,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:25,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:14:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:25,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:26,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {80250#true} call ULTIMATE.init(); {80250#true} is VALID [2022-04-28 10:14:26,251 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-28 10:14:26,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {80250#true} assume true; {80250#true} is VALID [2022-04-28 10:14:26,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80250#true} {80250#true} #50#return; {80250#true} is VALID [2022-04-28 10:14:26,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {80250#true} call #t~ret9 := main(); {80250#true} is VALID [2022-04-28 10:14:26,252 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-28 10:14:26,252 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-28 10:14:26,253 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-28 10:14:26,253 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-28 10:14:26,254 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-28 10:14:26,254 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-28 10:14:26,259 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-28 10:14:26,260 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-28 10:14:26,261 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-28 10:14:26,261 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-28 10:14:26,262 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-28 10:14:26,263 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-28 10:14:26,263 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-28 10:14:26,264 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-28 10:14:26,265 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-28 10:14:26,265 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-28 10:14:26,266 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-28 10:14:26,266 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-28 10:14:26,267 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-28 10:14:26,267 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-28 10:14:26,268 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-28 10:14:26,268 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-28 10:14:26,269 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-28 10:14:26,270 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-28 10:14:26,270 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-28 10:14:26,270 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-28 10:14:26,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {80251#false} ~cond := #in~cond; {80251#false} is VALID [2022-04-28 10:14:26,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {80251#false} assume 0 == ~cond; {80251#false} is VALID [2022-04-28 10:14:26,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {80251#false} assume !false; {80251#false} is VALID [2022-04-28 10:14:26,270 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-28 10:14:26,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:27,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {80251#false} assume !false; {80251#false} is VALID [2022-04-28 10:14:27,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {80251#false} assume 0 == ~cond; {80251#false} is VALID [2022-04-28 10:14:27,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {80251#false} ~cond := #in~cond; {80251#false} is VALID [2022-04-28 10:14:27,231 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-28 10:14:27,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {80394#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80251#false} is VALID [2022-04-28 10:14:27,232 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-28 10:14:27,233 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-28 10:14:27,234 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-28 10:14:27,234 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-28 10:14:27,236 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-28 10:14:27,236 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-28 10:14:27,237 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-28 10:14:27,237 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-28 10:14:27,238 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-28 10:14:27,238 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-28 10:14:27,239 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-28 10:14:27,240 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-28 10:14:27,241 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-28 10:14:27,241 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-28 10:14:27,242 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-28 10:14:27,243 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-28 10:14:27,243 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-28 10:14:27,244 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-28 10:14:27,245 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-28 10:14:27,245 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-28 10:14:27,246 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-28 10:14:27,247 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-28 10:14:27,248 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-28 10:14:27,248 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-28 10:14:27,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {80250#true} call #t~ret9 := main(); {80250#true} is VALID [2022-04-28 10:14:27,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80250#true} {80250#true} #50#return; {80250#true} is VALID [2022-04-28 10:14:27,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {80250#true} assume true; {80250#true} is VALID [2022-04-28 10:14:27,248 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-28 10:14:27,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {80250#true} call ULTIMATE.init(); {80250#true} is VALID [2022-04-28 10:14:27,248 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-28 10:14:27,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759762344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:27,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:27,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:14:27,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:27,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [445233334] [2022-04-28 10:14:27,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [445233334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:27,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:27,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:14:27,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484642509] [2022-04-28 10:14:27,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:27,249 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-28 10:14:27,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:27,249 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-28 10:14:27,273 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-28 10:14:27,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:14:27,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:27,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:14:27,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=2041, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:14:27,274 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-28 10:14:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:34,161 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2022-04-28 10:14:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 10:14:34,161 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-28 10:14:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:34,161 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-28 10:14:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 86 transitions. [2022-04-28 10:14:34,162 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-28 10:14:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 86 transitions. [2022-04-28 10:14:34,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 86 transitions. [2022-04-28 10:14:34,235 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-28 10:14:34,236 INFO L225 Difference]: With dead ends: 110 [2022-04-28 10:14:34,236 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 10:14:34,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1487, Invalid=6703, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 10:14:34,237 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:34,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 133 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:14:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 10:14:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 56. [2022-04-28 10:14:35,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:35,131 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-28 10:14:35,131 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-28 10:14:35,131 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-28 10:14:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:35,132 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2022-04-28 10:14:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2022-04-28 10:14:35,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:35,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:35,132 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-28 10:14:35,132 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-28 10:14:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:35,133 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2022-04-28 10:14:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2022-04-28 10:14:35,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:35,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:35,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:35,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:35,133 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-28 10:14:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 10:14:35,134 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-28 10:14:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:35,134 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 10:14:35,134 INFO L496 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-28 10:14:35,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 10:14:37,838 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-28 10:14:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 10:14:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:14:37,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:37,839 INFO L195 NwaCegarLoop]: trace histogram [16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:37,854 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-28 10:14:38,039 WARN L477 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-28 10:14:38,039 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1366403029, now seen corresponding path program 231 times [2022-04-28 10:14:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:38,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [214914403] [2022-04-28 10:14:38,041 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:38,042 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1366403029, now seen corresponding path program 232 times [2022-04-28 10:14:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:38,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892527077] [2022-04-28 10:14:38,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:38,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:38,491 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-28 10:14:38,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {81130#true} assume true; {81130#true} is VALID [2022-04-28 10:14:38,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81130#true} {81130#true} #50#return; {81130#true} is VALID [2022-04-28 10:14:38,492 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-28 10:14:38,492 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-28 10:14:38,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {81130#true} assume true; {81130#true} is VALID [2022-04-28 10:14:38,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81130#true} {81130#true} #50#return; {81130#true} is VALID [2022-04-28 10:14:38,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {81130#true} call #t~ret9 := main(); {81130#true} is VALID [2022-04-28 10:14:38,492 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-28 10:14:38,493 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-28 10:14:38,493 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-28 10:14:38,494 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-28 10:14:38,494 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-28 10:14:38,495 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-28 10:14:38,495 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-28 10:14:38,496 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-28 10:14:38,497 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-28 10:14:38,497 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-28 10:14:38,498 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-28 10:14:38,498 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-28 10:14:38,499 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-28 10:14:38,499 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-28 10:14:38,500 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-28 10:14:38,501 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-28 10:14:38,501 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-28 10:14:38,501 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-28 10:14:38,502 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-28 10:14:38,502 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-28 10:14:38,503 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-28 10:14:38,504 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-28 10:14:38,504 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-28 10:14:38,505 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-28 10:14:38,505 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-28 10:14:38,505 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-28 10:14:38,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {81131#false} ~cond := #in~cond; {81131#false} is VALID [2022-04-28 10:14:38,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {81131#false} assume 0 == ~cond; {81131#false} is VALID [2022-04-28 10:14:38,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {81131#false} assume !false; {81131#false} is VALID [2022-04-28 10:14:38,506 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-28 10:14:38,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:38,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892527077] [2022-04-28 10:14:38,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892527077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:38,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410994265] [2022-04-28 10:14:38,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:38,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:38,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:38,507 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-28 10:14:38,508 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-28 10:14:38,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:38,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:38,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:14:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:38,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:38,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {81130#true} call ULTIMATE.init(); {81130#true} is VALID [2022-04-28 10:14:38,929 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-28 10:14:38,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {81130#true} assume true; {81130#true} is VALID [2022-04-28 10:14:38,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81130#true} {81130#true} #50#return; {81130#true} is VALID [2022-04-28 10:14:38,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {81130#true} call #t~ret9 := main(); {81130#true} is VALID [2022-04-28 10:14:38,929 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-28 10:14:38,930 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-28 10:14:38,931 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-28 10:14:38,931 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-28 10:14:38,932 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-28 10:14:38,933 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-28 10:14:38,933 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-28 10:14:38,934 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-28 10:14:38,935 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-28 10:14:38,936 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-28 10:14:38,936 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-28 10:14:38,937 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-28 10:14:38,937 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-28 10:14:38,938 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-28 10:14:38,938 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-28 10:14:38,939 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-28 10:14:38,940 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-28 10:14:38,940 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-28 10:14:38,940 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-28 10:14:38,941 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-28 10:14:38,941 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-28 10:14:38,942 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-28 10:14:38,942 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-28 10:14:38,943 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-28 10:14:38,943 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-28 10:14:38,944 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-28 10:14:38,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {81131#false} ~cond := #in~cond; {81131#false} is VALID [2022-04-28 10:14:38,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {81131#false} assume 0 == ~cond; {81131#false} is VALID [2022-04-28 10:14:38,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {81131#false} assume !false; {81131#false} is VALID [2022-04-28 10:14:38,944 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-28 10:14:38,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:39,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {81131#false} assume !false; {81131#false} is VALID [2022-04-28 10:14:39,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {81131#false} assume 0 == ~cond; {81131#false} is VALID [2022-04-28 10:14:39,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {81131#false} ~cond := #in~cond; {81131#false} is VALID [2022-04-28 10:14:39,936 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-28 10:14:39,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {81274#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {81131#false} is VALID [2022-04-28 10:14:39,937 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-28 10:14:39,938 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-28 10:14:39,939 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-28 10:14:39,942 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-28 10:14:39,943 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-28 10:14:39,943 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-28 10:14:39,943 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-28 10:14:39,944 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-28 10:14:39,945 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-28 10:14:39,945 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-28 10:14:39,946 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-28 10:14:39,947 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-28 10:14:39,948 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-28 10:14:39,948 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-28 10:14:39,949 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-28 10:14:39,950 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-28 10:14:39,950 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-28 10:14:39,951 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-28 10:14:39,952 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-28 10:14:39,952 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-28 10:14:39,953 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-28 10:14:39,954 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-28 10:14:39,954 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-28 10:14:39,955 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-28 10:14:39,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {81130#true} call #t~ret9 := main(); {81130#true} is VALID [2022-04-28 10:14:39,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81130#true} {81130#true} #50#return; {81130#true} is VALID [2022-04-28 10:14:39,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {81130#true} assume true; {81130#true} is VALID [2022-04-28 10:14:39,955 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-28 10:14:39,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {81130#true} call ULTIMATE.init(); {81130#true} is VALID [2022-04-28 10:14:39,955 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-28 10:14:39,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410994265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:39,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:39,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:14:39,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:39,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [214914403] [2022-04-28 10:14:39,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [214914403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:39,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:39,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:14:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479368801] [2022-04-28 10:14:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:39,956 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-28 10:14:39,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:39,956 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-28 10:14:39,980 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-28 10:14:39,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:14:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:39,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:14:39,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2022, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:14:39,981 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-28 10:14:46,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:46,980 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2022-04-28 10:14:46,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 10:14:46,981 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-28 10:14:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:46,981 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-28 10:14:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 88 transitions. [2022-04-28 10:14:46,981 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-28 10:14:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 88 transitions. [2022-04-28 10:14:46,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 88 transitions. [2022-04-28 10:14:47,052 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-28 10:14:47,053 INFO L225 Difference]: With dead ends: 117 [2022-04-28 10:14:47,053 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 10:14:47,054 INFO L412 NwaCegarLoop]: 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-28 10:14:47,054 INFO L413 NwaCegarLoop]: 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-28 10:14:47,054 INFO L414 NwaCegarLoop]: 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-28 10:14:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 10:14:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 56. [2022-04-28 10:14:47,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:47,900 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-28 10:14:47,900 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-28 10:14:47,900 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-28 10:14:47,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:47,901 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2022-04-28 10:14:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2022-04-28 10:14:47,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:47,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:47,902 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-28 10:14:47,902 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-28 10:14:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:47,902 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2022-04-28 10:14:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2022-04-28 10:14:47,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:47,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:47,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:47,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:47,903 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-28 10:14:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 10:14:47,903 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-28 10:14:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:47,903 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 10:14:47,903 INFO L496 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-28 10:14:47,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 10:14:49,861 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-28 10:14:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 10:14:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:14:49,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:49,862 INFO L195 NwaCegarLoop]: trace histogram [17, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:49,878 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-28 10:14:50,062 WARN L477 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-28 10:14:50,062 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:50,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:50,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1442809780, now seen corresponding path program 233 times [2022-04-28 10:14:50,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:50,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113704852] [2022-04-28 10:14:50,065 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:50,065 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1442809780, now seen corresponding path program 234 times [2022-04-28 10:14:50,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:50,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642422945] [2022-04-28 10:14:50,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:50,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:50,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:50,512 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-28 10:14:50,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {82032#true} assume true; {82032#true} is VALID [2022-04-28 10:14:50,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82032#true} {82032#true} #50#return; {82032#true} is VALID [2022-04-28 10:14:50,512 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-28 10:14:50,512 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-28 10:14:50,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {82032#true} assume true; {82032#true} is VALID [2022-04-28 10:14:50,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82032#true} {82032#true} #50#return; {82032#true} is VALID [2022-04-28 10:14:50,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {82032#true} call #t~ret9 := main(); {82032#true} is VALID [2022-04-28 10:14:50,513 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-28 10:14:50,513 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-28 10:14:50,514 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-28 10:14:50,514 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-28 10:14:50,515 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-28 10:14:50,515 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-28 10:14:50,516 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-28 10:14:50,516 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-28 10:14:50,517 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-28 10:14:50,517 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-28 10:14:50,518 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-28 10:14:50,519 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-28 10:14:50,519 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-28 10:14:50,520 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-28 10:14:50,520 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-28 10:14:50,521 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-28 10:14:50,521 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-28 10:14:50,522 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-28 10:14:50,522 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-28 10:14:50,523 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-28 10:14:50,523 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-28 10:14:50,524 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-28 10:14:50,524 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-28 10:14:50,525 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-28 10:14:50,525 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-28 10:14:50,525 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-28 10:14:50,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {82033#false} ~cond := #in~cond; {82033#false} is VALID [2022-04-28 10:14:50,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {82033#false} assume 0 == ~cond; {82033#false} is VALID [2022-04-28 10:14:50,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {82033#false} assume !false; {82033#false} is VALID [2022-04-28 10:14:50,526 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-28 10:14:50,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642422945] [2022-04-28 10:14:50,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642422945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276380287] [2022-04-28 10:14:50,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:50,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:50,527 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-28 10:14:50,527 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-28 10:14:50,821 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:14:50,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:50,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:14:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:50,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:51,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {82032#true} call ULTIMATE.init(); {82032#true} is VALID [2022-04-28 10:14:51,216 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-28 10:14:51,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {82032#true} assume true; {82032#true} is VALID [2022-04-28 10:14:51,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82032#true} {82032#true} #50#return; {82032#true} is VALID [2022-04-28 10:14:51,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {82032#true} call #t~ret9 := main(); {82032#true} is VALID [2022-04-28 10:14:51,217 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-28 10:14:51,217 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-28 10:14:51,218 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-28 10:14:51,218 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-28 10:14:51,219 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-28 10:14:51,219 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-28 10:14:51,220 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-28 10:14:51,221 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-28 10:14:51,221 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-28 10:14:51,222 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-28 10:14:51,222 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-28 10:14:51,223 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-28 10:14:51,223 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-28 10:14:51,224 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-28 10:14:51,224 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-28 10:14:51,225 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-28 10:14:51,226 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-28 10:14:51,226 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-28 10:14:51,226 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-28 10:14:51,227 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-28 10:14:51,227 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-28 10:14:51,228 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-28 10:14:51,228 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-28 10:14:51,229 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-28 10:14:51,229 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-28 10:14:51,230 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-28 10:14:51,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {82033#false} ~cond := #in~cond; {82033#false} is VALID [2022-04-28 10:14:51,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {82033#false} assume 0 == ~cond; {82033#false} is VALID [2022-04-28 10:14:51,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {82033#false} assume !false; {82033#false} is VALID [2022-04-28 10:14:51,230 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-28 10:14:51,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:52,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {82033#false} assume !false; {82033#false} is VALID [2022-04-28 10:14:52,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {82033#false} assume 0 == ~cond; {82033#false} is VALID [2022-04-28 10:14:52,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {82033#false} ~cond := #in~cond; {82033#false} is VALID [2022-04-28 10:14:52,203 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-28 10:14:52,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {82176#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {82033#false} is VALID [2022-04-28 10:14:52,204 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-28 10:14:52,205 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-28 10:14:52,206 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-28 10:14:52,207 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-28 10:14:52,207 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-28 10:14:52,207 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-28 10:14:52,208 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-28 10:14:52,209 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-28 10:14:52,209 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-28 10:14:52,210 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-28 10:14:52,211 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-28 10:14:52,212 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-28 10:14:52,212 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-28 10:14:52,213 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-28 10:14:52,214 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-28 10:14:52,214 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-28 10:14:52,215 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-28 10:14:52,216 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-28 10:14:52,216 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-28 10:14:52,217 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-28 10:14:52,218 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-28 10:14:52,218 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-28 10:14:52,219 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-28 10:14:52,220 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-28 10:14:52,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {82032#true} call #t~ret9 := main(); {82032#true} is VALID [2022-04-28 10:14:52,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82032#true} {82032#true} #50#return; {82032#true} is VALID [2022-04-28 10:14:52,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {82032#true} assume true; {82032#true} is VALID [2022-04-28 10:14:52,220 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-28 10:14:52,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {82032#true} call ULTIMATE.init(); {82032#true} is VALID [2022-04-28 10:14:52,220 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-28 10:14:52,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276380287] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:52,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:52,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:14:52,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:52,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113704852] [2022-04-28 10:14:52,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113704852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:52,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:52,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:14:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340468611] [2022-04-28 10:14:52,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:52,221 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-28 10:14:52,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:52,221 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-28 10:14:52,244 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-28 10:14:52,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:14:52,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:52,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:14:52,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1999, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:14:52,244 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-28 10:14:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:59,414 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2022-04-28 10:14:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 10:14:59,414 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-28 10:14:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:59,414 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-28 10:14:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 88 transitions. [2022-04-28 10:14:59,415 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-28 10:14:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 88 transitions. [2022-04-28 10:14:59,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 88 transitions. [2022-04-28 10:14:59,489 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-28 10:14:59,490 INFO L225 Difference]: With dead ends: 123 [2022-04-28 10:14:59,490 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 10:14:59,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1297, Invalid=5509, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 10:14:59,491 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 55 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:59,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 136 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:14:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 10:15:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 56. [2022-04-28 10:15:00,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:00,349 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-28 10:15:00,349 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-28 10:15:00,349 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-28 10:15:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:00,350 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2022-04-28 10:15:00,350 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2022-04-28 10:15:00,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:00,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:00,350 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-28 10:15:00,350 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-28 10:15:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:00,351 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2022-04-28 10:15:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2022-04-28 10:15:00,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:00,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:00,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:00,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:00,352 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-28 10:15:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 10:15:00,352 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-28 10:15:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:00,352 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 10:15:00,352 INFO L496 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-28 10:15:00,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 10:15:02,313 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-28 10:15:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 10:15:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:15:02,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:02,314 INFO L195 NwaCegarLoop]: trace histogram [18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:02,320 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-28 10:15:02,514 WARN L477 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-28 10:15:02,514 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash -475443189, now seen corresponding path program 235 times [2022-04-28 10:15:02,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:02,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2008207891] [2022-04-28 10:15:02,517 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:02,517 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash -475443189, now seen corresponding path program 236 times [2022-04-28 10:15:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:02,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369503033] [2022-04-28 10:15:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:02,966 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-28 10:15:02,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {82948#true} assume true; {82948#true} is VALID [2022-04-28 10:15:02,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82948#true} {82948#true} #50#return; {82948#true} is VALID [2022-04-28 10:15:02,967 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-28 10:15:02,967 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-28 10:15:02,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {82948#true} assume true; {82948#true} is VALID [2022-04-28 10:15:02,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82948#true} {82948#true} #50#return; {82948#true} is VALID [2022-04-28 10:15:02,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {82948#true} call #t~ret9 := main(); {82948#true} is VALID [2022-04-28 10:15:02,967 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-28 10:15:02,968 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-28 10:15:02,968 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-28 10:15:02,969 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-28 10:15:02,969 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-28 10:15:02,970 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-28 10:15:02,970 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-28 10:15:02,971 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-28 10:15:02,971 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-28 10:15:02,972 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-28 10:15:02,973 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-28 10:15:02,973 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-28 10:15:02,974 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-28 10:15:02,974 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-28 10:15:02,975 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-28 10:15:02,975 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-28 10:15:02,976 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-28 10:15:02,977 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-28 10:15:02,977 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-28 10:15:02,977 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-28 10:15:02,978 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-28 10:15:02,978 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-28 10:15:02,979 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-28 10:15:02,979 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-28 10:15:02,980 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-28 10:15:02,980 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-28 10:15:02,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {82949#false} ~cond := #in~cond; {82949#false} is VALID [2022-04-28 10:15:02,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {82949#false} assume 0 == ~cond; {82949#false} is VALID [2022-04-28 10:15:02,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {82949#false} assume !false; {82949#false} is VALID [2022-04-28 10:15:02,980 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-28 10:15:02,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:02,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369503033] [2022-04-28 10:15:02,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369503033] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:02,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530186832] [2022-04-28 10:15:02,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:02,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:02,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:02,981 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-28 10:15:02,982 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-28 10:15:03,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:03,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:03,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:15:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:03,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:03,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {82948#true} call ULTIMATE.init(); {82948#true} is VALID [2022-04-28 10:15:03,375 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-28 10:15:03,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {82948#true} assume true; {82948#true} is VALID [2022-04-28 10:15:03,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82948#true} {82948#true} #50#return; {82948#true} is VALID [2022-04-28 10:15:03,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {82948#true} call #t~ret9 := main(); {82948#true} is VALID [2022-04-28 10:15:03,375 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-28 10:15:03,376 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-28 10:15:03,376 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-28 10:15:03,377 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-28 10:15:03,378 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-28 10:15:03,378 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-28 10:15:03,379 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-28 10:15:03,379 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-28 10:15:03,380 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-28 10:15:03,380 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-28 10:15:03,381 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-28 10:15:03,381 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-28 10:15:03,382 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-28 10:15:03,382 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-28 10:15:03,383 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-28 10:15:03,384 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-28 10:15:03,384 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-28 10:15:03,385 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-28 10:15:03,385 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-28 10:15:03,386 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-28 10:15:03,386 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-28 10:15:03,386 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-28 10:15:03,387 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-28 10:15:03,388 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-28 10:15:03,388 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-28 10:15:03,388 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-28 10:15:03,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {82949#false} ~cond := #in~cond; {82949#false} is VALID [2022-04-28 10:15:03,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {82949#false} assume 0 == ~cond; {82949#false} is VALID [2022-04-28 10:15:03,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {82949#false} assume !false; {82949#false} is VALID [2022-04-28 10:15:03,388 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-28 10:15:03,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:04,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {82949#false} assume !false; {82949#false} is VALID [2022-04-28 10:15:04,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {82949#false} assume 0 == ~cond; {82949#false} is VALID [2022-04-28 10:15:04,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {82949#false} ~cond := #in~cond; {82949#false} is VALID [2022-04-28 10:15:04,362 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-28 10:15:04,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {83092#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {82949#false} is VALID [2022-04-28 10:15:04,363 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-28 10:15:04,363 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-28 10:15:04,365 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-28 10:15:04,365 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-28 10:15:04,366 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-28 10:15:04,366 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-28 10:15:04,367 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-28 10:15:04,368 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-28 10:15:04,369 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-28 10:15:04,369 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-28 10:15:04,370 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-28 10:15:04,371 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-28 10:15:04,371 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-28 10:15:04,372 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-28 10:15:04,373 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-28 10:15:04,373 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-28 10:15:04,374 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-28 10:15:04,375 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-28 10:15:04,375 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-28 10:15:04,376 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-28 10:15:04,377 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-28 10:15:04,378 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-28 10:15:04,378 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-28 10:15:04,379 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-28 10:15:04,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {82948#true} call #t~ret9 := main(); {82948#true} is VALID [2022-04-28 10:15:04,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82948#true} {82948#true} #50#return; {82948#true} is VALID [2022-04-28 10:15:04,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {82948#true} assume true; {82948#true} is VALID [2022-04-28 10:15:04,379 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-28 10:15:04,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {82948#true} call ULTIMATE.init(); {82948#true} is VALID [2022-04-28 10:15:04,379 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-28 10:15:04,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530186832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:04,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:04,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:15:04,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:04,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2008207891] [2022-04-28 10:15:04,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2008207891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:04,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:04,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:15:04,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423529068] [2022-04-28 10:15:04,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:04,380 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-28 10:15:04,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:04,380 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-28 10:15:04,401 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-28 10:15:04,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:15:04,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:04,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:15:04,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1972, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:15:04,402 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-28 10:15:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:12,029 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-04-28 10:15:12,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:15:12,029 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-28 10:15:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:12,029 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-28 10:15:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 89 transitions. [2022-04-28 10:15:12,030 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-28 10:15:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 89 transitions. [2022-04-28 10:15:12,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 89 transitions. [2022-04-28 10:15:12,107 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-28 10:15:12,108 INFO L225 Difference]: With dead ends: 128 [2022-04-28 10:15:12,108 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 10:15:12,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1213, Invalid=4949, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 10:15:12,109 INFO L413 NwaCegarLoop]: 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:12,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 156 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:15:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 10:15:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 56. [2022-04-28 10:15:12,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:12,966 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-28 10:15:12,967 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-28 10:15:12,967 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-28 10:15:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:12,968 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2022-04-28 10:15:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2022-04-28 10:15:12,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:12,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:12,968 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-28 10:15:12,968 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-28 10:15:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:12,969 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2022-04-28 10:15:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2022-04-28 10:15:12,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:12,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:12,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:12,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:12,969 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-28 10:15:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 10:15:12,970 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-28 10:15:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:12,970 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 10:15:12,970 INFO L496 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-28 10:15:12,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 10:15:15,059 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-28 10:15:15,061 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-28 10:15:15,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Ended with exit code 0 [2022-04-28 10:15:15,261 WARN L477 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-28 10:15:15,262 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.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertPostcondInternal(IncrementalHoareTripleChecker.java:556) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertPostcond(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddPostcond(IncrementalHoareTripleChecker.java:248) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:139) 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:500) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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) ... 31 more [2022-04-28 10:15:15,265 INFO L158 Benchmark]: Toolchain (without parser) took 713547.77ms. Allocated memory was 209.7MB in the beginning and 314.6MB in the end (delta: 104.9MB). Free memory was 186.2MB in the beginning and 242.8MB in the end (delta: -56.6MB). Peak memory consumption was 202.9MB. Max. memory is 8.0GB. [2022-04-28 10:15:15,265 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 174.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:15:15,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.31ms. Allocated memory was 209.7MB in the beginning and 262.1MB in the end (delta: 52.4MB). Free memory was 185.9MB in the beginning and 236.4MB in the end (delta: -50.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-28 10:15:15,265 INFO L158 Benchmark]: Boogie Preprocessor took 35.71ms. Allocated memory is still 262.1MB. Free memory was 236.4MB in the beginning and 235.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 10:15:15,265 INFO L158 Benchmark]: RCFGBuilder took 203.31ms. Allocated memory is still 262.1MB. Free memory was 235.3MB in the beginning and 223.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:15:15,265 INFO L158 Benchmark]: TraceAbstraction took 713120.39ms. Allocated memory was 262.1MB in the beginning and 314.6MB in the end (delta: 52.4MB). Free memory was 223.7MB in the beginning and 242.8MB in the end (delta: -19.1MB). Peak memory consumption was 189.3MB. Max. memory is 8.0GB. [2022-04-28 10:15:15,266 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.13ms. Allocated memory is still 209.7MB. Free memory is still 174.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.31ms. Allocated memory was 209.7MB in the beginning and 262.1MB in the end (delta: 52.4MB). Free memory was 185.9MB in the beginning and 236.4MB in the end (delta: -50.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.71ms. Allocated memory is still 262.1MB. Free memory was 236.4MB in the beginning and 235.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 203.31ms. Allocated memory is still 262.1MB. Free memory was 235.3MB in the beginning and 223.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 713120.39ms. Allocated memory was 262.1MB in the beginning and 314.6MB in the end (delta: 52.4MB). Free memory was 223.7MB in the beginning and 242.8MB in the end (delta: -19.1MB). Peak memory consumption was 189.3MB. 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...