/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 09:09:03,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 09:09:03,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 09:09:03,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 09:09:03,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 09:09:03,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 09:09:03,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 09:09:03,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 09:09:03,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 09:09:03,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 09:09:03,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 09:09:03,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 09:09:03,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 09:09:03,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 09:09:03,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 09:09:03,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 09:09:03,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 09:09:03,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 09:09:03,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 09:09:03,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 09:09:03,590 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 09:09:03,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 09:09:03,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 09:09:03,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 09:09:03,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 09:09:03,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 09:09:03,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 09:09:03,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 09:09:03,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 09:09:03,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 09:09:03,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 09:09:03,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 09:09:03,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 09:09:03,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 09:09:03,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 09:09:03,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 09:09:03,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 09:09:03,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 09:09:03,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 09:09:03,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 09:09:03,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 09:09:03,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 09:09:03,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 09:09:03,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 09:09:03,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 09:09:03,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 09:09:03,617 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 09:09:03,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 09:09:03,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 09:09:03,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 09:09:03,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 09:09:03,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 09:09:03,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 09:09:03,618 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 09:09:03,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 09:09:03,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 09:09:03,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 09:09:03,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 09:09:03,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 09:09:03,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 09:09:03,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 09:09:03,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:09:03,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 09:09:03,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 09:09:03,619 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 09:09:03,620 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 09:09:03,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 09:09:03,620 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 09:09:03,620 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 09:09:03,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 09:09:03,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 09:09:03,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 09:09:03,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 09:09:03,855 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 09:09:03,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound10.c [2022-04-15 09:09:03,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed5e69d4/c5f18c8d22114ffebb82be41f9e9b58f/FLAG1e37278d8 [2022-04-15 09:09:04,295 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 09:09:04,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound10.c [2022-04-15 09:09:04,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed5e69d4/c5f18c8d22114ffebb82be41f9e9b58f/FLAG1e37278d8 [2022-04-15 09:09:04,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed5e69d4/c5f18c8d22114ffebb82be41f9e9b58f [2022-04-15 09:09:04,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 09:09:04,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 09:09:04,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 09:09:04,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 09:09:04,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 09:09:04,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:09:04" (1/1) ... [2022-04-15 09:09:04,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7c3a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04, skipping insertion in model container [2022-04-15 09:09:04,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:09:04" (1/1) ... [2022-04-15 09:09:04,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 09:09:04,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 09:09:04,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound10.c[546,559] [2022-04-15 09:09:04,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:09:04,495 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 09:09:04,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound10.c[546,559] [2022-04-15 09:09:04,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:09:04,528 INFO L208 MainTranslator]: Completed translation [2022-04-15 09:09:04,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04 WrapperNode [2022-04-15 09:09:04,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 09:09:04,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 09:09:04,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 09:09:04,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 09:09:04,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04" (1/1) ... [2022-04-15 09:09:04,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04" (1/1) ... [2022-04-15 09:09:04,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04" (1/1) ... [2022-04-15 09:09:04,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04" (1/1) ... [2022-04-15 09:09:04,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04" (1/1) ... [2022-04-15 09:09:04,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04" (1/1) ... [2022-04-15 09:09:04,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04" (1/1) ... [2022-04-15 09:09:04,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 09:09:04,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 09:09:04,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 09:09:04,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 09:09:04,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04" (1/1) ... [2022-04-15 09:09:04,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:09:04,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:09:04,583 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 09:09:04,591 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 09:09:04,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 09:09:04,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 09:09:04,612 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 09:09:04,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 09:09:04,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 09:09:04,612 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 09:09:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 09:09:04,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 09:09:04,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 09:09:04,661 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 09:09:04,662 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 09:09:04,817 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 09:09:04,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 09:09:04,825 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 09:09:04,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:09:04 BoogieIcfgContainer [2022-04-15 09:09:04,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 09:09:04,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 09:09:04,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 09:09:04,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 09:09:04,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 09:09:04" (1/3) ... [2022-04-15 09:09:04,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db63c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:09:04, skipping insertion in model container [2022-04-15 09:09:04,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:04" (2/3) ... [2022-04-15 09:09:04,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db63c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:09:04, skipping insertion in model container [2022-04-15 09:09:04,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:09:04" (3/3) ... [2022-04-15 09:09:04,840 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound10.c [2022-04-15 09:09:04,843 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 09:09:04,843 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 09:09:04,878 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 09:09:04,883 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 09:09:04,884 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 09:09:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:09:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 09:09:04,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:09:04,904 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:09:04,905 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:09:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:09:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash 774216096, now seen corresponding path program 1 times [2022-04-15 09:09:04,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:04,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [550339296] [2022-04-15 09:09:04,925 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:09:04,925 INFO L85 PathProgramCache]: Analyzing trace with hash 774216096, now seen corresponding path program 2 times [2022-04-15 09:09:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:09:04,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76076761] [2022-04-15 09:09:04,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:09:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:09:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:05,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:09:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:05,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-15 09:09:05,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 09:09:05,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #68#return; {35#true} is VALID [2022-04-15 09:09:05,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 09:09:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:05,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 09:09:05,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 09:09:05,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 09:09:05,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #56#return; {36#false} is VALID [2022-04-15 09:09:05,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 09:09:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:05,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 09:09:05,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 09:09:05,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 09:09:05,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #58#return; {36#false} is VALID [2022-04-15 09:09:05,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 09:09:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:05,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 09:09:05,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 09:09:05,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 09:09:05,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #60#return; {36#false} is VALID [2022-04-15 09:09:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 09:09:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:05,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 09:09:05,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 09:09:05,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 09:09:05,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #62#return; {36#false} is VALID [2022-04-15 09:09:05,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 09:09:05,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-15 09:09:05,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 09:09:05,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #68#return; {35#true} is VALID [2022-04-15 09:09:05,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-15 09:09:05,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-15 09:09:05,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-15 09:09:05,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 09:09:05,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 09:09:05,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 09:09:05,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #56#return; {36#false} is VALID [2022-04-15 09:09:05,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-15 09:09:05,126 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-15 09:09:05,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 09:09:05,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 09:09:05,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 09:09:05,128 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #58#return; {36#false} is VALID [2022-04-15 09:09:05,128 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-15 09:09:05,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 09:09:05,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 09:09:05,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 09:09:05,129 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #60#return; {36#false} is VALID [2022-04-15 09:09:05,129 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#false} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-15 09:09:05,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 09:09:05,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 09:09:05,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 09:09:05,130 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} #62#return; {36#false} is VALID [2022-04-15 09:09:05,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {36#false} is VALID [2022-04-15 09:09:05,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-15 09:09:05,131 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {36#false} is VALID [2022-04-15 09:09:05,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-15 09:09:05,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-15 09:09:05,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-15 09:09:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 09:09:05,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:09:05,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76076761] [2022-04-15 09:09:05,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76076761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:05,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:05,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 09:09:05,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:09:05,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [550339296] [2022-04-15 09:09:05,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [550339296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:05,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:05,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 09:09:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912149138] [2022-04-15 09:09:05,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:09:05,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 09:09:05,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:09:05,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:09:05,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:05,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 09:09:05,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:05,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 09:09:05,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 09:09:05,194 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:09:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:05,307 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-15 09:09:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 09:09:05,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 09:09:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:09:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:09:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-15 09:09:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:09:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-15 09:09:05,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-04-15 09:09:05,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:05,427 INFO L225 Difference]: With dead ends: 57 [2022-04-15 09:09:05,428 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 09:09:05,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 09:09:05,436 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:09:05,437 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:09:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 09:09:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 09:09:05,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:09:05,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 09:09:05,465 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 09:09:05,466 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 09:09:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:05,473 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 09:09:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 09:09:05,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:05,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:05,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-15 09:09:05,475 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-15 09:09:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:05,478 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 09:09:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 09:09:05,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:05,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:05,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:09:05,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:09:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 09:09:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 09:09:05,483 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2022-04-15 09:09:05,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:09:05,483 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 09:09:05,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:09:05,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-15 09:09:05,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 09:09:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 09:09:05,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:09:05,517 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:09:05,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 09:09:05,518 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:09:05,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:09:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1105237916, now seen corresponding path program 1 times [2022-04-15 09:09:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:05,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1582928393] [2022-04-15 09:09:05,520 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:09:05,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1105237916, now seen corresponding path program 2 times [2022-04-15 09:09:05,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:09:05,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261089349] [2022-04-15 09:09:05,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:09:05,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:09:05,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:09:05,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056838474] [2022-04-15 09:09:05,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:09:05,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:09:05,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:09:05,552 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-15 09:09:05,553 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-15 09:09:05,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:09:05,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:09:05,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:09:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:05,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:09:05,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2022-04-15 09:09:05,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 09:09:05,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 09:09:05,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #68#return; {281#true} is VALID [2022-04-15 09:09:05,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-15 09:09:05,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {281#true} is VALID [2022-04-15 09:09:05,774 INFO L272 TraceCheckUtils]: 6: Hoare triple {281#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {281#true} is VALID [2022-04-15 09:09:05,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-15 09:09:05,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-15 09:09:05,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 09:09:05,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {281#true} {281#true} #56#return; {281#true} is VALID [2022-04-15 09:09:05,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {281#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {281#true} is VALID [2022-04-15 09:09:05,775 INFO L272 TraceCheckUtils]: 12: Hoare triple {281#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {281#true} is VALID [2022-04-15 09:09:05,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-15 09:09:05,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-15 09:09:05,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 09:09:05,776 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {281#true} {281#true} #58#return; {281#true} is VALID [2022-04-15 09:09:05,776 INFO L272 TraceCheckUtils]: 17: Hoare triple {281#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {281#true} is VALID [2022-04-15 09:09:05,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-15 09:09:05,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-15 09:09:05,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 09:09:05,777 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {281#true} {281#true} #60#return; {281#true} is VALID [2022-04-15 09:09:05,777 INFO L272 TraceCheckUtils]: 22: Hoare triple {281#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {281#true} is VALID [2022-04-15 09:09:05,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-15 09:09:05,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-15 09:09:05,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 09:09:05,778 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {281#true} {281#true} #62#return; {281#true} is VALID [2022-04-15 09:09:05,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {281#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {367#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-15 09:09:05,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {367#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} assume !false; {367#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-15 09:09:05,780 INFO L272 TraceCheckUtils]: 29: Hoare triple {367#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:09:05,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:09:05,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {282#false} is VALID [2022-04-15 09:09:05,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-15 09:09:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 09:09:05,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:09:05,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:09:05,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261089349] [2022-04-15 09:09:05,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:09:05,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056838474] [2022-04-15 09:09:05,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056838474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:05,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:05,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:09:05,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:09:05,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1582928393] [2022-04-15 09:09:05,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1582928393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:05,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:05,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:09:05,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407757346] [2022-04-15 09:09:05,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:09:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 09:09:05,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:09:05,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 09:09:05,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:05,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:09:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:05,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:09:05,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:09:05,838 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 09:09:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:05,997 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 09:09:05,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:09:05,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 09:09:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:09:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 09:09:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-15 09:09:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 09:09:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-15 09:09:06,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-15 09:09:06,050 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 09:09:06,053 INFO L225 Difference]: With dead ends: 37 [2022-04-15 09:09:06,053 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 09:09:06,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:09:06,056 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:09:06,060 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:09:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 09:09:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-15 09:09:06,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:09:06,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 09:09:06,087 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 09:09:06,088 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 09:09:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:06,091 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 09:09:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 09:09:06,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:06,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:06,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-15 09:09:06,095 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-15 09:09:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:06,102 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 09:09:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 09:09:06,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:06,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:06,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:09:06,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:09:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 09:09:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-15 09:09:06,105 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 33 [2022-04-15 09:09:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:09:06,106 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-15 09:09:06,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 09:09:06,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-15 09:09:06,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 09:09:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 09:09:06,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:09:06,154 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:09:06,180 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-15 09:09:06,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:09:06,360 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:09:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:09:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1493430927, now seen corresponding path program 1 times [2022-04-15 09:09:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:06,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [217905352] [2022-04-15 09:09:06,362 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:09:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1493430927, now seen corresponding path program 2 times [2022-04-15 09:09:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:09:06,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827272939] [2022-04-15 09:09:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:09:06,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:09:06,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:09:06,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [192718689] [2022-04-15 09:09:06,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:09:06,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:09:06,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:09:06,388 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-15 09:09:06,389 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-15 09:09:06,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:09:06,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:09:06,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 09:09:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:06,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:09:10,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {596#true} call ULTIMATE.init(); {596#true} is VALID [2022-04-15 09:09:10,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {596#true} is VALID [2022-04-15 09:09:10,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 09:09:10,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #68#return; {596#true} is VALID [2022-04-15 09:09:10,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {596#true} call #t~ret6 := main(); {596#true} is VALID [2022-04-15 09:09:10,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {596#true} is VALID [2022-04-15 09:09:10,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {596#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {596#true} is VALID [2022-04-15 09:09:10,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 09:09:10,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 09:09:10,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 09:09:10,433 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {596#true} {596#true} #56#return; {596#true} is VALID [2022-04-15 09:09:10,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {596#true} is VALID [2022-04-15 09:09:10,434 INFO L272 TraceCheckUtils]: 12: Hoare triple {596#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {596#true} is VALID [2022-04-15 09:09:10,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 09:09:10,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 09:09:10,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 09:09:10,434 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {596#true} {596#true} #58#return; {596#true} is VALID [2022-04-15 09:09:10,434 INFO L272 TraceCheckUtils]: 17: Hoare triple {596#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-15 09:09:10,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 09:09:10,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 09:09:10,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 09:09:10,435 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {596#true} {596#true} #60#return; {596#true} is VALID [2022-04-15 09:09:10,435 INFO L272 TraceCheckUtils]: 22: Hoare triple {596#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-15 09:09:10,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 09:09:10,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 09:09:10,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 09:09:10,436 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {596#true} {596#true} #62#return; {596#true} is VALID [2022-04-15 09:09:10,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {596#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {596#true} is VALID [2022-04-15 09:09:10,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {596#true} assume !false; {596#true} is VALID [2022-04-15 09:09:10,436 INFO L272 TraceCheckUtils]: 29: Hoare triple {596#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {596#true} is VALID [2022-04-15 09:09:10,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {596#true} ~cond := #in~cond; {691#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:09:10,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {691#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {695#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:09:10,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {695#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {695#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:09:10,441 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {695#(not (= |__VERIFIER_assert_#in~cond| 0))} {596#true} #64#return; {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-15 09:09:10,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-15 09:09:10,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {709#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} is VALID [2022-04-15 09:09:10,443 INFO L272 TraceCheckUtils]: 36: Hoare triple {709#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {713#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:09:10,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {713#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {717#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:09:10,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {717#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {597#false} is VALID [2022-04-15 09:09:10,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-04-15 09:09:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 09:09:10,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:09:12,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-04-15 09:09:12,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {717#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {597#false} is VALID [2022-04-15 09:09:12,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {713#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {717#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:09:12,208 INFO L272 TraceCheckUtils]: 36: Hoare triple {733#(= (+ main_~x~0 1) main_~y~0)} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {713#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:09:12,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {733#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-15 09:09:12,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-15 09:09:12,210 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {695#(not (= |__VERIFIER_assert_#in~cond| 0))} {596#true} #64#return; {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-15 09:09:12,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {695#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {695#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:09:12,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {752#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {695#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:09:12,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {596#true} ~cond := #in~cond; {752#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:09:12,215 INFO L272 TraceCheckUtils]: 29: Hoare triple {596#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {596#true} is VALID [2022-04-15 09:09:12,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {596#true} assume !false; {596#true} is VALID [2022-04-15 09:09:12,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {596#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {596#true} is VALID [2022-04-15 09:09:12,217 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {596#true} {596#true} #62#return; {596#true} is VALID [2022-04-15 09:09:12,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 09:09:12,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 09:09:12,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 09:09:12,218 INFO L272 TraceCheckUtils]: 22: Hoare triple {596#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-15 09:09:12,218 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {596#true} {596#true} #60#return; {596#true} is VALID [2022-04-15 09:09:12,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 09:09:12,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 09:09:12,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 09:09:12,219 INFO L272 TraceCheckUtils]: 17: Hoare triple {596#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-15 09:09:12,219 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {596#true} {596#true} #58#return; {596#true} is VALID [2022-04-15 09:09:12,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 09:09:12,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 09:09:12,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 09:09:12,219 INFO L272 TraceCheckUtils]: 12: Hoare triple {596#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {596#true} is VALID [2022-04-15 09:09:12,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {596#true} is VALID [2022-04-15 09:09:12,219 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {596#true} {596#true} #56#return; {596#true} is VALID [2022-04-15 09:09:12,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 09:09:12,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 09:09:12,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 09:09:12,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {596#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {596#true} is VALID [2022-04-15 09:09:12,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {596#true} is VALID [2022-04-15 09:09:12,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {596#true} call #t~ret6 := main(); {596#true} is VALID [2022-04-15 09:09:12,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #68#return; {596#true} is VALID [2022-04-15 09:09:12,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 09:09:12,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {596#true} is VALID [2022-04-15 09:09:12,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {596#true} call ULTIMATE.init(); {596#true} is VALID [2022-04-15 09:09:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 09:09:12,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:09:12,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827272939] [2022-04-15 09:09:12,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:09:12,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192718689] [2022-04-15 09:09:12,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192718689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:09:12,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:09:12,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 09:09:12,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:09:12,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [217905352] [2022-04-15 09:09:12,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [217905352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:12,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:12,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:09:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289617005] [2022-04-15 09:09:12,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:09:12,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-15 09:09:12,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:09:12,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 09:09:12,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:12,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:09:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:12,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:09:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:09:12,247 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 09:09:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:12,399 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 09:09:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 09:09:12,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-15 09:09:12,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:09:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 09:09:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-15 09:09:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 09:09:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-15 09:09:12,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-15 09:09:12,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:12,438 INFO L225 Difference]: With dead ends: 33 [2022-04-15 09:09:12,438 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 09:09:12,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-15 09:09:12,439 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:09:12,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 123 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-04-15 09:09:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 09:09:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 09:09:12,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:09:12,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 09:09:12,440 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 09:09:12,440 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 09:09:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:12,441 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 09:09:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 09:09:12,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:12,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:12,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 09:09:12,441 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 09:09:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:12,441 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 09:09:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 09:09:12,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:12,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:12,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:09:12,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:09:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 09:09:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 09:09:12,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-04-15 09:09:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:09:12,442 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 09:09:12,442 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 09:09:12,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 09:09:12,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 09:09:12,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:12,444 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 09:09:12,465 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-15 09:09:12,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 09:09:12,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 09:09:12,746 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-15 09:09:12,746 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-15 09:09:12,746 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-15 09:09:12,746 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-15 09:09:12,746 INFO L885 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: true [2022-04-15 09:09:12,746 INFO L885 garLoopResultBuilder]: At program point L13-2(lines 12 14) the Hoare annotation is: true [2022-04-15 09:09:12,746 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 12 14) the Hoare annotation is: true [2022-04-15 09:09:12,746 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-15 09:09:12,746 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 52) the Hoare annotation is: true [2022-04-15 09:09:12,747 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0))))) [2022-04-15 09:09:12,747 INFO L885 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: true [2022-04-15 09:09:12,748 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 52) the Hoare annotation is: true [2022-04-15 09:09:12,748 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 46) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-15 09:09:12,748 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 46) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-15 09:09:12,748 INFO L885 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: true [2022-04-15 09:09:12,748 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 52) the Hoare annotation is: true [2022-04-15 09:09:12,748 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-15 09:09:12,748 INFO L885 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-04-15 09:09:12,748 INFO L885 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-15 09:09:12,748 INFO L885 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: true [2022-04-15 09:09:12,748 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-15 09:09:12,748 INFO L878 garLoopResultBuilder]: At program point L37-1(lines 36 46) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-15 09:09:12,748 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 09:09:12,750 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 09:09:12,750 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 09:09:12,750 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 09:09:12,750 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 09:09:12,750 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 09:09:12,750 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 09:09:12,750 INFO L878 garLoopResultBuilder]: At program point L17(lines 17 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 09:09:12,750 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 09:09:12,750 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-15 09:09:12,750 INFO L878 garLoopResultBuilder]: At program point L16-2(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 09:09:12,750 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 09:09:12,750 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 09:09:12,753 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-15 09:09:12,754 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 09:09:12,758 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 09:09:12,759 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 09:09:12,782 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 09:09:12,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 09:09:12 BoogieIcfgContainer [2022-04-15 09:09:12,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 09:09:12,790 INFO L158 Benchmark]: Toolchain (without parser) took 8473.56ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 141.5MB in the beginning and 114.3MB in the end (delta: 27.2MB). Peak memory consumption was 78.2MB. Max. memory is 8.0GB. [2022-04-15 09:09:12,790 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory was 157.9MB in the beginning and 157.9MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 09:09:12,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.59ms. Allocated memory is still 190.8MB. Free memory was 141.3MB in the beginning and 171.2MB in the end (delta: -29.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-15 09:09:12,790 INFO L158 Benchmark]: Boogie Preprocessor took 27.49ms. Allocated memory is still 190.8MB. Free memory was 171.2MB in the beginning and 169.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 09:09:12,791 INFO L158 Benchmark]: RCFGBuilder took 273.94ms. Allocated memory is still 190.8MB. Free memory was 169.6MB in the beginning and 158.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 09:09:12,791 INFO L158 Benchmark]: TraceAbstraction took 7956.28ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 157.4MB in the beginning and 114.3MB in the end (delta: 43.1MB). Peak memory consumption was 96.1MB. Max. memory is 8.0GB. [2022-04-15 09:09:12,792 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.12ms. Allocated memory is still 190.8MB. Free memory was 157.9MB in the beginning and 157.9MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.59ms. Allocated memory is still 190.8MB. Free memory was 141.3MB in the beginning and 171.2MB in the end (delta: -29.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.49ms. Allocated memory is still 190.8MB. Free memory was 171.2MB in the beginning and 169.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 273.94ms. Allocated memory is still 190.8MB. Free memory was 169.6MB in the beginning and 158.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7956.28ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 157.4MB in the beginning and 114.3MB in the end (delta: 43.1MB). Peak memory consumption was 96.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12 IncrementalHoareTripleChecker+Unchecked, 174 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 81 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 80 PreInvPairs, 113 NumberOfFragments, 114 HoareAnnotationTreeSize, 80 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 32 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: z * x + 1 == y + x - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-15 09:09:12,809 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...