/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/loop-acceleration/underapprox_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:26:20,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:26:20,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:26:20,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:26:20,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:26:20,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:26:20,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:26:20,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:26:20,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:26:20,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:26:20,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:26:20,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:26:20,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:26:20,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:26:20,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:26:20,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:26:20,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:26:20,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:26:20,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:26:20,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:26:20,563 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:26:20,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:26:20,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:26:20,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:26:20,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:26:20,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:26:20,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:26:20,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:26:20,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:26:20,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:26:20,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:26:20,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:26:20,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:26:20,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:26:20,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:26:20,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:26:20,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:26:20,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:26:20,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:26:20,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:26:20,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:26:20,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:26:20,587 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 09:26:20,600 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:26:20,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:26:20,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:26:20,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:26:20,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:26:20,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:26:20,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:26:20,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:26:20,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:26:20,604 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:26:20,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:26:20,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:26:20,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:26:20,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:26:20,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:26:20,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:26:20,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:26:20,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:26:20,605 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:26:20,605 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:26:20,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:26:20,605 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:26:20,605 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 09:26:20,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:26:20,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:26:20,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:26:20,896 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:26:20,899 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:26:20,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2022-04-28 09:26:20,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b42523e/1d40984ae0564f4aa2edd59347910e7d/FLAGfc41a60c9 [2022-04-28 09:26:21,372 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:26:21,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2022-04-28 09:26:21,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b42523e/1d40984ae0564f4aa2edd59347910e7d/FLAGfc41a60c9 [2022-04-28 09:26:21,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b42523e/1d40984ae0564f4aa2edd59347910e7d [2022-04-28 09:26:21,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:26:21,791 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:26:21,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:26:21,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:26:21,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:26:21,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:26:21" (1/1) ... [2022-04-28 09:26:21,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24356e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:21, skipping insertion in model container [2022-04-28 09:26:21,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:26:21" (1/1) ... [2022-04-28 09:26:21,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:26:21,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:26:21,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2022-04-28 09:26:22,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:26:22,021 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:26:22,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2022-04-28 09:26:22,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:26:22,060 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:26:22,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:22 WrapperNode [2022-04-28 09:26:22,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:26:22,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:26:22,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:26:22,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:26:22,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:22" (1/1) ... [2022-04-28 09:26:22,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:22" (1/1) ... [2022-04-28 09:26:22,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:22" (1/1) ... [2022-04-28 09:26:22,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:22" (1/1) ... [2022-04-28 09:26:22,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:22" (1/1) ... [2022-04-28 09:26:22,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:22" (1/1) ... [2022-04-28 09:26:22,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:22" (1/1) ... [2022-04-28 09:26:22,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:26:22,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:26:22,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:26:22,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:26:22,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:22" (1/1) ... [2022-04-28 09:26:22,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:26:22,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:22,120 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 09:26:22,148 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 09:26:22,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:26:22,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:26:22,163 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:26:22,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:26:22,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:26:22,163 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:26:22,163 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:26:22,163 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:26:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:26:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:26:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:26:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:26:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:26:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:26:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:26:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:26:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:26:22,217 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:26:22,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:26:22,362 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:26:22,370 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:26:22,371 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:26:22,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:26:22 BoogieIcfgContainer [2022-04-28 09:26:22,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:26:22,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:26:22,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:26:22,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:26:22,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:26:21" (1/3) ... [2022-04-28 09:26:22,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5786d51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:26:22, skipping insertion in model container [2022-04-28 09:26:22,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:22" (2/3) ... [2022-04-28 09:26:22,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5786d51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:26:22, skipping insertion in model container [2022-04-28 09:26:22,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:26:22" (3/3) ... [2022-04-28 09:26:22,389 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2022-04-28 09:26:22,401 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:26:22,401 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:26:22,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:26:22,462 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@650941b1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6298103b [2022-04-28 09:26:22,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:26:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 09:26:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:26:22,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:22,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:22,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:22,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:22,503 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-28 09:26:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:22,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329221596] [2022-04-28 09:26:22,529 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:26:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-28 09:26:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:22,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129282318] [2022-04-28 09:26:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:22,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:22,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:22,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 09:26:22,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 09:26:22,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 09:26:22,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:22,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 09:26:22,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 09:26:22,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 09:26:22,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-28 09:26:22,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-28 09:26:22,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-28 09:26:22,726 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {22#false} is VALID [2022-04-28 09:26:22,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-28 09:26:22,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-28 09:26:22,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 09:26:22,727 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 09:26:22,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:22,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129282318] [2022-04-28 09:26:22,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129282318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:22,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:22,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:26:22,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:22,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329221596] [2022-04-28 09:26:22,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329221596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:22,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:22,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:26:22,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841810625] [2022-04-28 09:26:22,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:22,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:26:22,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:22,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:22,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:22,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:26:22,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:26:22,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:26:22,795 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:22,876 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 09:26:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:26:22,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:26:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 09:26:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 09:26:22,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-28 09:26:22,935 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 09:26:22,942 INFO L225 Difference]: With dead ends: 29 [2022-04-28 09:26:22,942 INFO L226 Difference]: Without dead ends: 12 [2022-04-28 09:26:22,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:26:22,947 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:22,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:26:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-28 09:26:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-28 09:26:22,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:22,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:22,978 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:22,979 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:22,981 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 09:26:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 09:26:22,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:22,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:22,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-28 09:26:22,982 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-28 09:26:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:22,985 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 09:26:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 09:26:22,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:22,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:22,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:22,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-28 09:26:22,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-28 09:26:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:22,989 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-28 09:26:22,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:22,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-28 09:26:23,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 09:26:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:26:23,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:23,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:23,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:26:23,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:23,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-28 09:26:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:23,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719307529] [2022-04-28 09:26:23,010 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:26:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-28 09:26:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:23,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396743773] [2022-04-28 09:26:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:23,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:23,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-28 09:26:23,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 09:26:23,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 09:26:23,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:23,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-28 09:26:23,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 09:26:23,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 09:26:23,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-28 09:26:23,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0;~y~0 := 1; {140#(= main_~x~0 0)} is VALID [2022-04-28 09:26:23,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {136#false} is VALID [2022-04-28 09:26:23,085 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {136#false} is VALID [2022-04-28 09:26:23,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-28 09:26:23,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-28 09:26:23,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-28 09:26:23,086 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 09:26:23,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:23,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396743773] [2022-04-28 09:26:23,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396743773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:23,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:23,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:26:23,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:23,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719307529] [2022-04-28 09:26:23,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719307529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:23,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:23,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:26:23,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727051844] [2022-04-28 09:26:23,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:23,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:26:23,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:23,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:23,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:26:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:26:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:26:23,103 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:23,147 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:26:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:26:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:26:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 09:26:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 09:26:23,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-28 09:26:23,169 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 09:26:23,170 INFO L225 Difference]: With dead ends: 18 [2022-04-28 09:26:23,171 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 09:26:23,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:26:23,172 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:23,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:26:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 09:26:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 09:26:23,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:23,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,177 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,177 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:23,178 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 09:26:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 09:26:23,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:23,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:23,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 09:26:23,179 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 09:26:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:23,180 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 09:26:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 09:26:23,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:23,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:23,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:23,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 09:26:23,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 09:26:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:23,183 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 09:26:23,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 09:26:23,197 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 09:26:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 09:26:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:26:23,198 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:23,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:23,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:26:23,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:23,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-28 09:26:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:23,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800838106] [2022-04-28 09:26:23,226 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:23,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-28 09:26:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:23,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757044063] [2022-04-28 09:26:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:23,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 09:26:23,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 09:26:23,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 09:26:23,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:23,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 09:26:23,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 09:26:23,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 09:26:23,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-28 09:26:23,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {239#(= main_~x~0 0)} is VALID [2022-04-28 09:26:23,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {240#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:26:23,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {235#false} is VALID [2022-04-28 09:26:23,392 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-28 09:26:23,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 09:26:23,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 09:26:23,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 09:26:23,395 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 09:26:23,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:23,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757044063] [2022-04-28 09:26:23,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757044063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:23,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976133363] [2022-04-28 09:26:23,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:26:23,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:23,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:23,400 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 09:26:23,401 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 09:26:23,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:26:23,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:23,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:26:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:23,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:23,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-28 09:26:23,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 09:26:23,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 09:26:23,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 09:26:23,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-28 09:26:23,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {239#(= main_~x~0 0)} is VALID [2022-04-28 09:26:23,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {263#(= main_~x~0 1)} is VALID [2022-04-28 09:26:23,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 6); {235#false} is VALID [2022-04-28 09:26:23,549 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-28 09:26:23,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 09:26:23,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 09:26:23,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 09:26:23,551 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 09:26:23,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:23,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 09:26:23,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 09:26:23,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 09:26:23,639 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-28 09:26:23,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {235#false} is VALID [2022-04-28 09:26:23,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {291#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-28 09:26:23,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {295#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-28 09:26:23,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-28 09:26:23,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 09:26:23,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 09:26:23,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 09:26:23,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-28 09:26:23,644 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 09:26:23,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976133363] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:23,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:23,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 09:26:23,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:23,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800838106] [2022-04-28 09:26:23,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800838106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:23,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:23,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:26:23,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753979384] [2022-04-28 09:26:23,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:26:23,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:23,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:23,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:26:23,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:26:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:26:23,662 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:23,732 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 09:26:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:26:23,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:26:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 09:26:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 09:26:23,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-28 09:26:23,763 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 09:26:23,764 INFO L225 Difference]: With dead ends: 19 [2022-04-28 09:26:23,764 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 09:26:23,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:26:23,766 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:23,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:26:23,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 09:26:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 09:26:23,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:23,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,773 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,773 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:23,775 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:26:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:26:23,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:23,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:23,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:26:23,776 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:26:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:23,777 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:26:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:26:23,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:23,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:23,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:23,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 09:26:23,781 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 09:26:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:23,781 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 09:26:23,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:23,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 09:26:23,798 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 09:26:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:26:23,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:26:23,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:23,799 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:23,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:26:24,006 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 09:26:24,007 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:24,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-28 09:26:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:24,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1545697667] [2022-04-28 09:26:24,016 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:24,017 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-28 09:26:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:24,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145719134] [2022-04-28 09:26:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:24,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:24,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 09:26:24,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 09:26:24,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 09:26:24,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:24,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 09:26:24,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 09:26:24,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 09:26:24,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret5 := main(); {414#true} is VALID [2022-04-28 09:26:24,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0;~y~0 := 1; {419#(= main_~x~0 0)} is VALID [2022-04-28 09:26:24,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {420#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:24,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {421#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:24,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {415#false} is VALID [2022-04-28 09:26:24,138 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-28 09:26:24,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 09:26:24,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 09:26:24,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 09:26:24,139 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 09:26:24,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:24,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145719134] [2022-04-28 09:26:24,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145719134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:24,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134602689] [2022-04-28 09:26:24,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:26:24,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:24,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:24,141 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 09:26:24,171 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 09:26:24,191 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:26:24,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:24,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:26:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:24,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:24,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-28 09:26:24,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 09:26:24,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 09:26:24,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 09:26:24,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret5 := main(); {414#true} is VALID [2022-04-28 09:26:24,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0;~y~0 := 1; {419#(= main_~x~0 0)} is VALID [2022-04-28 09:26:24,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {420#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:24,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:24,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {415#false} is VALID [2022-04-28 09:26:24,470 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-28 09:26:24,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 09:26:24,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 09:26:24,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 09:26:24,471 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 09:26:24,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:24,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 09:26:24,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 09:26:24,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 09:26:24,569 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-28 09:26:24,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {415#false} is VALID [2022-04-28 09:26:24,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {479#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {475#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-28 09:26:24,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(< (mod (+ main_~x~0 2) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {479#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-28 09:26:24,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0;~y~0 := 1; {483#(< (mod (+ main_~x~0 2) 4294967296) 6)} is VALID [2022-04-28 09:26:24,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret5 := main(); {414#true} is VALID [2022-04-28 09:26:24,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 09:26:24,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 09:26:24,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 09:26:24,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-28 09:26:24,575 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 09:26:24,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134602689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:24,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:24,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 09:26:24,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:24,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1545697667] [2022-04-28 09:26:24,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1545697667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:24,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:24,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:26:24,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072784840] [2022-04-28 09:26:24,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:24,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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 09:26:24,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:24,579 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), 5 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 09:26:24,591 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 09:26:24,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:26:24,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:24,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:26:24,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:26:24,593 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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 09:26:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:24,708 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 09:26:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:26:24,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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 09:26:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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 09:26:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 09:26:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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 09:26:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 09:26:24,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 09:26:24,733 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 09:26:24,734 INFO L225 Difference]: With dead ends: 20 [2022-04-28 09:26:24,735 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:26:24,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:26:24,736 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:24,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:26:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:26:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:26:24,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:24,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:24,743 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:24,744 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:24,745 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:26:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:26:24,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:24,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:24,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states 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 09:26:24,746 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states 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 09:26:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:24,747 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:26:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:26:24,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:24,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:24,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:24,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 09:26:24,749 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 09:26:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:24,749 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 09:26:24,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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 09:26:24,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 09:26:24,764 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 09:26:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:26:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:26:24,765 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:24,765 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:24,791 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 09:26:24,987 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 09:26:24,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-28 09:26:24,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:24,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1701781253] [2022-04-28 09:26:24,994 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:24,994 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-28 09:26:24,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:24,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540292182] [2022-04-28 09:26:24,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:24,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:25,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:25,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 09:26:25,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 09:26:25,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 09:26:25,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:25,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 09:26:25,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 09:26:25,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 09:26:25,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 09:26:25,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0;~y~0 := 1; {615#(= main_~x~0 0)} is VALID [2022-04-28 09:26:25,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {616#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:25,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {617#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:25,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {618#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:26:25,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 6); {611#false} is VALID [2022-04-28 09:26:25,122 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {611#false} is VALID [2022-04-28 09:26:25,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-28 09:26:25,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-28 09:26:25,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 09:26:25,123 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 09:26:25,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:25,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540292182] [2022-04-28 09:26:25,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540292182] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:25,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094916219] [2022-04-28 09:26:25,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:26:25,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:25,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:25,125 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 09:26:25,144 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 09:26:25,170 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:26:25,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:25,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 09:26:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:25,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:25,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-28 09:26:25,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 09:26:25,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 09:26:25,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 09:26:25,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 09:26:25,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0;~y~0 := 1; {638#(= main_~y~0 1)} is VALID [2022-04-28 09:26:25,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {638#(= main_~y~0 1)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {642#(= main_~y~0 2)} is VALID [2022-04-28 09:26:25,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {642#(= main_~y~0 2)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {646#(= main_~y~0 4)} is VALID [2022-04-28 09:26:25,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {646#(= main_~y~0 4)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {650#(= main_~y~0 8)} is VALID [2022-04-28 09:26:25,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {650#(= main_~y~0 8)} assume !(~x~0 % 4294967296 < 6); {650#(= main_~y~0 8)} is VALID [2022-04-28 09:26:25,308 INFO L272 TraceCheckUtils]: 10: Hoare triple {650#(= main_~y~0 8)} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {657#(= 2 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:25,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {657#(= 2 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {661#(= 2 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:26:25,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {661#(= 2 __VERIFIER_assert_~cond)} assume 0 == ~cond; {611#false} is VALID [2022-04-28 09:26:25,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 09:26:25,309 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 09:26:25,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:29,696 WARN L833 $PredicateComparison]: unable to prove that (not (= (mod (mod (mod c_main_~y~0 4294967296) 3) 4294967296) 0)) is different from false [2022-04-28 09:26:36,239 WARN L833 $PredicateComparison]: unable to prove that (not (= (mod (mod (mod (* 2 c_main_~y~0) 4294967296) 3) 4294967296) 0)) is different from false [2022-04-28 09:26:40,588 WARN L833 $PredicateComparison]: unable to prove that (not (= (mod (mod (mod (* 4 c_main_~y~0) 4294967296) 3) 4294967296) 0)) is different from false [2022-04-28 09:26:44,949 WARN L833 $PredicateComparison]: unable to prove that (not (= (mod (mod (mod (* 8 c_main_~y~0) 4294967296) 3) 4294967296) 0)) is different from false [2022-04-28 09:26:44,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 09:26:44,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {671#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {611#false} is VALID [2022-04-28 09:26:44,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {675#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {671#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:44,978 INFO L272 TraceCheckUtils]: 10: Hoare triple {679#(not (= (mod (mod (mod main_~y~0 4294967296) 3) 4294967296) 0))} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:26:44,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#(not (= (mod (mod (mod main_~y~0 4294967296) 3) 4294967296) 0))} assume !(~x~0 % 4294967296 < 6); {679#(not (= (mod (mod (mod main_~y~0 4294967296) 3) 4294967296) 0))} is VALID [2022-04-28 09:26:47,148 WARN L290 TraceCheckUtils]: 8: Hoare triple {686#(not (= (mod (mod (mod (* main_~y~0 2) 4294967296) 3) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {679#(not (= (mod (mod (mod main_~y~0 4294967296) 3) 4294967296) 0))} is UNKNOWN [2022-04-28 09:26:49,314 WARN L290 TraceCheckUtils]: 7: Hoare triple {690#(not (= (mod (mod (mod (* main_~y~0 4) 4294967296) 3) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {686#(not (= (mod (mod (mod (* main_~y~0 2) 4294967296) 3) 4294967296) 0))} is UNKNOWN [2022-04-28 09:26:51,482 WARN L290 TraceCheckUtils]: 6: Hoare triple {694#(not (= (mod (mod (mod (* main_~y~0 8) 4294967296) 3) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {690#(not (= (mod (mod (mod (* main_~y~0 4) 4294967296) 3) 4294967296) 0))} is UNKNOWN [2022-04-28 09:26:51,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0;~y~0 := 1; {694#(not (= (mod (mod (mod (* main_~y~0 8) 4294967296) 3) 4294967296) 0))} is VALID [2022-04-28 09:26:51,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 09:26:51,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 09:26:51,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 09:26:51,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 09:26:51,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-28 09:26:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-04-28 09:26:51,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094916219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:51,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:51,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-04-28 09:26:51,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:51,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1701781253] [2022-04-28 09:26:51,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1701781253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:51,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:51,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:26:51,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323368223] [2022-04-28 09:26:51,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:51,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 09:26:51,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:51,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 09:26:51,502 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 09:26:51,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:26:51,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:51,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:26:51,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=182, Unknown=4, NotChecked=116, Total=342 [2022-04-28 09:26:51,504 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 09:26:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:51,762 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 09:26:51,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:26:51,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 09:26:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 09:26:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 09:26:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 09:26:51,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 09:26:51,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-28 09:26:51,787 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 09:26:51,788 INFO L225 Difference]: With dead ends: 21 [2022-04-28 09:26:51,788 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:26:51,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=62, Invalid=292, Unknown=4, NotChecked=148, Total=506 [2022-04-28 09:26:51,789 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:51,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:26:51,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:26:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 09:26:51,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:51,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 09:26:51,798 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 09:26:51,798 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 09:26:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:51,799 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:26:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:26:51,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:51,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:51,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 16 states. [2022-04-28 09:26:51,800 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 16 states. [2022-04-28 09:26:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:51,801 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:26:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:26:51,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:51,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:51,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:51,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 09:26:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 09:26:51,803 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 09:26:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:51,803 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 09:26:51,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 09:26:51,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 09:26:51,822 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 09:26:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:26:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:26:51,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:51,823 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:51,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 09:26:52,043 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 09:26:52,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:52,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-28 09:26:52,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:52,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488550007] [2022-04-28 09:26:52,053 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:52,053 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-28 09:26:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:52,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374698125] [2022-04-28 09:26:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:52,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {829#true} is VALID [2022-04-28 09:26:52,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#true} assume true; {829#true} is VALID [2022-04-28 09:26:52,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2022-04-28 09:26:52,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:52,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {829#true} is VALID [2022-04-28 09:26:52,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2022-04-28 09:26:52,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2022-04-28 09:26:52,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret5 := main(); {829#true} is VALID [2022-04-28 09:26:52,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#true} ~x~0 := 0;~y~0 := 1; {834#(= main_~x~0 0)} is VALID [2022-04-28 09:26:52,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:52,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:52,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:26:52,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {838#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:26:52,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {838#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {830#false} is VALID [2022-04-28 09:26:52,223 INFO L272 TraceCheckUtils]: 11: Hoare triple {830#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {830#false} is VALID [2022-04-28 09:26:52,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#false} ~cond := #in~cond; {830#false} is VALID [2022-04-28 09:26:52,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#false} assume 0 == ~cond; {830#false} is VALID [2022-04-28 09:26:52,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {830#false} assume !false; {830#false} is VALID [2022-04-28 09:26:52,223 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 09:26:52,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:52,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374698125] [2022-04-28 09:26:52,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374698125] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:52,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741999122] [2022-04-28 09:26:52,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:26:52,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:52,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:52,228 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 09:26:52,229 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 09:26:52,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:26:52,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:52,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 09:26:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:52,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:52,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2022-04-28 09:26:52,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {829#true} is VALID [2022-04-28 09:26:52,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2022-04-28 09:26:52,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2022-04-28 09:26:52,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret5 := main(); {829#true} is VALID [2022-04-28 09:26:52,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#true} ~x~0 := 0;~y~0 := 1; {834#(= main_~x~0 0)} is VALID [2022-04-28 09:26:52,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:52,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:52,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:26:52,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {870#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:26:52,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {870#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {830#false} is VALID [2022-04-28 09:26:52,556 INFO L272 TraceCheckUtils]: 11: Hoare triple {830#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {830#false} is VALID [2022-04-28 09:26:52,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#false} ~cond := #in~cond; {830#false} is VALID [2022-04-28 09:26:52,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#false} assume 0 == ~cond; {830#false} is VALID [2022-04-28 09:26:52,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {830#false} assume !false; {830#false} is VALID [2022-04-28 09:26:52,556 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 09:26:52,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:52,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {830#false} assume !false; {830#false} is VALID [2022-04-28 09:26:52,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#false} assume 0 == ~cond; {830#false} is VALID [2022-04-28 09:26:52,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#false} ~cond := #in~cond; {830#false} is VALID [2022-04-28 09:26:52,749 INFO L272 TraceCheckUtils]: 11: Hoare triple {830#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {830#false} is VALID [2022-04-28 09:26:52,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {898#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {830#false} is VALID [2022-04-28 09:26:52,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {902#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {898#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-28 09:26:52,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#(< (mod (+ main_~x~0 2) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {902#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-28 09:26:52,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {910#(< (mod (+ main_~x~0 3) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {906#(< (mod (+ main_~x~0 2) 4294967296) 6)} is VALID [2022-04-28 09:26:52,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {914#(< (mod (+ main_~x~0 4) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {910#(< (mod (+ main_~x~0 3) 4294967296) 6)} is VALID [2022-04-28 09:26:52,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#true} ~x~0 := 0;~y~0 := 1; {914#(< (mod (+ main_~x~0 4) 4294967296) 6)} is VALID [2022-04-28 09:26:52,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret5 := main(); {829#true} is VALID [2022-04-28 09:26:52,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2022-04-28 09:26:52,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2022-04-28 09:26:52,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {829#true} is VALID [2022-04-28 09:26:52,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2022-04-28 09:26:52,760 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 09:26:52,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741999122] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:52,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:52,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 09:26:52,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:52,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488550007] [2022-04-28 09:26:52,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488550007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:52,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:52,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:26:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098995409] [2022-04-28 09:26:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:52,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 09:26:52,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:52,762 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), 7 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 09:26:52,786 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 09:26:52,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:26:52,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:52,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:26:52,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:26:52,787 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 09:26:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:53,118 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 09:26:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:26:53,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 09:26:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 09:26:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 09:26:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 09:26:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 09:26:53,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-28 09:26:53,143 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 09:26:53,143 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:26:53,144 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:26:53,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:26:53,145 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:53,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:26:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:26:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 09:26:53,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:53,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:53,155 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:53,156 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:53,156 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:26:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:26:53,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:53,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:53,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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 09:26:53,157 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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 09:26:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:53,158 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:26:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:26:53,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:53,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:53,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:53,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 09:26:53,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 09:26:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:53,160 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 09:26:53,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 09:26:53,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 09:26:53,179 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 09:26:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:26:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:26:53,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:53,179 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:53,207 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 09:26:53,399 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 09:26:53,400 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-28 09:26:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:53,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1769793643] [2022-04-28 09:26:53,405 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:53,405 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-28 09:26:53,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:53,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824922565] [2022-04-28 09:26:53,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:53,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:53,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:53,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {1068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1057#true} is VALID [2022-04-28 09:26:53,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-28 09:26:53,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1057#true} {1057#true} #34#return; {1057#true} is VALID [2022-04-28 09:26:53,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {1057#true} call ULTIMATE.init(); {1068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:53,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1057#true} is VALID [2022-04-28 09:26:53,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-28 09:26:53,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1057#true} {1057#true} #34#return; {1057#true} is VALID [2022-04-28 09:26:53,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {1057#true} call #t~ret5 := main(); {1057#true} is VALID [2022-04-28 09:26:53,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {1057#true} ~x~0 := 0;~y~0 := 1; {1062#(= main_~x~0 0)} is VALID [2022-04-28 09:26:53,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {1062#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1063#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:53,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {1063#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1064#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:53,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {1064#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1065#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:26:53,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {1065#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1066#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:26:53,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {1066#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1067#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 09:26:53,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1058#false} is VALID [2022-04-28 09:26:53,603 INFO L272 TraceCheckUtils]: 12: Hoare triple {1058#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1058#false} is VALID [2022-04-28 09:26:53,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {1058#false} ~cond := #in~cond; {1058#false} is VALID [2022-04-28 09:26:53,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {1058#false} assume 0 == ~cond; {1058#false} is VALID [2022-04-28 09:26:53,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {1058#false} assume !false; {1058#false} is VALID [2022-04-28 09:26:53,604 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 09:26:53,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:53,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824922565] [2022-04-28 09:26:53,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824922565] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:53,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630951861] [2022-04-28 09:26:53,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:26:53,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:53,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:53,606 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 09:26:53,615 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 09:26:53,648 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:26:53,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:53,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 09:26:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:53,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:53,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {1057#true} call ULTIMATE.init(); {1057#true} is VALID [2022-04-28 09:26:53,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {1057#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1057#true} is VALID [2022-04-28 09:26:53,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-28 09:26:53,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1057#true} {1057#true} #34#return; {1057#true} is VALID [2022-04-28 09:26:53,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {1057#true} call #t~ret5 := main(); {1057#true} is VALID [2022-04-28 09:26:53,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {1057#true} ~x~0 := 0;~y~0 := 1; {1062#(= main_~x~0 0)} is VALID [2022-04-28 09:26:53,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {1062#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1063#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:53,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {1063#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1064#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:53,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {1064#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1065#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:26:53,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {1065#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1066#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:26:53,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {1066#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1102#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:26:53,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {1102#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1058#false} is VALID [2022-04-28 09:26:53,918 INFO L272 TraceCheckUtils]: 12: Hoare triple {1058#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1058#false} is VALID [2022-04-28 09:26:53,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {1058#false} ~cond := #in~cond; {1058#false} is VALID [2022-04-28 09:26:53,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {1058#false} assume 0 == ~cond; {1058#false} is VALID [2022-04-28 09:26:53,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {1058#false} assume !false; {1058#false} is VALID [2022-04-28 09:26:53,919 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 09:26:53,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:54,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {1058#false} assume !false; {1058#false} is VALID [2022-04-28 09:26:54,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {1058#false} assume 0 == ~cond; {1058#false} is VALID [2022-04-28 09:26:54,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {1058#false} ~cond := #in~cond; {1058#false} is VALID [2022-04-28 09:26:54,140 INFO L272 TraceCheckUtils]: 12: Hoare triple {1058#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1058#false} is VALID [2022-04-28 09:26:54,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {1130#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {1058#false} is VALID [2022-04-28 09:26:54,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {1134#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1130#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-28 09:26:54,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {1138#(< (mod (+ main_~x~0 2) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1134#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-28 09:26:54,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(< (mod (+ main_~x~0 3) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1138#(< (mod (+ main_~x~0 2) 4294967296) 6)} is VALID [2022-04-28 09:26:54,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {1146#(< (mod (+ main_~x~0 4) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1142#(< (mod (+ main_~x~0 3) 4294967296) 6)} is VALID [2022-04-28 09:26:54,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#(< (mod (+ 5 main_~x~0) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1146#(< (mod (+ main_~x~0 4) 4294967296) 6)} is VALID [2022-04-28 09:26:54,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {1057#true} ~x~0 := 0;~y~0 := 1; {1150#(< (mod (+ 5 main_~x~0) 4294967296) 6)} is VALID [2022-04-28 09:26:54,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {1057#true} call #t~ret5 := main(); {1057#true} is VALID [2022-04-28 09:26:54,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1057#true} {1057#true} #34#return; {1057#true} is VALID [2022-04-28 09:26:54,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-28 09:26:54,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1057#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1057#true} is VALID [2022-04-28 09:26:54,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {1057#true} call ULTIMATE.init(); {1057#true} is VALID [2022-04-28 09:26:54,148 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 09:26:54,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630951861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:54,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:54,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 09:26:54,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:54,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1769793643] [2022-04-28 09:26:54,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1769793643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:54,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:54,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:26:54,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302100263] [2022-04-28 09:26:54,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:54,150 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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 09:26:54,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:54,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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 09:26:54,164 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 09:26:54,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:26:54,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:54,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:26:54,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:26:54,165 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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 09:26:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:54,587 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 09:26:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:26:54,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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 09:26:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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 09:26:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 09:26:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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 09:26:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 09:26:54,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-28 09:26:54,616 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 09:26:54,617 INFO L225 Difference]: With dead ends: 23 [2022-04-28 09:26:54,617 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 09:26:54,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:26:54,618 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:54,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:26:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 09:26:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 09:26:54,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:54,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:54,630 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:54,630 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:54,631 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:26:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:26:54,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:54,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:54,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 09:26:54,632 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 09:26:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:54,633 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:26:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:26:54,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:54,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:54,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:54,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 09:26:54,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-28 09:26:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:54,635 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 09:26:54,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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 09:26:54,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 09:26:54,655 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 09:26:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:26:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:26:54,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:54,655 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:54,682 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 09:26:54,867 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 09:26:54,868 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-28 09:26:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:54,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1654361785] [2022-04-28 09:26:54,871 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:54,872 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-28 09:26:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:54,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666962462] [2022-04-28 09:26:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:54,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:57,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:57,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {1315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1301#true} is VALID [2022-04-28 09:26:57,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {1301#true} assume true; {1301#true} is VALID [2022-04-28 09:26:57,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1301#true} {1301#true} #34#return; {1301#true} is VALID [2022-04-28 09:26:57,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {1301#true} call ULTIMATE.init(); {1315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:57,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1301#true} is VALID [2022-04-28 09:26:57,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {1301#true} assume true; {1301#true} is VALID [2022-04-28 09:26:57,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1301#true} {1301#true} #34#return; {1301#true} is VALID [2022-04-28 09:26:57,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {1301#true} call #t~ret5 := main(); {1301#true} is VALID [2022-04-28 09:26:57,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {1301#true} ~x~0 := 0;~y~0 := 1; {1306#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-28 09:26:57,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#(= (+ (- 1) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1307#(<= (* (div (+ (* 44739243 main_~y~0) 178956969) 134217728) 134217728) (+ (* 44739243 main_~y~0) 44739242))} is VALID [2022-04-28 09:26:57,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {1307#(<= (* (div (+ (* 44739243 main_~y~0) 178956969) 134217728) 134217728) (+ (* 44739243 main_~y~0) 44739242))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1308#(<= (+ (* 89478485 main_~y~0) (* (div (+ (* (- 89478485) main_~y~0) 357913939) 268435456) 268435456)) 89478484)} is VALID [2022-04-28 09:26:57,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#(<= (+ (* 89478485 main_~y~0) (* (div (+ (* (- 89478485) main_~y~0) 357913939) 268435456) 268435456)) 89478484)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1309#(<= (* (div (+ 715827879 (* main_~y~0 178956971)) 536870912) 536870912) (+ (* main_~y~0 178956971) 178956968))} is VALID [2022-04-28 09:26:57,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {1309#(<= (* (div (+ 715827879 (* main_~y~0 178956971)) 536870912) 536870912) (+ (* main_~y~0 178956971) 178956968))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1310#(<= (+ (* 1073741824 (div (+ (* main_~y~0 (- 357913941)) 1431655759) 1073741824)) (* main_~y~0 357913941)) 357913936)} is VALID [2022-04-28 09:26:59,800 WARN L290 TraceCheckUtils]: 10: Hoare triple {1310#(<= (+ (* 1073741824 (div (+ (* main_~y~0 (- 357913941)) 1431655759) 1073741824)) (* main_~y~0 357913941)) 357913936)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1311#(<= (* (div (+ 2863311519 (* 715827883 main_~y~0)) 2147483648) 2147483648) (+ (* 715827883 main_~y~0) 715827872))} is UNKNOWN [2022-04-28 09:26:59,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {1311#(<= (* (div (+ 2863311519 (* 715827883 main_~y~0)) 2147483648) 2147483648) (+ (* 715827883 main_~y~0) 715827872))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1312#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} is VALID [2022-04-28 09:26:59,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {1312#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} assume !(~x~0 % 4294967296 < 6); {1312#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} is VALID [2022-04-28 09:26:59,843 INFO L272 TraceCheckUtils]: 13: Hoare triple {1312#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1313#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:26:59,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {1313#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1314#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:59,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {1314#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1302#false} is VALID [2022-04-28 09:26:59,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {1302#false} assume !false; {1302#false} is VALID [2022-04-28 09:26:59,844 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 09:26:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:59,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666962462] [2022-04-28 09:26:59,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666962462] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:59,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538053984] [2022-04-28 09:26:59,845 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:26:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:59,851 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 09:26:59,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process