/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-lit/jm2006_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:32:09,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:32:09,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:32:09,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:32:09,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:32:09,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:32:09,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:32:09,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:32:09,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:32:09,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:32:09,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:32:09,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:32:09,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:32:09,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:32:09,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:32:09,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:32:09,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:32:09,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:32:09,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:32:09,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:32:09,624 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:32:09,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:32:09,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:32:09,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:32:09,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:32:09,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:32:09,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:32:09,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:32:09,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:32:09,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:32:09,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:32:09,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:32:09,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:32:09,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:32:09,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:32:09,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:32:09,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:32:09,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:32:09,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:32:09,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:32:09,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:32:09,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:32:09,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:32:09,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:32:09,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:32:09,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:32:09,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:32:09,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:32:09,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:32:09,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:32:09,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:32:09,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:32:09,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:32:09,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:32:09,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:32:09,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:32:09,651 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:32:09,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:32:09,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:09,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:32:09,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:32:09,651 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:32:09,651 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:32:09,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:32:09,651 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:32:09,652 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-15 12:32:09,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:32:09,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:32:09,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:32:09,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:32:09,867 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:32:09,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-15 12:32:09,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e910bdc8a/82e7500c19e64c279bcb6bd44b59edf8/FLAGb5388f2b8 [2022-04-15 12:32:10,296 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:32:10,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-15 12:32:10,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e910bdc8a/82e7500c19e64c279bcb6bd44b59edf8/FLAGb5388f2b8 [2022-04-15 12:32:10,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e910bdc8a/82e7500c19e64c279bcb6bd44b59edf8 [2022-04-15 12:32:10,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:32:10,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:32:10,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:10,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:32:10,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:32:10,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:10" (1/1) ... [2022-04-15 12:32:10,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449ad30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10, skipping insertion in model container [2022-04-15 12:32:10,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:10" (1/1) ... [2022-04-15 12:32:10,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:32:10,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:32:10,485 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-lit/jm2006_variant.i[895,908] [2022-04-15 12:32:10,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:10,515 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:32:10,526 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-lit/jm2006_variant.i[895,908] [2022-04-15 12:32:10,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:10,542 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:32:10,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10 WrapperNode [2022-04-15 12:32:10,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:10,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:32:10,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:32:10,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:32:10,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10" (1/1) ... [2022-04-15 12:32:10,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10" (1/1) ... [2022-04-15 12:32:10,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10" (1/1) ... [2022-04-15 12:32:10,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10" (1/1) ... [2022-04-15 12:32:10,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10" (1/1) ... [2022-04-15 12:32:10,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10" (1/1) ... [2022-04-15 12:32:10,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10" (1/1) ... [2022-04-15 12:32:10,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:32:10,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:32:10,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:32:10,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:32:10,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10" (1/1) ... [2022-04-15 12:32:10,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:10,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:10,604 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-15 12:32:10,627 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-15 12:32:10,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:32:10,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:32:10,637 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:32:10,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:32:10,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:32:10,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:32:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:32:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:32:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:32:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:32:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:32:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:32:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:32:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:32:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:32:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:32:10,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:32:10,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:32:10,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:32:10,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:32:10,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:32:10,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:32:10,700 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:32:10,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:32:10,791 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:32:10,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:32:10,796 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:32:10,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:10 BoogieIcfgContainer [2022-04-15 12:32:10,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:32:10,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:32:10,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:32:10,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:32:10,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:10" (1/3) ... [2022-04-15 12:32:10,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@beb3d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:10, skipping insertion in model container [2022-04-15 12:32:10,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:10" (2/3) ... [2022-04-15 12:32:10,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@beb3d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:10, skipping insertion in model container [2022-04-15 12:32:10,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:10" (3/3) ... [2022-04-15 12:32:10,802 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006_variant.i [2022-04-15 12:32:10,805 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:32:10,806 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:32:10,833 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:32:10,837 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:32:10,837 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:32:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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-15 12:32:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:32:10,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:10,880 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:10,880 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:10,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash -522767122, now seen corresponding path program 1 times [2022-04-15 12:32:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:10,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1051432524] [2022-04-15 12:32:10,902 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash -522767122, now seen corresponding path program 2 times [2022-04-15 12:32:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:10,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171696037] [2022-04-15 12:32:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:11,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:11,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-15 12:32:11,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:32:11,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-15 12:32:11,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:11,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-15 12:32:11,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:32:11,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-15 12:32:11,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-15 12:32:11,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {25#true} is VALID [2022-04-15 12:32:11,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {25#true} is VALID [2022-04-15 12:32:11,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {25#true} is VALID [2022-04-15 12:32:11,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 12:32:11,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume ~i~0 == ~j~0; {26#false} is VALID [2022-04-15 12:32:11,106 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {26#false} is VALID [2022-04-15 12:32:11,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 12:32:11,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 12:32:11,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 12:32:11,107 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-15 12:32:11,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:11,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171696037] [2022-04-15 12:32:11,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171696037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:11,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:11,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:32:11,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:11,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1051432524] [2022-04-15 12:32:11,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1051432524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:11,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:11,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:32:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631513082] [2022-04-15 12:32:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:11,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-15 12:32:11,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:11,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-15 12:32:11,144 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-15 12:32:11,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:32:11,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:11,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:32:11,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:32:11,163 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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 3.3333333333333335) internal successors, (10), 2 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-15 12:32:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:11,243 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 12:32:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:32:11,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-15 12:32:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-15 12:32:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 12:32:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-15 12:32:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 12:32:11,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-15 12:32:11,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:11,319 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:32:11,320 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:32:11,322 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:32:11,326 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 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-15 12:32:11,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:32:11,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:32:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:32:11,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:11,353 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-15 12:32:11,353 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-15 12:32:11,353 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-15 12:32:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:11,357 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:32:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:32:11,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:11,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:11,358 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-15 12:32:11,359 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-15 12:32:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:11,361 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:32:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:32:11,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:11,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:11,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:11,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:11,362 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-15 12:32:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 12:32:11,369 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 14 [2022-04-15 12:32:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:11,370 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 12:32:11,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-15 12:32:11,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 12:32:11,395 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-15 12:32:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:32:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:32:11,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:11,396 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:11,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:32:11,396 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:11,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash -637283726, now seen corresponding path program 1 times [2022-04-15 12:32:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:11,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1587446717] [2022-04-15 12:32:11,398 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:11,398 INFO L85 PathProgramCache]: Analyzing trace with hash -637283726, now seen corresponding path program 2 times [2022-04-15 12:32:11,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:11,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749200254] [2022-04-15 12:32:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:11,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:11,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {163#true} is VALID [2022-04-15 12:32:11,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-15 12:32:11,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #64#return; {163#true} is VALID [2022-04-15 12:32:11,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:11,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {163#true} is VALID [2022-04-15 12:32:11,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-15 12:32:11,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #64#return; {163#true} is VALID [2022-04-15 12:32:11,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret5 := main(); {163#true} is VALID [2022-04-15 12:32:11,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {163#true} is VALID [2022-04-15 12:32:11,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {163#true} is VALID [2022-04-15 12:32:11,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {168#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} is VALID [2022-04-15 12:32:11,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {168#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} assume !(0 != ~x~0); {169#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 12:32:11,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} assume ~i~0 == ~j~0; {170#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 12:32:11,638 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:11,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {172#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:11,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {164#false} is VALID [2022-04-15 12:32:11,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-15 12:32:11,639 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-15 12:32:11,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:11,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749200254] [2022-04-15 12:32:11,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749200254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:11,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:11,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:32:11,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:11,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1587446717] [2022-04-15 12:32:11,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1587446717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:11,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:11,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:32:11,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642532361] [2022-04-15 12:32:11,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:11,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 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-15 12:32:11,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:11,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 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-15 12:32:11,652 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-15 12:32:11,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:32:11,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:32:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:32:11,654 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 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-15 12:32:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:11,866 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:32:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:32:11,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 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-15 12:32:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 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-15 12:32:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:32:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 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-15 12:32:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:32:11,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 12:32:11,888 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-15 12:32:11,889 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:32:11,890 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:32:11,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:32:11,892 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:11,893 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:32:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:32:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 12:32:11,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:11,902 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-15 12:32:11,904 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-15 12:32:11,904 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-15 12:32:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:11,905 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:32:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:32:11,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:11,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:11,906 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-15 12:32:11,906 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-15 12:32:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:11,907 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:32:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:32:11,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:11,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:11,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:11,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:11,908 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-15 12:32:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 12:32:11,909 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 12:32:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:11,910 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 12:32:11,910 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 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-15 12:32:11,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 12:32:11,921 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-15 12:32:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:32:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:32:11,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:11,922 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:11,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:32:11,923 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:11,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:11,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1050868340, now seen corresponding path program 1 times [2022-04-15 12:32:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:11,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1546413558] [2022-04-15 12:32:37,432 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1893771691, now seen corresponding path program 1 times [2022-04-15 12:32:37,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:37,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495935056] [2022-04-15 12:32:37,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:37,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:37,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {294#true} is VALID [2022-04-15 12:32:37,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-15 12:32:37,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-15 12:32:37,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:37,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {294#true} is VALID [2022-04-15 12:32:37,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-15 12:32:37,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-15 12:32:37,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret5 := main(); {294#true} is VALID [2022-04-15 12:32:37,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {294#true} is VALID [2022-04-15 12:32:37,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {299#(or (< 0 main_~i~0) (= main_~i~0 0))} is VALID [2022-04-15 12:32:37,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {299#(or (< 0 main_~i~0) (= main_~i~0 0))} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {300#(and (= main_~z~0 0) (or (and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0))) (not (= main_~x~0 0))) (or (not (= main_~y~0 0)) (= main_~x~0 0) (and (<= main_~j~0 main_~y~0) (< 0 main_~i~0))))} is VALID [2022-04-15 12:32:37,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(and (= main_~z~0 0) (or (and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0))) (not (= main_~x~0 0))) (or (not (= main_~y~0 0)) (= main_~x~0 0) (and (<= main_~j~0 main_~y~0) (< 0 main_~i~0))))} [68] L33-2-->L33-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_1 v_main_~y~0_Out_2))) (or (and (= (+ v_main_~x~0_Out_2 v_main_~z~0_Out_2) (+ v_main_~z~0_In_1 v_main_~x~0_In_1)) .cse0 (= |v_main_#t~post3_Out_2| 0) (= (+ (* (- 2) v_main_~x~0_In_1) |v_main_#t~post4_Out_2|) (+ (* v_main_~x~0_Out_2 (- 2)) |v_main_#t~post4_Out_2|)) (<= v_main_~x~0_Out_2 v_main_~x~0_In_1) (= v_main_~y~0_Out_2 0) (not (= (+ v_main_~x~0_Out_2 1) 0))) (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) .cse0 (= v_main_~x~0_In_1 v_main_~x~0_Out_2)))) InVars {main_~y~0=v_main_~y~0_In_1, main_~x~0=v_main_~x~0_In_1, main_~z~0=v_main_~z~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~y~0=v_main_~y~0_Out_2, main_#t~post3=|v_main_#t~post3_Out_2|, main_~x~0=v_main_~x~0_Out_2, main_~z~0=v_main_~z~0_Out_2} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {301#(or (and (<= main_~z~0 0) (or (<= (+ main_~j~0 1) main_~i~0) (<= 1 main_~x~0) (<= (+ main_~x~0 1) 0) (<= (+ main_~i~0 1) main_~j~0)) (< 0 (+ main_~z~0 1))) (and (or (= main_~y~0 (* (- 1) main_~z~0)) (not (= (* (- 1) main_~z~0) 0))) (or (and (or (<= main_~z~0 0) (<= (+ main_~z~0 main_~x~0) 0)) (or (<= 0 (+ main_~z~0 main_~x~0)) (< 0 (+ main_~z~0 1)))) (and (< 0 main_~i~0) (<= main_~j~0 0)))))} is VALID [2022-04-15 12:32:37,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#(or (and (<= main_~z~0 0) (or (<= (+ main_~j~0 1) main_~i~0) (<= 1 main_~x~0) (<= (+ main_~x~0 1) 0) (<= (+ main_~i~0 1) main_~j~0)) (< 0 (+ main_~z~0 1))) (and (or (= main_~y~0 (* (- 1) main_~z~0)) (not (= (* (- 1) main_~z~0) 0))) (or (and (or (<= main_~z~0 0) (<= (+ main_~z~0 main_~x~0) 0)) (or (<= 0 (+ main_~z~0 main_~x~0)) (< 0 (+ main_~z~0 1)))) (and (< 0 main_~i~0) (<= main_~j~0 0)))))} [67] L33-3_primed-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {302#(or (and (<= main_~z~0 0) (or (<= (+ main_~j~0 1) main_~i~0) (<= (+ main_~i~0 1) main_~j~0)) (< 0 (+ main_~z~0 1))) (and (or (= main_~y~0 (* (- 1) main_~z~0)) (not (= (* (- 1) main_~z~0) 0))) (or (and (< 0 main_~i~0) (<= main_~j~0 0)) (and (<= main_~z~0 0) (< 0 (+ main_~z~0 1))))))} is VALID [2022-04-15 12:32:37,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {302#(or (and (<= main_~z~0 0) (or (<= (+ main_~j~0 1) main_~i~0) (<= (+ main_~i~0 1) main_~j~0)) (< 0 (+ main_~z~0 1))) (and (or (= main_~y~0 (* (- 1) main_~z~0)) (not (= (* (- 1) main_~z~0) 0))) (or (and (< 0 main_~i~0) (<= main_~j~0 0)) (and (<= main_~z~0 0) (< 0 (+ main_~z~0 1))))))} assume ~i~0 == ~j~0; {303#(and (<= main_~z~0 0) (= main_~y~0 (* (- 1) main_~z~0)) (< 0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:32:37,828 INFO L272 TraceCheckUtils]: 11: Hoare triple {303#(and (<= main_~z~0 0) (= main_~y~0 (* (- 1) main_~z~0)) (< 0 (+ main_~z~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:37,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {304#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {305#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:37,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {295#false} is VALID [2022-04-15 12:32:37,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-15 12:32:37,829 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-15 12:32:37,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:37,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495935056] [2022-04-15 12:32:37,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495935056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:37,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:37,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:32:37,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:37,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1546413558] [2022-04-15 12:32:37,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1546413558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:37,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:37,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:32:37,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709570602] [2022-04-15 12:32:37,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:37,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-15 12:32:37,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:37,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-15 12:32:37,901 WARN L143 InductivityCheck]: Transition 307#(and (not (= (+ main_~x~0 1) 0)) (= (+ (- 1) main_~z~0) 0) (or (not (= (+ main_~y~0 2) 0)) (and (< 0 main_~i~0) (<= main_~j~0 (+ main_~y~0 2))))) ( _ , assume !(0 != ~x~0); , 302#(or (and (<= main_~z~0 0) (or (<= (+ main_~j~0 1) main_~i~0) (<= (+ main_~i~0 1) main_~j~0)) (< 0 (+ main_~z~0 1))) (and (or (= main_~y~0 (* (- 1) main_~z~0)) (not (= (* (- 1) main_~z~0) 0))) (or (and (< 0 main_~i~0) (<= main_~j~0 0)) (and (<= main_~z~0 0) (< 0 (+ main_~z~0 1)))))) ) not inductive [2022-04-15 12:32:37,901 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:32:37,901 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:32:37,904 INFO L158 Benchmark]: Toolchain (without parser) took 27582.62ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 139.7MB in the beginning and 132.9MB in the end (delta: 6.8MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. [2022-04-15 12:32:37,904 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory was 155.8MB in the beginning and 155.7MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:32:37,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.60ms. Allocated memory is still 186.6MB. Free memory was 139.5MB in the beginning and 165.4MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:32:37,905 INFO L158 Benchmark]: Boogie Preprocessor took 38.55ms. Allocated memory is still 186.6MB. Free memory was 165.4MB in the beginning and 163.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:32:37,905 INFO L158 Benchmark]: RCFGBuilder took 214.76ms. Allocated memory is still 186.6MB. Free memory was 163.8MB in the beginning and 151.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:32:37,905 INFO L158 Benchmark]: TraceAbstraction took 27104.61ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 151.2MB in the beginning and 132.9MB in the end (delta: 18.3MB). Peak memory consumption was 72.8MB. Max. memory is 8.0GB. [2022-04-15 12:32:37,906 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory was 155.8MB in the beginning and 155.7MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.60ms. Allocated memory is still 186.6MB. Free memory was 139.5MB in the beginning and 165.4MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.55ms. Allocated memory is still 186.6MB. Free memory was 165.4MB in the beginning and 163.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 214.76ms. Allocated memory is still 186.6MB. Free memory was 163.8MB in the beginning and 151.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 27104.61ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 151.2MB in the beginning and 132.9MB in the end (delta: 18.3MB). Peak memory consumption was 72.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:32:37,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...