/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 16:39:44,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 16:39:44,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 16:39:45,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 16:39:45,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 16:39:45,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 16:39:45,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 16:39:45,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 16:39:45,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 16:39:45,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 16:39:45,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 16:39:45,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 16:39:45,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 16:39:45,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 16:39:45,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 16:39:45,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 16:39:45,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 16:39:45,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 16:39:45,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 16:39:45,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 16:39:45,022 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 16:39:45,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 16:39:45,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 16:39:45,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 16:39:45,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 16:39:45,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 16:39:45,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 16:39:45,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 16:39:45,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 16:39:45,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 16:39:45,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 16:39:45,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 16:39:45,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 16:39:45,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 16:39:45,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 16:39:45,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 16:39:45,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 16:39:45,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 16:39:45,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 16:39:45,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 16:39:45,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 16:39:45,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 16:39:45,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 16:39:45,052 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 16:39:45,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 16:39:45,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 16:39:45,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 16:39:45,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 16:39:45,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 16:39:45,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 16:39:45,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 16:39:45,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 16:39:45,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 16:39:45,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 16:39:45,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 16:39:45,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 16:39:45,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 16:39:45,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 16:39:45,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 16:39:45,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 16:39:45,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 16:39:45,059 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 16:39:45,059 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 16:39:45,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 16:39:45,060 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 16:39:45,060 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 16:39:45,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 16:39:45,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 16:39:45,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 16:39:45,325 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 16:39:45,327 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 16:39:45,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound2.c [2022-04-15 16:39:45,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02571e5e/6c6ee87e242943bf8af5dc341af238ab/FLAG2299f024d [2022-04-15 16:39:45,787 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 16:39:45,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound2.c [2022-04-15 16:39:45,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02571e5e/6c6ee87e242943bf8af5dc341af238ab/FLAG2299f024d [2022-04-15 16:39:46,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02571e5e/6c6ee87e242943bf8af5dc341af238ab [2022-04-15 16:39:46,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 16:39:46,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 16:39:46,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 16:39:46,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 16:39:46,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 16:39:46,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:39:46" (1/1) ... [2022-04-15 16:39:46,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e023826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46, skipping insertion in model container [2022-04-15 16:39:46,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:39:46" (1/1) ... [2022-04-15 16:39:46,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 16:39:46,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 16:39:46,348 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_valuebound2.c[454,467] [2022-04-15 16:39:46,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 16:39:46,372 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 16:39:46,382 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_valuebound2.c[454,467] [2022-04-15 16:39:46,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 16:39:46,406 INFO L208 MainTranslator]: Completed translation [2022-04-15 16:39:46,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46 WrapperNode [2022-04-15 16:39:46,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 16:39:46,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 16:39:46,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 16:39:46,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 16:39:46,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46" (1/1) ... [2022-04-15 16:39:46,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46" (1/1) ... [2022-04-15 16:39:46,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46" (1/1) ... [2022-04-15 16:39:46,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46" (1/1) ... [2022-04-15 16:39:46,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46" (1/1) ... [2022-04-15 16:39:46,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46" (1/1) ... [2022-04-15 16:39:46,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46" (1/1) ... [2022-04-15 16:39:46,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 16:39:46,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 16:39:46,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 16:39:46,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 16:39:46,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46" (1/1) ... [2022-04-15 16:39:46,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 16:39:46,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:39:46,476 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 16:39:46,497 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 16:39:46,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 16:39:46,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 16:39:46,511 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 16:39:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 16:39:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 16:39:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 16:39:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 16:39:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 16:39:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 16:39:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 16:39:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 16:39:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 16:39:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 16:39:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 16:39:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 16:39:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 16:39:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 16:39:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 16:39:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 16:39:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 16:39:46,572 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 16:39:46,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 16:39:46,713 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 16:39:46,733 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 16:39:46,733 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 16:39:46,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:39:46 BoogieIcfgContainer [2022-04-15 16:39:46,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 16:39:46,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 16:39:46,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 16:39:46,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 16:39:46,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 04:39:46" (1/3) ... [2022-04-15 16:39:46,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9c0986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:39:46, skipping insertion in model container [2022-04-15 16:39:46,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:39:46" (2/3) ... [2022-04-15 16:39:46,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9c0986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:39:46, skipping insertion in model container [2022-04-15 16:39:46,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:39:46" (3/3) ... [2022-04-15 16:39:46,742 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_valuebound2.c [2022-04-15 16:39:46,745 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 16:39:46,746 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 16:39:46,777 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 16:39:46,783 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 16:39:46,783 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 16:39:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 16:39:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 16:39:46,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:39:46,803 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:39:46,804 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:39:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:39:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1914087080, now seen corresponding path program 1 times [2022-04-15 16:39:46,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:39:46,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [309794930] [2022-04-15 16:39:46,833 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:39:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1914087080, now seen corresponding path program 2 times [2022-04-15 16:39:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:39:46,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701462754] [2022-04-15 16:39:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:39:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:39:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:39:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 16:39:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:39:47,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-04-15 16:39:47,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-15 16:39:47,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID [2022-04-15 16:39:47,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 16:39:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:39:47,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-04-15 16:39:47,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-04-15 16:39:47,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-04-15 16:39:47,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} #51#return; {31#false} is VALID [2022-04-15 16:39:47,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 16:39:47,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-04-15 16:39:47,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-15 16:39:47,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID [2022-04-15 16:39:47,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-15 16:39:47,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4; {30#true} is VALID [2022-04-15 16:39:47,075 INFO L272 TraceCheckUtils]: 6: Hoare triple {30#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {30#true} is VALID [2022-04-15 16:39:47,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-04-15 16:39:47,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-04-15 16:39:47,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume true; {31#false} is VALID [2022-04-15 16:39:47,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31#false} {30#true} #51#return; {31#false} is VALID [2022-04-15 16:39:47,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {31#false} is VALID [2022-04-15 16:39:47,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume false; {31#false} is VALID [2022-04-15 16:39:47,077 INFO L272 TraceCheckUtils]: 13: Hoare triple {31#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {31#false} is VALID [2022-04-15 16:39:47,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-04-15 16:39:47,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-04-15 16:39:47,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-15 16:39:47,078 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 16:39:47,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:39:47,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701462754] [2022-04-15 16:39:47,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701462754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:39:47,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:39:47,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 16:39:47,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:39:47,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [309794930] [2022-04-15 16:39:47,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [309794930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:39:47,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:39:47,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 16:39:47,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334121163] [2022-04-15 16:39:47,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:39:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 16:39:47,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:39:47,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 16:39:47,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:39:47,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 16:39:47,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:39:47,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 16:39:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 16:39:47,178 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 16:39:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:39:47,286 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 16:39:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 16:39:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 16:39:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:39:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 16:39:47,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-15 16:39:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 16:39:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-15 16:39:47,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-04-15 16:39:47,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:39:47,374 INFO L225 Difference]: With dead ends: 45 [2022-04-15 16:39:47,374 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 16:39:47,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 16:39:47,380 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 16:39:47,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 16:39:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 16:39:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 16:39:47,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:39:47,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 16:39:47,407 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 16:39:47,407 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 16:39:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:39:47,411 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 16:39:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 16:39:47,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:39:47,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:39:47,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-15 16:39:47,413 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-15 16:39:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:39:47,416 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 16:39:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 16:39:47,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:39:47,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:39:47,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:39:47,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:39:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 16:39:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-15 16:39:47,421 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-15 16:39:47,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:39:47,422 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-15 16:39:47,422 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 16:39:47,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-15 16:39:47,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:39:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 16:39:47,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 16:39:47,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:39:47,449 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:39:47,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 16:39:47,450 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:39:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:39:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1699034386, now seen corresponding path program 1 times [2022-04-15 16:39:47,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:39:47,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849418017] [2022-04-15 16:39:47,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:39:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1699034386, now seen corresponding path program 2 times [2022-04-15 16:39:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:39:47,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812388509] [2022-04-15 16:39:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:39:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:39:47,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:39:47,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860809566] [2022-04-15 16:39:47,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:39:47,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:39:47,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:39:47,473 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 16:39:47,515 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 16:39:47,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 16:39:47,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:39:47,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 16:39:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:39:47,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:39:47,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2022-04-15 16:39:47,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {220#true} is VALID [2022-04-15 16:39:47,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID [2022-04-15 16:39:47,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #57#return; {220#true} is VALID [2022-04-15 16:39:47,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret5 := main(); {220#true} is VALID [2022-04-15 16:39:47,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4; {220#true} is VALID [2022-04-15 16:39:47,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {220#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {220#true} is VALID [2022-04-15 16:39:47,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#true} ~cond := #in~cond; {220#true} is VALID [2022-04-15 16:39:47,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#true} assume !(0 == ~cond); {220#true} is VALID [2022-04-15 16:39:47,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#true} assume true; {220#true} is VALID [2022-04-15 16:39:47,745 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {220#true} {220#true} #51#return; {220#true} is VALID [2022-04-15 16:39:47,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {220#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {258#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 16:39:47,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {258#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 16:39:47,748 INFO L272 TraceCheckUtils]: 13: Hoare triple {258#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:39:47,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:39:47,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {221#false} is VALID [2022-04-15 16:39:47,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {221#false} assume !false; {221#false} is VALID [2022-04-15 16:39:47,750 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 16:39:47,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 16:39:47,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:39:47,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812388509] [2022-04-15 16:39:47,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:39:47,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860809566] [2022-04-15 16:39:47,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860809566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:39:47,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:39:47,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 16:39:47,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:39:47,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849418017] [2022-04-15 16:39:47,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849418017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:39:47,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:39:47,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 16:39:47,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597896376] [2022-04-15 16:39:47,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:39:47,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 16:39:47,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:39:47,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 16:39:47,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:39:47,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 16:39:47,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:39:47,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 16:39:47,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 16:39:47,771 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 16:39:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:39:47,889 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 16:39:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 16:39:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 16:39:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:39:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 16:39:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-15 16:39:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 16:39:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-15 16:39:47,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-04-15 16:39:47,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:39:47,937 INFO L225 Difference]: With dead ends: 32 [2022-04-15 16:39:47,937 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 16:39:47,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 16:39:47,941 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 16:39:47,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 16:39:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 16:39:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 16:39:47,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:39:47,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 16:39:47,962 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 16:39:47,962 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 16:39:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:39:47,965 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 16:39:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 16:39:47,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:39:47,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:39:47,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 16:39:47,967 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 16:39:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:39:47,975 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 16:39:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 16:39:47,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:39:47,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:39:47,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:39:47,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:39:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 16:39:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-15 16:39:47,981 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2022-04-15 16:39:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:39:47,982 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-15 16:39:47,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 16:39:47,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-15 16:39:48,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:39:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 16:39:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 16:39:48,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:39:48,021 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:39:48,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 16:39:48,239 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 16:39:48,240 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:39:48,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:39:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash 276758134, now seen corresponding path program 1 times [2022-04-15 16:39:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:39:48,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [190704216] [2022-04-15 16:43:57,777 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 16:43:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash 22480176, now seen corresponding path program 1 times [2022-04-15 16:43:57,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:43:57,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379169387] [2022-04-15 16:43:57,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:43:57,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:43:57,810 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:43:57,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1124971374] [2022-04-15 16:43:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:43:57,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:43:57,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:43:57,823 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 16:43:57,826 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 16:43:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 16:43:57,855 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 16:43:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 16:43:57,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 16:43:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash 276758134, now seen corresponding path program 2 times [2022-04-15 16:43:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:43:57,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235738895] [2022-04-15 16:43:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:43:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:43:57,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:43:57,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578013028] [2022-04-15 16:43:57,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:43:57,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:43:57,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:43:57,978 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 16:43:57,991 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 16:43:58,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:43:58,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:43:58,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 16:43:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:43:58,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:43:58,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-15 16:43:58,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {457#true} is VALID [2022-04-15 16:43:58,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 16:43:58,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #57#return; {457#true} is VALID [2022-04-15 16:43:58,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-15 16:43:58,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4; {457#true} is VALID [2022-04-15 16:43:58,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {457#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {457#true} is VALID [2022-04-15 16:43:58,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID [2022-04-15 16:43:58,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#true} assume !(0 == ~cond); {457#true} is VALID [2022-04-15 16:43:58,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 16:43:58,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {457#true} {457#true} #51#return; {457#true} is VALID [2022-04-15 16:43:58,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {495#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 16:43:58,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {495#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {495#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 16:43:58,200 INFO L272 TraceCheckUtils]: 13: Hoare triple {495#(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)); {457#true} is VALID [2022-04-15 16:43:58,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID [2022-04-15 16:43:58,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {457#true} assume !(0 == ~cond); {457#true} is VALID [2022-04-15 16:43:58,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 16:43:58,202 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {457#true} {495#(and (= main_~x~0 0) (= main_~y~0 0))} #53#return; {495#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 16:43:58,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {495#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {517#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-15 16:43:58,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {517#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} assume !false; {517#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-15 16:43:58,205 INFO L272 TraceCheckUtils]: 20: Hoare triple {517#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:43:58,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {528#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:43:58,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {458#false} is VALID [2022-04-15 16:43:58,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-15 16:43:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 16:43:58,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:43:58,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-15 16:43:58,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {458#false} is VALID [2022-04-15 16:43:58,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {528#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:43:58,349 INFO L272 TraceCheckUtils]: 20: Hoare triple {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:43:58,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !false; {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 16:43:58,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 16:43:58,352 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {457#true} {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} #53#return; {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 16:43:58,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 16:43:58,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {457#true} assume !(0 == ~cond); {457#true} is VALID [2022-04-15 16:43:58,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID [2022-04-15 16:43:58,353 INFO L272 TraceCheckUtils]: 13: Hoare triple {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {457#true} is VALID [2022-04-15 16:43:58,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !false; {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 16:43:58,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {544#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 16:43:58,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {457#true} {457#true} #51#return; {457#true} is VALID [2022-04-15 16:43:58,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 16:43:58,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#true} assume !(0 == ~cond); {457#true} is VALID [2022-04-15 16:43:58,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID [2022-04-15 16:43:58,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {457#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {457#true} is VALID [2022-04-15 16:43:58,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4; {457#true} is VALID [2022-04-15 16:43:58,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-15 16:43:58,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #57#return; {457#true} is VALID [2022-04-15 16:43:58,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 16:43:58,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {457#true} is VALID [2022-04-15 16:43:58,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-15 16:43:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 16:43:58,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:43:58,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235738895] [2022-04-15 16:43:58,360 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:43:58,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578013028] [2022-04-15 16:43:58,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578013028] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 16:43:58,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 16:43:58,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 16:43:58,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:43:58,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [190704216] [2022-04-15 16:43:58,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [190704216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:43:58,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:43:58,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 16:43:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549705952] [2022-04-15 16:43:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:43:58,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-15 16:43:58,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:43:58,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 16:43:58,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:43:58,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 16:43:58,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:43:58,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 16:43:58,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 16:43:58,391 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 16:43:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:43:58,484 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 16:43:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 16:43:58,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-15 16:43:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:43:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 16:43:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-04-15 16:43:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 16:43:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-04-15 16:43:58,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2022-04-15 16:43:58,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:43:58,515 INFO L225 Difference]: With dead ends: 29 [2022-04-15 16:43:58,519 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 16:43:58,520 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 16:43:58,526 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 16:43:58,528 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 16:43:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 16:43:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 16:43:58,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:43:58,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:43:58,531 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:43:58,531 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:43:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:43:58,532 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 16:43:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 16:43:58,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:43:58,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:43:58,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 16:43:58,532 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 16:43:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:43:58,532 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 16:43:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 16:43:58,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:43:58,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:43:58,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:43:58,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:43:58,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:43:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 16:43:58,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-15 16:43:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:43:58,534 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 16:43:58,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 16:43:58,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 16:43:58,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:43:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 16:43:58,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:43:58,536 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 16:43:58,565 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 16:43:58,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 16:43:58,963 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,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:43:58,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 16:43:59,086 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 16:43:59,086 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 16:43:59,086 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 16:43:59,087 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-15 16:43:59,087 INFO L885 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: true [2022-04-15 16:43:59,087 INFO L885 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: true [2022-04-15 16:43:59,087 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: true [2022-04-15 16:43:59,087 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-15 16:43:59,087 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0))) [2022-04-15 16:43:59,087 INFO L878 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0))) [2022-04-15 16:43:59,087 INFO L878 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0))) [2022-04-15 16:43:59,087 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 40) the Hoare annotation is: true [2022-04-15 16:43:59,088 INFO L878 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0))) [2022-04-15 16:43:59,088 INFO L885 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-15 16:43:59,088 INFO L885 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: true [2022-04-15 16:43:59,088 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 40) the Hoare annotation is: true [2022-04-15 16:43:59,088 INFO L885 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: true [2022-04-15 16:43:59,088 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 16:43:59,088 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 16:43:59,089 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 16:43:59,089 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 16:43:59,089 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 16:43:59,089 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 16:43:59,089 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 16:43:59,089 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-15 16:43:59,089 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 16:43:59,089 INFO L878 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 16:43:59,089 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 16:43:59,090 INFO L878 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 16:43:59,090 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 16:43:59,100 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1] [2022-04-15 16:43:59,101 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 16:43:59,105 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 16:43:59,106 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 16:43:59,115 INFO L163 areAnnotationChecker]: CFG has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 16:43:59,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 04:43:59 BoogieIcfgContainer [2022-04-15 16:43:59,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 16:43:59,123 INFO L158 Benchmark]: Toolchain (without parser) took 252934.10ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 136.2MB in the beginning and 157.1MB in the end (delta: -21.0MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2022-04-15 16:43:59,124 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 16:43:59,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.11ms. Allocated memory is still 184.5MB. Free memory was 136.0MB in the beginning and 162.2MB in the end (delta: -26.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 16:43:59,124 INFO L158 Benchmark]: Boogie Preprocessor took 39.03ms. Allocated memory is still 184.5MB. Free memory was 162.2MB in the beginning and 160.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 16:43:59,125 INFO L158 Benchmark]: RCFGBuilder took 287.21ms. Allocated memory is still 184.5MB. Free memory was 160.7MB in the beginning and 150.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 16:43:59,125 INFO L158 Benchmark]: TraceAbstraction took 252386.26ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 149.7MB in the beginning and 157.1MB in the end (delta: -7.4MB). Peak memory consumption was 40.0MB. Max. memory is 8.0GB. [2022-04-15 16:43:59,126 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.11ms. Allocated memory is still 184.5MB. Free memory was 136.0MB in the beginning and 162.2MB in the end (delta: -26.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.03ms. Allocated memory is still 184.5MB. Free memory was 162.2MB in the beginning and 160.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 287.21ms. Allocated memory is still 184.5MB. Free memory was 160.7MB in the beginning and 150.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 252386.26ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 149.7MB in the beginning and 157.1MB in the end (delta: -7.4MB). Peak memory consumption was 40.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 252.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 62 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 57 PreInvPairs, 85 NumberOfFragments, 92 HoareAnnotationTreeSize, 57 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 71 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: x * 2 == y + y * y - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-15 16:43:59,144 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...