/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_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 10:40:20,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 10:40:20,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 10:40:20,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 10:40:20,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 10:40:20,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 10:40:20,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 10:40:20,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 10:40:20,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 10:40:20,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 10:40:20,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 10:40:20,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 10:40:20,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 10:40:20,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 10:40:20,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 10:40:20,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 10:40:20,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 10:40:20,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 10:40:20,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 10:40:20,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 10:40:20,697 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 10:40:20,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 10:40:20,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 10:40:20,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 10:40:20,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 10:40:20,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 10:40:20,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 10:40:20,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 10:40:20,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 10:40:20,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 10:40:20,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 10:40:20,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 10:40:20,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 10:40:20,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 10:40:20,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 10:40:20,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 10:40:20,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 10:40:20,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 10:40:20,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 10:40:20,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 10:40:20,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 10:40:20,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 10:40:20,716 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 10:40:20,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 10:40:20,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 10:40:20,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 10:40:20,728 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 10:40:20,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 10:40:20,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 10:40:20,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 10:40:20,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 10:40:20,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 10:40:20,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 10:40:20,729 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 10:40:20,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 10:40:20,730 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 10:40:20,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 10:40:20,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 10:40:20,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 10:40:20,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 10:40:20,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 10:40:20,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:40:20,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 10:40:20,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 10:40:20,731 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 10:40:20,731 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 10:40:20,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 10:40:20,731 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 10:40:20,731 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 10:40:20,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 10:40:20,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 10:40:20,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 10:40:20,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 10:40:20,983 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 10:40:20,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound2.c [2022-04-15 10:40:21,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e93a9338/ce379ccd24f44e479646327d82c659b6/FLAG9135aa8bd [2022-04-15 10:40:21,400 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 10:40:21,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound2.c [2022-04-15 10:40:21,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e93a9338/ce379ccd24f44e479646327d82c659b6/FLAG9135aa8bd [2022-04-15 10:40:21,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e93a9338/ce379ccd24f44e479646327d82c659b6 [2022-04-15 10:40:21,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 10:40:21,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 10:40:21,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 10:40:21,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 10:40:21,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 10:40:21,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:40:21" (1/1) ... [2022-04-15 10:40:21,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c768f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:21, skipping insertion in model container [2022-04-15 10:40:21,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:40:21" (1/1) ... [2022-04-15 10:40:21,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 10:40:21,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 10:40:21,970 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_unwindbound2.c[454,467] [2022-04-15 10:40:21,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:40:21,988 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 10:40:21,998 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_unwindbound2.c[454,467] [2022-04-15 10:40:22,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:40:22,013 INFO L208 MainTranslator]: Completed translation [2022-04-15 10:40:22,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:22 WrapperNode [2022-04-15 10:40:22,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 10:40:22,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 10:40:22,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 10:40:22,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 10:40:22,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:22" (1/1) ... [2022-04-15 10:40:22,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:22" (1/1) ... [2022-04-15 10:40:22,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:22" (1/1) ... [2022-04-15 10:40:22,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:22" (1/1) ... [2022-04-15 10:40:22,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:22" (1/1) ... [2022-04-15 10:40:22,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:22" (1/1) ... [2022-04-15 10:40:22,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:22" (1/1) ... [2022-04-15 10:40:22,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 10:40:22,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 10:40:22,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 10:40:22,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 10:40:22,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:22" (1/1) ... [2022-04-15 10:40:22,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:40:22,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:40:22,064 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 10:40:22,073 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 10:40:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 10:40:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 10:40:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 10:40:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 10:40:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 10:40:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 10:40:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 10:40:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 10:40:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 10:40:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 10:40:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 10:40:22,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 10:40:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 10:40:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 10:40:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 10:40:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 10:40:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 10:40:22,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 10:40:22,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 10:40:22,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 10:40:22,158 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 10:40:22,160 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 10:40:22,312 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 10:40:22,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 10:40:22,318 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 10:40:22,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:40:22 BoogieIcfgContainer [2022-04-15 10:40:22,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 10:40:22,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 10:40:22,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 10:40:22,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 10:40:22,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:40:21" (1/3) ... [2022-04-15 10:40:22,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d12bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:40:22, skipping insertion in model container [2022-04-15 10:40:22,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:40:22" (2/3) ... [2022-04-15 10:40:22,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d12bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:40:22, skipping insertion in model container [2022-04-15 10:40:22,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:40:22" (3/3) ... [2022-04-15 10:40:22,326 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_unwindbound2.c [2022-04-15 10:40:22,330 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 10:40:22,331 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 10:40:22,392 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 10:40:22,398 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 10:40:22,398 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 10:40:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:40:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 10:40:22,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:40:22,437 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:40:22,438 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:40:22,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:40:22,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-15 10:40:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:40:22,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [919299686] [2022-04-15 10:40:22,467 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:40:22,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-15 10:40:22,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:40:22,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245532488] [2022-04-15 10:40:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:40:22,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:40:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:40:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 10:40:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:40:22,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {25#true} is VALID [2022-04-15 10:40:22,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 10:40:22,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-15 10:40:22,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 10:40:22,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {25#true} is VALID [2022-04-15 10:40:22,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 10:40:22,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-15 10:40:22,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2022-04-15 10:40:22,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25#true} is VALID [2022-04-15 10:40:22,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 10:40:22,682 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-15 10:40:22,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 10:40:22,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 10:40:22,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 10:40:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:40:22,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:40:22,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245532488] [2022-04-15 10:40:22,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245532488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:40:22,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:40:22,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:40:22,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:40:22,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [919299686] [2022-04-15 10:40:22,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [919299686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:40:22,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:40:22,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:40:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707048037] [2022-04-15 10:40:22,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:40:22,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 10:40:22,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:40:22,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:22,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:40:22,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 10:40:22,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:40:22,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 10:40:22,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:40:22,746 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:40:22,872 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 10:40:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 10:40:22,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 10:40:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:40:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 10:40:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 10:40:22,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-15 10:40:22,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:40:22,972 INFO L225 Difference]: With dead ends: 39 [2022-04-15 10:40:22,973 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 10:40:22,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:40:22,979 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:40:22,981 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:40:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 10:40:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-15 10:40:23,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:40:23,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:40:23,019 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:40:23,020 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:40:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:40:23,024 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 10:40:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 10:40:23,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:40:23,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:40:23,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-15 10:40:23,026 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-15 10:40:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:40:23,033 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 10:40:23,033 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 10:40:23,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:40:23,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:40:23,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:40:23,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:40:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:40:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 10:40:23,038 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 10:40:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:40:23,038 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 10:40:23,039 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:23,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 10:40:23,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:40:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 10:40:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 10:40:23,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:40:23,071 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:40:23,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 10:40:23,071 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:40:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:40:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-15 10:40:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:40:23,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852011567] [2022-04-15 10:40:23,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:40:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-15 10:40:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:40:23,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637558044] [2022-04-15 10:40:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:40:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:40:23,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:40:23,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560652663] [2022-04-15 10:40:23,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:40:23,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:40:23,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:40:23,105 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 10:40:23,153 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 10:40:23,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:40:23,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:40:23,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 10:40:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:40:23,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:40:23,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2022-04-15 10:40:23,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {189#(<= ~counter~0 0)} is VALID [2022-04-15 10:40:23,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#(<= ~counter~0 0)} assume true; {189#(<= ~counter~0 0)} is VALID [2022-04-15 10:40:23,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#(<= ~counter~0 0)} {181#true} #54#return; {189#(<= ~counter~0 0)} is VALID [2022-04-15 10:40:23,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#(<= ~counter~0 0)} call #t~ret6 := main(); {189#(<= ~counter~0 0)} is VALID [2022-04-15 10:40:23,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(<= ~counter~0 0)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {189#(<= ~counter~0 0)} is VALID [2022-04-15 10:40:23,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {205#(<= |main_#t~post5| 0)} is VALID [2022-04-15 10:40:23,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {205#(<= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {182#false} is VALID [2022-04-15 10:40:23,315 INFO L272 TraceCheckUtils]: 8: Hoare triple {182#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {182#false} is VALID [2022-04-15 10:40:23,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#false} ~cond := #in~cond; {182#false} is VALID [2022-04-15 10:40:23,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#false} assume 0 == ~cond; {182#false} is VALID [2022-04-15 10:40:23,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-04-15 10:40:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:40:23,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:40:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:40:23,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637558044] [2022-04-15 10:40:23,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:40:23,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560652663] [2022-04-15 10:40:23,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560652663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:40:23,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:40:23,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 10:40:23,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:40:23,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852011567] [2022-04-15 10:40:23,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852011567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:40:23,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:40:23,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 10:40:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594808626] [2022-04-15 10:40:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:40:23,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 10:40:23,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:40:23,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:23,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:40:23,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 10:40:23,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:40:23,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 10:40:23,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 10:40:23,335 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:40:23,384 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 10:40:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 10:40:23,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 10:40:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:40:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 10:40:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 10:40:23,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-15 10:40:23,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:40:23,415 INFO L225 Difference]: With dead ends: 26 [2022-04-15 10:40:23,415 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 10:40:23,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 10:40:23,418 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:40:23,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:40:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 10:40:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 10:40:23,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:40:23,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:40:23,436 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:40:23,436 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:40:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:40:23,437 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 10:40:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 10:40:23,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:40:23,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:40:23,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 10:40:23,439 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 10:40:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:40:23,440 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 10:40:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 10:40:23,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:40:23,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:40:23,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:40:23,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:40:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:40:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 10:40:23,443 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-15 10:40:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:40:23,443 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 10:40:23,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:23,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 10:40:23,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:40:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 10:40:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 10:40:23,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:40:23,463 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:40:23,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 10:40:23,686 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 10:40:23,687 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:40:23,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:40:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-15 10:40:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:40:23,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29836495] [2022-04-15 10:40:23,688 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:40:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-15 10:40:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:40:23,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210430208] [2022-04-15 10:40:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:40:23,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:40:23,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:40:23,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120930451] [2022-04-15 10:40:23,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:40:23,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:40:23,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:40:23,705 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 10:40:23,706 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 10:40:23,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:40:23,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:40:23,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 10:40:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:40:23,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:40:23,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-15 10:40:23,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {348#true} is VALID [2022-04-15 10:40:23,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-15 10:40:23,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #54#return; {348#true} is VALID [2022-04-15 10:40:23,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret6 := main(); {348#true} is VALID [2022-04-15 10:40:23,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:40:23,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:40:23,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:40:23,833 INFO L272 TraceCheckUtils]: 8: Hoare triple {368#(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)); {378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:40:23,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:40:23,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {349#false} is VALID [2022-04-15 10:40:23,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-15 10:40:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:40:23,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:40:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:40:23,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210430208] [2022-04-15 10:40:23,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:40:23,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120930451] [2022-04-15 10:40:23,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120930451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:40:23,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:40:23,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:40:23,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:40:23,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29836495] [2022-04-15 10:40:23,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29836495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:40:23,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:40:23,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:40:23,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433794331] [2022-04-15 10:40:23,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:40:23,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 10:40:23,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:40:23,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:23,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:40:23,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:40:23,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:40:23,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:40:23,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 10:40:23,850 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:40:23,950 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 10:40:23,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:40:23,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 10:40:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:40:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 10:40:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 10:40:23,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-15 10:40:23,985 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 10:40:23,987 INFO L225 Difference]: With dead ends: 28 [2022-04-15 10:40:23,987 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 10:40:23,987 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 10:40:23,988 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:40:23,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:40:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 10:40:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 10:40:24,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:40:24,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-15 10:40:24,004 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-15 10:40:24,004 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-15 10:40:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:40:24,005 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 10:40:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 10:40:24,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:40:24,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:40:24,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 25 states. [2022-04-15 10:40:24,007 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 25 states. [2022-04-15 10:40:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:40:24,008 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 10:40:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 10:40:24,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:40:24,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:40:24,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:40:24,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:40:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-15 10:40:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 10:40:24,011 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-15 10:40:24,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:40:24,011 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 10:40:24,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:40:24,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 10:40:24,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:40:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 10:40:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 10:40:24,057 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:40:24,057 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:40:24,083 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 10:40:24,283 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 10:40:24,283 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:40:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:40:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-15 10:40:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:40:24,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996137111] [2022-04-15 10:40:25,324 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 10:40:25,328 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 10:40:25,335 INFO L85 PathProgramCache]: Analyzing trace with hash -691750508, now seen corresponding path program 1 times [2022-04-15 10:40:25,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:40:25,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105424376] [2022-04-15 10:40:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:40:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:40:25,370 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:40:25,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929098139] [2022-04-15 10:40:25,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:40:25,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:40:25,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:40:25,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:40:25,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 10:40:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:40:25,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 10:40:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:40:25,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:40:35,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-15 10:40:35,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {554#(= ~counter~0 0)} is VALID [2022-04-15 10:40:35,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(= ~counter~0 0)} assume true; {554#(= ~counter~0 0)} is VALID [2022-04-15 10:40:35,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(= ~counter~0 0)} {546#true} #54#return; {554#(= ~counter~0 0)} is VALID [2022-04-15 10:40:35,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(= ~counter~0 0)} call #t~ret6 := main(); {554#(= ~counter~0 0)} is VALID [2022-04-15 10:40:35,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(= ~counter~0 0)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {567#(and (= main_~x~0 0) (= ~counter~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:40:36,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {567#(and (= main_~x~0 0) (= ~counter~0 0) (= main_~y~0 0))} [58] L27-3-->L27-1_primed: Formula: (let ((.cse3 (* (- 1) v_~counter~0_10)) (.cse4 (* (- 1) v_main_~c~0_8)) (.cse1 (= (+ v_main_~y~0_13 (* v_main_~y~0_13 v_main_~y~0_13)) (* v_main_~x~0_13 2))) (.cse7 (= v_main_~x~0_13 v_main_~x~0_12)) (.cse8 (= |v_main_#t~post5_9| |v_main_#t~post5_7|)) (.cse9 (= v_main_~c~0_8 v_main_~c~0_7)) (.cse10 (= v_main_~y~0_13 v_main_~y~0_12))) (or (let ((.cse0 (div (+ v_main_~y~0_13 (* (- 1) v_main_~y~0_12)) (- 2)))) (let ((.cse2 (* 2 .cse0))) (and (< 0 .cse0) .cse1 (= v_main_~x~0_12 (+ (* (* .cse0 .cse0) 2) v_main_~x~0_13 (* 2 (* v_main_~y~0_13 .cse0)) .cse0)) (= v_main_~c~0_7 (+ v_main_~c~0_8 .cse2)) (< .cse0 (+ (div .cse3 2) 2)) (= (mod (+ v_main_~y~0_13 v_main_~y~0_12) 2) 0) (= v_~counter~0_9 (+ .cse2 v_~counter~0_10)) (< .cse0 (+ 2 (div (+ (- 2) v_main_~k~0_6 .cse4) 2)))))) (let ((.cse5 (div (+ (* (- 1) v_~counter~0_9) v_~counter~0_10 1) (- 2)))) (let ((.cse6 (* 2 .cse5))) (and (< .cse5 (+ (div (+ .cse3 1) 2) 1)) (<= 0 .cse5) (= v_main_~y~0_12 (+ v_main_~y~0_13 .cse6 1)) (= (mod (+ v_~counter~0_9 v_~counter~0_10 1) 2) 0) (= v_main_~x~0_12 (+ (* 2 (* .cse5 .cse5)) v_main_~x~0_13 v_main_~y~0_13 (* 2 (* v_main_~y~0_13 .cse5)) (* 3 .cse5) 1)) (= v_main_~c~0_7 (+ v_main_~c~0_8 .cse6 1)) .cse1 (< .cse5 (+ (div (+ (- 1) v_main_~k~0_6 .cse4) 2) 1))))) (and (= v_~counter~0_10 v_~counter~0_9) .cse7 (= v_main_~k~0_6 v_main_~k~0_6) .cse8 .cse9 .cse10) (and (or (not .cse1) (not (< v_~counter~0_10 2)) (not (< v_main_~c~0_8 v_main_~k~0_6))) (= v_~counter~0_9 v_~counter~0_10) .cse7 .cse8 .cse9 .cse10))) InVars {~counter~0=v_~counter~0_10, main_~x~0=v_main_~x~0_13, main_~k~0=v_main_~k~0_6, main_~y~0=v_main_~y~0_13, main_~c~0=v_main_~c~0_8, main_#t~post5=|v_main_#t~post5_9|} OutVars{~counter~0=v_~counter~0_9, main_~x~0=v_main_~x~0_12, main_~k~0=v_main_~k~0_6, main_~y~0=v_main_~y~0_12, main_~c~0=v_main_~c~0_7, main_#t~post5=|v_main_#t~post5_7|} AuxVars[] AssignedVars[~counter~0, main_~x~0, main_~y~0, main_~c~0, main_#t~post5] {571#(or (and (< 0 (div (* (- 1) main_~y~0) (- 2))) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0) (= ~counter~0 (* (div (* (- 1) main_~y~0) (- 2)) 2)) (< (div (* (- 1) main_~y~0) (- 2)) 2)) (and (= main_~x~0 0) (= ~counter~0 0) (= main_~y~0 0)) (and (= (mod (+ ~counter~0 1) 2) 0) (< (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 1) (= main_~x~0 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 3) (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 2) 1)) (= main_~y~0 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 2) 1)) (<= 0 (div (+ (* ~counter~0 (- 1)) 1) (- 2)))))} is VALID [2022-04-15 10:40:36,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#(or (and (< 0 (div (* (- 1) main_~y~0) (- 2))) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0) (= ~counter~0 (* (div (* (- 1) main_~y~0) (- 2)) 2)) (< (div (* (- 1) main_~y~0) (- 2)) 2)) (and (= main_~x~0 0) (= ~counter~0 0) (= main_~y~0 0)) (and (= (mod (+ ~counter~0 1) 2) 0) (< (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 1) (= main_~x~0 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 3) (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 2) 1)) (= main_~y~0 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 2) 1)) (<= 0 (div (+ (* ~counter~0 (- 1)) 1) (- 2)))))} [57] L27-1_primed-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {575#(or (and (<= |main_#t~post5| 0) (= main_~x~0 0) (= main_~y~0 0)) (and (<= (div (+ (- 1) main_~y~0) (- 2)) 0) (<= (+ |main_#t~post5| (* (div (+ (- 1) main_~y~0) (- 2)) 2)) 1) (exists ((aux_div_v_~counter~0_12_43 Int)) (and (<= 0 (+ (* (div (+ (- 1) main_~y~0) (- 2)) 2) (* aux_div_v_~counter~0_12_43 2))) (< (+ (* (div (+ (- 1) main_~y~0) (- 2)) 2) (* aux_div_v_~counter~0_12_43 2)) 2) (= main_~x~0 (+ (* aux_div_v_~counter~0_12_43 3) (* (* aux_div_v_~counter~0_12_43 aux_div_v_~counter~0_12_43) 2) 1)))) (< 0 (+ (div (+ (- 1) main_~y~0) (- 2)) 1)) (= (mod (+ main_~y~0 1) 2) 0)) (and (< 0 (div (* (- 1) main_~y~0) (- 2))) (<= |main_#t~post5| (* (div (* (- 1) main_~y~0) (- 2)) 2)) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0) (< (div (* (- 1) main_~y~0) (- 2)) 2)))} is VALID [2022-04-15 10:40:36,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {575#(or (and (<= |main_#t~post5| 0) (= main_~x~0 0) (= main_~y~0 0)) (and (<= (div (+ (- 1) main_~y~0) (- 2)) 0) (<= (+ |main_#t~post5| (* (div (+ (- 1) main_~y~0) (- 2)) 2)) 1) (exists ((aux_div_v_~counter~0_12_43 Int)) (and (<= 0 (+ (* (div (+ (- 1) main_~y~0) (- 2)) 2) (* aux_div_v_~counter~0_12_43 2))) (< (+ (* (div (+ (- 1) main_~y~0) (- 2)) 2) (* aux_div_v_~counter~0_12_43 2)) 2) (= main_~x~0 (+ (* aux_div_v_~counter~0_12_43 3) (* (* aux_div_v_~counter~0_12_43 aux_div_v_~counter~0_12_43) 2) 1)))) (< 0 (+ (div (+ (- 1) main_~y~0) (- 2)) 1)) (= (mod (+ main_~y~0 1) 2) 0)) (and (< 0 (div (* (- 1) main_~y~0) (- 2))) (<= |main_#t~post5| (* (div (* (- 1) main_~y~0) (- 2)) 2)) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0) (< (div (* (- 1) main_~y~0) (- 2)) 2)))} assume !(#t~post5 < 2);havoc #t~post5; {579#(and (< 0 (div (* (- 1) main_~y~0) (- 2))) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0) (< (div (* (- 1) main_~y~0) (- 2)) 2))} is VALID [2022-04-15 10:40:36,009 INFO L272 TraceCheckUtils]: 9: Hoare triple {579#(and (< 0 (div (* (- 1) main_~y~0) (- 2))) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0) (< (div (* (- 1) main_~y~0) (- 2)) 2))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:40:36,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:40:36,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {547#false} is VALID [2022-04-15 10:40:36,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-15 10:40:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:40:36,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:40:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:40:36,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105424376] [2022-04-15 10:40:36,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:40:36,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929098139] [2022-04-15 10:40:36,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929098139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:40:36,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:40:36,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 10:40:37,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:40:37,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996137111] [2022-04-15 10:40:37,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996137111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:40:37,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:40:37,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 10:40:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401468731] [2022-04-15 10:40:37,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:40:37,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 10:40:37,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:40:37,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:40:37,295 WARN L143 InductivityCheck]: Transition 597#(and (exists ((v_main_~x~0_BEFORE_CALL_4 Int) (v_main_~y~0_BEFORE_CALL_4 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (and (or (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1) (= (+ (* v_main_~x~0_BEFORE_CALL_4 (- 2)) (* v_main_~y~0_BEFORE_CALL_4 v_main_~y~0_BEFORE_CALL_4) v_main_~y~0_BEFORE_CALL_4) 0)) (and (not (= (+ (* v_main_~x~0_BEFORE_CALL_4 (- 2)) (* v_main_~y~0_BEFORE_CALL_4 v_main_~y~0_BEFORE_CALL_4) v_main_~y~0_BEFORE_CALL_4) 0)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0))) (or (and (= v_main_~x~0_BEFORE_CALL_4 (+ (* (* (div (+ (* ~counter~0 (- 1)) 2) (- 2)) (div (+ (* ~counter~0 (- 1)) 2) (- 2))) 2) (* (div (+ (* ~counter~0 (- 1)) 2) (- 2)) 3) 1)) (= v_main_~y~0_BEFORE_CALL_4 (+ (* (div (+ (* ~counter~0 (- 1)) 2) (- 2)) 2) 1)) (= (mod ~counter~0 2) 0) (<= 0 (div (+ (* ~counter~0 (- 1)) 2) (- 2)))) (and (= v_main_~x~0_BEFORE_CALL_4 0) (= v_main_~y~0_BEFORE_CALL_4 0) (= ~counter~0 1))) (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)) (< ~counter~0 3)) ( _ , #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; , 575#(or (and (<= |main_#t~post5| 0) (= main_~x~0 0) (= main_~y~0 0)) (and (<= (div (+ (- 1) main_~y~0) (- 2)) 0) (<= (+ |main_#t~post5| (* (div (+ (- 1) main_~y~0) (- 2)) 2)) 1) (exists ((aux_div_v_~counter~0_12_43 Int)) (and (<= 0 (+ (* (div (+ (- 1) main_~y~0) (- 2)) 2) (* aux_div_v_~counter~0_12_43 2))) (< (+ (* (div (+ (- 1) main_~y~0) (- 2)) 2) (* aux_div_v_~counter~0_12_43 2)) 2) (= main_~x~0 (+ (* aux_div_v_~counter~0_12_43 3) (* (* aux_div_v_~counter~0_12_43 aux_div_v_~counter~0_12_43) 2) 1)))) (< 0 (+ (div (+ (- 1) main_~y~0) (- 2)) 1)) (= (mod (+ main_~y~0 1) 2) 0)) (and (< 0 (div (* (- 1) main_~y~0) (- 2))) (<= |main_#t~post5| (* (div (* (- 1) main_~y~0) (- 2)) 2)) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0) (< (div (* (- 1) main_~y~0) (- 2)) 2))) ) not inductive [2022-04-15 10:40:37,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 10:40:37,496 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:40:37,496 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 10:40:37,500 INFO L158 Benchmark]: Toolchain (without parser) took 15687.89ms. Allocated memory was 188.7MB in the beginning and 254.8MB in the end (delta: 66.1MB). Free memory was 134.2MB in the beginning and 199.9MB in the end (delta: -65.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 10:40:37,500 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 10:40:37,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.93ms. Allocated memory is still 188.7MB. Free memory was 134.0MB in the beginning and 164.2MB in the end (delta: -30.2MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-04-15 10:40:37,500 INFO L158 Benchmark]: Boogie Preprocessor took 23.10ms. Allocated memory is still 188.7MB. Free memory was 164.2MB in the beginning and 162.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 10:40:37,500 INFO L158 Benchmark]: RCFGBuilder took 281.36ms. Allocated memory is still 188.7MB. Free memory was 162.5MB in the beginning and 151.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 10:40:37,501 INFO L158 Benchmark]: TraceAbstraction took 15178.21ms. Allocated memory was 188.7MB in the beginning and 254.8MB in the end (delta: 66.1MB). Free memory was 151.1MB in the beginning and 199.9MB in the end (delta: -48.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-04-15 10:40:37,503 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.93ms. Allocated memory is still 188.7MB. Free memory was 134.0MB in the beginning and 164.2MB in the end (delta: -30.2MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.10ms. Allocated memory is still 188.7MB. Free memory was 164.2MB in the beginning and 162.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 281.36ms. Allocated memory is still 188.7MB. Free memory was 162.5MB in the beginning and 151.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15178.21ms. Allocated memory was 188.7MB in the beginning and 254.8MB in the end (delta: 66.1MB). Free memory was 151.1MB in the beginning and 199.9MB in the end (delta: -48.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 10:40:37,522 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...