/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/ps2-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:41:46,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:41:46,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:41:46,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:41:46,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:41:46,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:41:46,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:41:46,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:41:46,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:41:46,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:41:46,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:41:46,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:41:46,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:41:46,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:41:46,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:41:46,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:41:46,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:41:46,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:41:46,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:41:46,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:41:46,764 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:41:46,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:41:46,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:41:46,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:41:46,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:41:46,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:41:46,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:41:46,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:41:46,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:41:46,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:41:46,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:41:46,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:41:46,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:41:46,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:41:46,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:41:46,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:41:46,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:41:46,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:41:46,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:41:46,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:41:46,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:41:46,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:41:46,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 07:41:46,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:41:46,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:41:46,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:41:46,786 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:41:46,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:41:46,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:41:46,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:41:46,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:41:46,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:41:46,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:41:46,787 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:41:46,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:41:46,787 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:41:46,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:41:46,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:41:46,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:41:46,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:41:46,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:41:46,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:41:46,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:41:46,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:41:46,788 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:41:46,788 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:41:46,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:41:46,788 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:41:46,789 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 07:41:47,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:41:47,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:41:47,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:41:47,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:41:47,033 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:41:47,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound5.c [2022-04-08 07:41:47,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b8d3306/037cc97f401a434ebf8c17029c1af048/FLAG04550db68 [2022-04-08 07:41:47,439 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:41:47,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound5.c [2022-04-08 07:41:47,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b8d3306/037cc97f401a434ebf8c17029c1af048/FLAG04550db68 [2022-04-08 07:41:47,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b8d3306/037cc97f401a434ebf8c17029c1af048 [2022-04-08 07:41:47,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:41:47,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:41:47,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:41:47,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:41:47,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:41:47,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:41:47" (1/1) ... [2022-04-08 07:41:47,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5356bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:47, skipping insertion in model container [2022-04-08 07:41:47,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:41:47" (1/1) ... [2022-04-08 07:41:47,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:41:47,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:41:48,027 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/ps2-ll_valuebound5.c[454,467] [2022-04-08 07:41:48,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:41:48,048 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:41:48,059 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/ps2-ll_valuebound5.c[454,467] [2022-04-08 07:41:48,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:41:48,074 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:41:48,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:48 WrapperNode [2022-04-08 07:41:48,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:41:48,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:41:48,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:41:48,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:41:48,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:48" (1/1) ... [2022-04-08 07:41:48,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:48" (1/1) ... [2022-04-08 07:41:48,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:48" (1/1) ... [2022-04-08 07:41:48,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:48" (1/1) ... [2022-04-08 07:41:48,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:48" (1/1) ... [2022-04-08 07:41:48,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:48" (1/1) ... [2022-04-08 07:41:48,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:48" (1/1) ... [2022-04-08 07:41:48,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:41:48,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:41:48,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:41:48,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:41:48,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:48" (1/1) ... [2022-04-08 07:41:48,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:41:48,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:41:48,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 07:41:48,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 07:41:48,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:41:48,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:41:48,168 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:41:48,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:41:48,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:41:48,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:41:48,169 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:41:48,169 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:41:48,169 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:41:48,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:41:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 07:41:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:41:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:41:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:41:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:41:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:41:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:41:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:41:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:41:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:41:48,219 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:41:48,221 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:41:48,322 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:41:48,327 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:41:48,328 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:41:48,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:41:48 BoogieIcfgContainer [2022-04-08 07:41:48,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:41:48,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:41:48,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:41:48,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:41:48,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:41:47" (1/3) ... [2022-04-08 07:41:48,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba13c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:41:48, skipping insertion in model container [2022-04-08 07:41:48,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:41:48" (2/3) ... [2022-04-08 07:41:48,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba13c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:41:48, skipping insertion in model container [2022-04-08 07:41:48,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:41:48" (3/3) ... [2022-04-08 07:41:48,335 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_valuebound5.c [2022-04-08 07:41:48,339 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:41:48,339 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:41:48,372 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:41:48,378 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 07:41:48,378 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:41:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:41:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:41:48,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:41:48,397 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:41:48,397 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:41:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:41:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1914087080, now seen corresponding path program 1 times [2022-04-08 07:41:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:41:48,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1783535569] [2022-04-08 07:41:48,434 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:41:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1914087080, now seen corresponding path program 2 times [2022-04-08 07:41:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:41:48,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563834357] [2022-04-08 07:41:48,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:41:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:41:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:41:48,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:41:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:41:48,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-04-08 07:41:48,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-08 07:41:48,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID [2022-04-08 07:41:48,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:41:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:41:48,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-04-08 07:41:48,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-04-08 07:41:48,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-04-08 07:41:48,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} #51#return; {31#false} is VALID [2022-04-08 07:41:48,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:41:48,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-04-08 07:41:48,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-08 07:41:48,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID [2022-04-08 07:41:48,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-08 07:41:48,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4; {30#true} is VALID [2022-04-08 07:41:48,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {30#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {30#true} is VALID [2022-04-08 07:41:48,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-04-08 07:41:48,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-04-08 07:41:48,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume true; {31#false} is VALID [2022-04-08 07:41:48,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31#false} {30#true} #51#return; {31#false} is VALID [2022-04-08 07:41:48,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {31#false} is VALID [2022-04-08 07:41:48,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume false; {31#false} is VALID [2022-04-08 07:41:48,635 INFO L272 TraceCheckUtils]: 13: Hoare triple {31#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {31#false} is VALID [2022-04-08 07:41:48,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-04-08 07:41:48,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-04-08 07:41:48,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-08 07:41:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:41:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:41:48,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563834357] [2022-04-08 07:41:48,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563834357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:41:48,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:41:48,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:41:48,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:41:48,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1783535569] [2022-04-08 07:41:48,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1783535569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:41:48,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:41:48,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:41:48,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452997567] [2022-04-08 07:41:48,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:41:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:41:48,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:41:48,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:41:48,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:41:48,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:41:48,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:41:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:41:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:41:48,705 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:41:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:41:48,810 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 07:41:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:41:48,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:41:48,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:41:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:41:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-08 07:41:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:41:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-08 07:41:48,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-04-08 07:41:48,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:41:48,921 INFO L225 Difference]: With dead ends: 45 [2022-04-08 07:41:48,921 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 07:41:48,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-08 07:41:48,926 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:41:48,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:41:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 07:41:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 07:41:48,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:41:48,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:41:48,955 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:41:48,955 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:41:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:41:48,958 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-08 07:41:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-08 07:41:48,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:41:48,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:41:48,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-08 07:41:48,960 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-08 07:41:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:41:48,963 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-08 07:41:48,963 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-08 07:41:48,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:41:48,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:41:48,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:41:48,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:41:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:41:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-08 07:41:48,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-08 07:41:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:41:48,980 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-08 07:41:48,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:41:48,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-08 07:41:49,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:41:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-08 07:41:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:41:49,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:41:49,006 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:41:49,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:41:49,006 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:41:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:41:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1699034386, now seen corresponding path program 1 times [2022-04-08 07:41:49,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:41:49,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [381601156] [2022-04-08 07:41:49,009 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:41:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1699034386, now seen corresponding path program 2 times [2022-04-08 07:41:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:41:49,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826825077] [2022-04-08 07:41:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:41:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:41:49,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:41:49,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832364630] [2022-04-08 07:41:49,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:41:49,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:41:49,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:41:49,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:41:49,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 07:41:49,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:41:49,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:41:49,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:41:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:41:49,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:41:49,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2022-04-08 07:41:49,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {220#true} is VALID [2022-04-08 07:41:49,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID [2022-04-08 07:41:49,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #57#return; {220#true} is VALID [2022-04-08 07:41:49,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret5 := main(); {220#true} is VALID [2022-04-08 07:41:49,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4; {220#true} is VALID [2022-04-08 07:41:49,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {220#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {220#true} is VALID [2022-04-08 07:41:49,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#true} ~cond := #in~cond; {220#true} is VALID [2022-04-08 07:41:49,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#true} assume !(0 == ~cond); {220#true} is VALID [2022-04-08 07:41:49,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#true} assume true; {220#true} is VALID [2022-04-08 07:41:49,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {220#true} {220#true} #51#return; {220#true} is VALID [2022-04-08 07:41:49,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {220#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {258#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:41:49,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {258#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:41:49,217 INFO L272 TraceCheckUtils]: 13: Hoare triple {258#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:41:49,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:41:49,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {221#false} is VALID [2022-04-08 07:41:49,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {221#false} assume !false; {221#false} is VALID [2022-04-08 07:41:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:41:49,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:41:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:41:49,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826825077] [2022-04-08 07:41:49,220 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:41:49,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832364630] [2022-04-08 07:41:49,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832364630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:41:49,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:41:49,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:41:49,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:41:49,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [381601156] [2022-04-08 07:41:49,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [381601156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:41:49,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:41:49,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:41:49,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259040222] [2022-04-08 07:41:49,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:41:49,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:41:49,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:41:49,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:41:49,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:41:49,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:41:49,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:41:49,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:41:49,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:41:49,239 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:41:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:41:49,329 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-08 07:41:49,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:41:49,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:41:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:41:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:41:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-08 07:41:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:41:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-08 07:41:49,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-04-08 07:41:49,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:41:49,363 INFO L225 Difference]: With dead ends: 32 [2022-04-08 07:41:49,363 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 07:41:49,364 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-08 07:41:49,365 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:41:49,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:41:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 07:41:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 07:41:49,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:41:49,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:41:49,376 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:41:49,376 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:41:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:41:49,378 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 07:41:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 07:41:49,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:41:49,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:41:49,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-08 07:41:49,379 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-08 07:41:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:41:49,381 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 07:41:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 07:41:49,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:41:49,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:41:49,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:41:49,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:41:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:41:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-08 07:41:49,384 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2022-04-08 07:41:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:41:49,384 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-08 07:41:49,384 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:41:49,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-08 07:41:49,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:41:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 07:41:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 07:41:49,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:41:49,415 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:41:49,444 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-08 07:41:49,637 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-08 07:41:49,638 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:41:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:41:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash 276758134, now seen corresponding path program 1 times [2022-04-08 07:41:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:41:49,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1598199555] [2022-04-08 07:41:59,730 WARN L232 SmtUtils]: Spent 9.64s on a formula simplification. DAG size of input: 81 DAG size of output: 71 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-08 07:41:59,751 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 07:41:59,754 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 07:41:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash 22480176, now seen corresponding path program 1 times [2022-04-08 07:41:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:41:59,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250600784] [2022-04-08 07:41:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:41:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:41:59,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:41:59,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433771670] [2022-04-08 07:41:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:41:59,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:41:59,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:41:59,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:41:59,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 07:41:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:41:59,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 07:41:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:41:59,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:46,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-08 07:44:46,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {457#true} is VALID [2022-04-08 07:44:46,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-08 07:44:46,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #57#return; {457#true} is VALID [2022-04-08 07:44:46,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-08 07:44:46,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4; {457#true} is VALID [2022-04-08 07:44:46,232 INFO L272 TraceCheckUtils]: 6: Hoare triple {457#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {457#true} is VALID [2022-04-08 07:44:46,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID [2022-04-08 07:44:46,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#true} assume !(0 == ~cond); {457#true} is VALID [2022-04-08 07:44:46,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-08 07:44:46,233 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {457#true} {457#true} #51#return; {457#true} is VALID [2022-04-08 07:44:46,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {495#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:47,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {495#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [61] L27-2-->L28_primed: Formula: (let ((.cse0 (= v_main_~c~0_7 v_main_~c~0_6)) (.cse1 (= v_main_~x~0_12 v_main_~x~0_11)) (.cse2 (= v_main_~y~0_12 v_main_~y~0_11)) (.cse4 (* (- 1) v_main_~c~0_7)) (.cse5 (= (* v_main_~x~0_12 2) (+ v_main_~y~0_12 (* v_main_~y~0_12 v_main_~y~0_12)))) (.cse6 (* (- 1) v_main_~c~0_6))) (or (and .cse0 .cse1 .cse2 (= v_main_~k~0_8 v_main_~k~0_8)) (let ((.cse3 (div (+ v_main_~c~0_7 .cse6) (- 2)))) (and (< .cse3 (+ (div (+ (- 2) v_main_~k~0_8 .cse4) 2) 2)) (= v_main_~y~0_11 (+ v_main_~y~0_12 (* 2 .cse3))) (< 0 .cse3) (= v_main_~x~0_11 (+ v_main_~x~0_12 (* 2 (* .cse3 .cse3)) .cse3 (* (* v_main_~y~0_12 .cse3) 2))) .cse5 (= (mod (+ v_main_~c~0_7 v_main_~c~0_6) 2) 0))) (and .cse0 .cse1 (or (not .cse5) (not (< v_main_~c~0_7 v_main_~k~0_8))) .cse2) (let ((.cse7 (div (+ v_main_~c~0_7 .cse6 1) (- 2)))) (and (= v_main_~x~0_11 (+ v_main_~x~0_12 v_main_~y~0_12 (* 2 (* .cse7 .cse7)) (* (* v_main_~y~0_12 .cse7) 2) (* 3 .cse7) 1)) (= (mod (+ v_main_~c~0_7 v_main_~c~0_6 1) 2) 0) (< .cse7 (+ (div (+ (- 1) v_main_~k~0_8 .cse4) 2) 1)) (<= 0 .cse7) .cse5 (= v_main_~y~0_11 (+ v_main_~y~0_12 (* 2 .cse7) 1)))))) InVars {main_~y~0=v_main_~y~0_12, main_~c~0=v_main_~c~0_7, main_~x~0=v_main_~x~0_12, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_11, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_11, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {499#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) 2) (< aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 (div (* (- 1) main_~y~0) (- 2))) (= (+ (* 2 (* (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)))) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2))) main_~x~0))) (= (mod main_~y~0 2) 0)) (and (exists ((aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 Int)) (and (= (+ (* 2 (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 aux_div_aux_mod_aux_mod_main_~c~0_37_67_89)) (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 3) 1) main_~x~0) (< aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 (+ (div (+ (- 1) main_~y~0) 2) 1)) (< (div (+ (- 1) main_~y~0) 2) (+ aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 1)))) (= (mod (+ main_~y~0 1) 2) 0) (< 0 (+ (div (+ (- 1) main_~y~0) 2) 1))))} is VALID [2022-04-08 07:44:47,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {499#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) 2) (< aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 (div (* (- 1) main_~y~0) (- 2))) (= (+ (* 2 (* (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)))) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2))) main_~x~0))) (= (mod main_~y~0 2) 0)) (and (exists ((aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 Int)) (and (= (+ (* 2 (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 aux_div_aux_mod_aux_mod_main_~c~0_37_67_89)) (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 3) 1) main_~x~0) (< aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 (+ (div (+ (- 1) main_~y~0) 2) 1)) (< (div (+ (- 1) main_~y~0) 2) (+ aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 1)))) (= (mod (+ main_~y~0 1) 2) 0) (< 0 (+ (div (+ (- 1) main_~y~0) 2) 1))))} [60] L28_primed-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) 2) (< aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 (div (* (- 1) main_~y~0) (- 2))) (= (+ (* 2 (* (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)))) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2))) main_~x~0))) (= (mod main_~y~0 2) 0)) (and (exists ((aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 Int)) (and (= (+ (* 2 (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 aux_div_aux_mod_aux_mod_main_~c~0_37_67_89)) (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 3) 1) main_~x~0) (< aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 (+ (div (+ (- 1) main_~y~0) 2) 1)) (< (div (+ (- 1) main_~y~0) 2) (+ aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 1)))) (= (mod (+ main_~y~0 1) 2) 0) (< 0 (+ (div (+ (- 1) main_~y~0) 2) 1))))} is VALID [2022-04-08 07:44:48,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {499#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) 2) (< aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 (div (* (- 1) main_~y~0) (- 2))) (= (+ (* 2 (* (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)))) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2))) main_~x~0))) (= (mod main_~y~0 2) 0)) (and (exists ((aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 Int)) (and (= (+ (* 2 (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 aux_div_aux_mod_aux_mod_main_~c~0_37_67_89)) (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 3) 1) main_~x~0) (< aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 (+ (div (+ (- 1) main_~y~0) 2) 1)) (< (div (+ (- 1) main_~y~0) 2) (+ aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 1)))) (= (mod (+ main_~y~0 1) 2) 0) (< 0 (+ (div (+ (- 1) main_~y~0) 2) 1))))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {506#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:48,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {506#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {510#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:48,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {510#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {458#false} is VALID [2022-04-08 07:44:48,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-08 07:44:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:44:48,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:44:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:48,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250600784] [2022-04-08 07:44:48,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:48,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433771670] [2022-04-08 07:44:48,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433771670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:48,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:48,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 07:44:56,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:56,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1598199555] [2022-04-08 07:44:56,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1598199555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:56,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:56,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:44:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878875500] [2022-04-08 07:44:56,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:56,906 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 07:44:56,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:56,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:44:56,923 WARN L143 InductivityCheck]: Transition 519#(and (exists ((v_main_~c~0_BEFORE_RETURN_1 Int) (v_main_~y~0_15 Int) (v_main_~k~0_BEFORE_RETURN_1 Int) (v_main_~x~0_15 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (and (or (and (= (* 2 (div (* (- 1) v_main_~c~0_BEFORE_RETURN_1) (- 2))) v_main_~y~0_15) (< 0 (div (* (- 1) v_main_~c~0_BEFORE_RETURN_1) (- 2))) (= v_main_~x~0_15 (+ (* 2 (* (div (* (- 1) v_main_~c~0_BEFORE_RETURN_1) (- 2)) (div (* (- 1) v_main_~c~0_BEFORE_RETURN_1) (- 2)))) (div (* (- 1) v_main_~c~0_BEFORE_RETURN_1) (- 2)))) (< (div (* (- 1) v_main_~c~0_BEFORE_RETURN_1) (- 2)) (+ (div (+ v_main_~k~0_BEFORE_RETURN_1 (- 2)) 2) 2)) (= (mod v_main_~c~0_BEFORE_RETURN_1 2) 0)) (and (= v_main_~y~0_15 (+ (* (div (+ (* (- 1) v_main_~c~0_BEFORE_RETURN_1) 1) (- 2)) 2) 1)) (< (div (+ (* (- 1) v_main_~c~0_BEFORE_RETURN_1) 1) (- 2)) (+ (div (+ (- 1) v_main_~k~0_BEFORE_RETURN_1) 2) 1)) (= v_main_~x~0_15 (+ (* (div (+ (* (- 1) v_main_~c~0_BEFORE_RETURN_1) 1) (- 2)) 3) (* 2 (* (div (+ (* (- 1) v_main_~c~0_BEFORE_RETURN_1) 1) (- 2)) (div (+ (* (- 1) v_main_~c~0_BEFORE_RETURN_1) 1) (- 2)))) 1)) (<= 0 (div (+ (* (- 1) v_main_~c~0_BEFORE_RETURN_1) 1) (- 2))) (= (mod (+ v_main_~c~0_BEFORE_RETURN_1 1) 2) 0)) (and (= v_main_~x~0_15 0) (= v_main_~y~0_15 0) (= v_main_~c~0_BEFORE_RETURN_1 0))) (or (and (not (= (+ v_main_~y~0_15 (* v_main_~y~0_15 v_main_~y~0_15) (* v_main_~x~0_15 (- 2))) 0)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0)) (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1) (= (+ v_main_~y~0_15 (* v_main_~y~0_15 v_main_~y~0_15) (* v_main_~x~0_15 (- 2))) 0))) (or (and (= (+ (- 1) (* (- 2) main_~x~0) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* main_~y~0 3)) 0) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1)) (and (not (= (+ (- 1) (* (- 2) main_~x~0) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* main_~y~0 3)) 0)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0))))) (< main_~c~0 (+ main_~k~0 1))) ( _ , assume !false; , 499#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) 2) (< aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 (div (* (- 1) main_~y~0) (- 2))) (= (+ (* 2 (* (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)))) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2))) main_~x~0))) (= (mod main_~y~0 2) 0)) (and (exists ((aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 Int)) (and (= (+ (* 2 (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 aux_div_aux_mod_aux_mod_main_~c~0_37_67_89)) (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 3) 1) main_~x~0) (< aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 (+ (div (+ (- 1) main_~y~0) 2) 1)) (< (div (+ (- 1) main_~y~0) 2) (+ aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 1)))) (= (mod (+ main_~y~0 1) 2) 0) (< 0 (+ (div (+ (- 1) main_~y~0) 2) 1)))) ) not inductive [2022-04-08 07:44:56,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:57,124 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-08 07:44:57,125 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 07:44:57,128 INFO L158 Benchmark]: Toolchain (without parser) took 189260.17ms. Allocated memory is still 185.6MB. Free memory was 137.7MB in the beginning and 63.9MB in the end (delta: 73.7MB). Peak memory consumption was 75.3MB. Max. memory is 8.0GB. [2022-04-08 07:44:57,128 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory was 153.7MB in the beginning and 153.6MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 07:44:57,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.57ms. Allocated memory is still 185.6MB. Free memory was 137.4MB in the beginning and 164.7MB in the end (delta: -27.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-08 07:44:57,129 INFO L158 Benchmark]: Boogie Preprocessor took 22.14ms. Allocated memory is still 185.6MB. Free memory was 164.7MB in the beginning and 163.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 07:44:57,129 INFO L158 Benchmark]: RCFGBuilder took 231.30ms. Allocated memory is still 185.6MB. Free memory was 163.0MB in the beginning and 152.8MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 07:44:57,129 INFO L158 Benchmark]: TraceAbstraction took 188796.83ms. Allocated memory is still 185.6MB. Free memory was 152.2MB in the beginning and 63.9MB in the end (delta: 88.3MB). Peak memory consumption was 89.6MB. Max. memory is 8.0GB. [2022-04-08 07:44:57,131 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory was 153.7MB in the beginning and 153.6MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.57ms. Allocated memory is still 185.6MB. Free memory was 137.4MB in the beginning and 164.7MB in the end (delta: -27.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.14ms. Allocated memory is still 185.6MB. Free memory was 164.7MB in the beginning and 163.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 231.30ms. Allocated memory is still 185.6MB. Free memory was 163.0MB in the beginning and 152.8MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 188796.83ms. Allocated memory is still 185.6MB. Free memory was 152.2MB in the beginning and 63.9MB in the end (delta: 88.3MB). Peak memory consumption was 89.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 07:44:57,213 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...