/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:30:45,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:30:45,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:30:45,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:30:45,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:30:45,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:30:45,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:30:45,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:30:45,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:30:45,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:30:45,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:30:45,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:30:45,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:30:45,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:30:45,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:30:45,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:30:45,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:30:45,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:30:45,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:30:45,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:30:45,618 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:30:45,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:30:45,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:30:45,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:30:45,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:30:45,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:30:45,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:30:45,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:30:45,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:30:45,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:30:45,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:30:45,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:30:45,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:30:45,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:30:45,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:30:45,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:30:45,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:30:45,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:30:45,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:30:45,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:30:45,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:30:45,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:30:45,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:30:45,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:30:45,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:30:45,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:30:45,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:30:45,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:30:45,655 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:30:45,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:30:45,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:30:45,655 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:30:45,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:30:45,656 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:30:45,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:30:45,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:30:45,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:30:45,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:30:45,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:30:45,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:30:45,656 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:30:45,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:30:45,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:30:45,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:30:45,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:30:45,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:30:45,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:30:45,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:30:45,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:30:45,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:30:45,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:30:45,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:30:45,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:30:45,658 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:30:45,658 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:30:45,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:30:45,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 14:30:45,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:30:45,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:30:45,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:30:45,867 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:30:45,867 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:30:45,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound5.c [2022-04-27 14:30:45,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f643ea309/b6001f2f5e2147b28ef2c63950e994f0/FLAGc2b9ecc82 [2022-04-27 14:30:46,286 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:30:46,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound5.c [2022-04-27 14:30:46,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f643ea309/b6001f2f5e2147b28ef2c63950e994f0/FLAGc2b9ecc82 [2022-04-27 14:30:46,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f643ea309/b6001f2f5e2147b28ef2c63950e994f0 [2022-04-27 14:30:46,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:30:46,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:30:46,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:30:46,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:30:46,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:30:46,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:30:46" (1/1) ... [2022-04-27 14:30:46,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7747991f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46, skipping insertion in model container [2022-04-27 14:30:46,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:30:46" (1/1) ... [2022-04-27 14:30:46,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:30:46,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:30:46,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound5.c[454,467] [2022-04-27 14:30:46,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:30:46,500 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:30:46,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound5.c[454,467] [2022-04-27 14:30:46,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:30:46,524 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:30:46,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46 WrapperNode [2022-04-27 14:30:46,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:30:46,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:30:46,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:30:46,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:30:46,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46" (1/1) ... [2022-04-27 14:30:46,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46" (1/1) ... [2022-04-27 14:30:46,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46" (1/1) ... [2022-04-27 14:30:46,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46" (1/1) ... [2022-04-27 14:30:46,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46" (1/1) ... [2022-04-27 14:30:46,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46" (1/1) ... [2022-04-27 14:30:46,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46" (1/1) ... [2022-04-27 14:30:46,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:30:46,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:30:46,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:30:46,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:30:46,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46" (1/1) ... [2022-04-27 14:30:46,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:30:46,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:30:46,579 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-27 14:30:46,584 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-27 14:30:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:30:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:30:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:30:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:30:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:30:46,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:30:46,613 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:30:46,613 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:30:46,613 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:30:46,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:30:46,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:30:46,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:30:46,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:30:46,613 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:30:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:30:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:30:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:30:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:30:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:30:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:30:46,662 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:30:46,665 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:30:46,776 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:30:46,782 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:30:46,782 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:30:46,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:30:46 BoogieIcfgContainer [2022-04-27 14:30:46,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:30:46,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:30:46,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:30:46,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:30:46,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:30:46" (1/3) ... [2022-04-27 14:30:46,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f5bdcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:30:46, skipping insertion in model container [2022-04-27 14:30:46,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:30:46" (2/3) ... [2022-04-27 14:30:46,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f5bdcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:30:46, skipping insertion in model container [2022-04-27 14:30:46,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:30:46" (3/3) ... [2022-04-27 14:30:46,792 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_valuebound5.c [2022-04-27 14:30:46,803 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:30:46,803 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:30:46,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:30:46,846 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e17e978, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@dc86016 [2022-04-27 14:30:46,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:30:46,853 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-27 14:30:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:30:46,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:30:46,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:30:46,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:30:46,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:30:46,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1914087080, now seen corresponding path program 1 times [2022-04-27 14:30:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:30:46,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262572956] [2022-04-27 14:30:46,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:46,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:30:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:47,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:30:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:47,047 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-27 14:30:47,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-27 14:30:47,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID [2022-04-27 14:30:47,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:30:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:47,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-04-27 14:30:47,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-04-27 14:30:47,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-04-27 14:30:47,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} #51#return; {31#false} is VALID [2022-04-27 14:30:47,058 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-27 14:30:47,058 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-27 14:30:47,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-27 14:30:47,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID [2022-04-27 14:30:47,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-27 14:30:47,059 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-27 14:30:47,059 INFO L272 TraceCheckUtils]: 6: Hoare triple {30#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {30#true} is VALID [2022-04-27 14:30:47,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-04-27 14:30:47,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-04-27 14:30:47,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume true; {31#false} is VALID [2022-04-27 14:30:47,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31#false} {30#true} #51#return; {31#false} is VALID [2022-04-27 14:30:47,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {31#false} is VALID [2022-04-27 14:30:47,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume false; {31#false} is VALID [2022-04-27 14:30:47,061 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-27 14:30:47,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-04-27 14:30:47,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-04-27 14:30:47,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-27 14:30:47,062 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-27 14:30:47,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:30:47,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262572956] [2022-04-27 14:30:47,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262572956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:30:47,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:30:47,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:30:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600458553] [2022-04-27 14:30:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:30:47,069 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-27 14:30:47,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:30:47,073 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-27 14:30:47,092 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-27 14:30:47,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:30:47,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:30:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:30:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:30:47,112 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-27 14:30:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:47,186 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 14:30:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:30:47,187 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-27 14:30:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:30:47,188 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-27 14:30:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-27 14:30:47,196 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-27 14:30:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-27 14:30:47,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-04-27 14:30:47,262 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-27 14:30:47,269 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:30:47,269 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 14:30:47,272 INFO L412 NwaCegarLoop]: 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-27 14:30:47,275 INFO L413 NwaCegarLoop]: 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-27 14:30:47,275 INFO L414 NwaCegarLoop]: 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-27 14:30:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 14:30:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 14:30:47,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:30:47,304 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-27 14:30:47,305 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-27 14:30:47,305 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-27 14:30:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:47,310 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 14:30:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 14:30:47,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:47,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:47,311 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-27 14:30:47,312 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-27 14:30:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:47,314 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 14:30:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 14:30:47,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:47,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:47,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:30:47,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:30:47,315 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-27 14:30:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-27 14:30:47,318 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-27 14:30:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:30:47,318 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-27 14:30:47,318 INFO L496 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-27 14:30:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 14:30:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:30:47,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:30:47,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:30:47,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:30:47,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:30:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:30:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1699034386, now seen corresponding path program 1 times [2022-04-27 14:30:47,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:30:47,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348258373] [2022-04-27 14:30:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:47,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:30:47,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:30:47,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495425961] [2022-04-27 14:30:47,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:47,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:30:47,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:30:47,347 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-27 14:30:47,349 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-27 14:30:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:47,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:30:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:47,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:30:47,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2022-04-27 14:30:47,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#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); {177#true} is VALID [2022-04-27 14:30:47,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-27 14:30:47,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #57#return; {177#true} is VALID [2022-04-27 14:30:47,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret5 := main(); {177#true} is VALID [2022-04-27 14:30:47,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#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; {177#true} is VALID [2022-04-27 14:30:47,551 INFO L272 TraceCheckUtils]: 6: Hoare triple {177#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {177#true} is VALID [2022-04-27 14:30:47,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#true} ~cond := #in~cond; {177#true} is VALID [2022-04-27 14:30:47,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {177#true} assume !(0 == ~cond); {177#true} is VALID [2022-04-27 14:30:47,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-27 14:30:47,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {177#true} {177#true} #51#return; {177#true} is VALID [2022-04-27 14:30:47,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {177#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {215#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:30:47,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {215#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {215#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:30:47,554 INFO L272 TraceCheckUtils]: 13: Hoare triple {215#(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)); {222#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:30:47,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {222#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {226#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:47,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {226#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {178#false} is VALID [2022-04-27 14:30:47,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-04-27 14:30:47,555 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-27 14:30:47,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:30:47,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:30:47,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348258373] [2022-04-27 14:30:47,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:30:47,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495425961] [2022-04-27 14:30:47,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495425961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:30:47,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:30:47,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:30:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723422221] [2022-04-27 14:30:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:30:47,564 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-27 14:30:47,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:30:47,567 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-27 14:30:47,587 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-27 14:30:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:30:47,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:30:47,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:30:47,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:30:47,589 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-27 14:30:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:47,705 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-27 14:30:47,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:30:47,706 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-27 14:30:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:30:47,708 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-27 14:30:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-27 14:30:47,720 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-27 14:30:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-27 14:30:47,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-04-27 14:30:47,753 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-27 14:30:47,757 INFO L225 Difference]: With dead ends: 32 [2022-04-27 14:30:47,758 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 14:30:47,758 INFO L412 NwaCegarLoop]: 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-27 14:30:47,760 INFO L413 NwaCegarLoop]: 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-27 14:30:47,760 INFO L414 NwaCegarLoop]: 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-27 14:30:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 14:30:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 14:30:47,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:30:47,768 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-27 14:30:47,769 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-27 14:30:47,769 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-27 14:30:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:47,772 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 14:30:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 14:30:47,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:47,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:47,773 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-27 14:30:47,774 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-27 14:30:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:47,776 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 14:30:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 14:30:47,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:47,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:47,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:30:47,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:30:47,777 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-27 14:30:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-27 14:30:47,779 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2022-04-27 14:30:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:30:47,779 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-27 14:30:47,779 INFO L496 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-27 14:30:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 14:30:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 14:30:47,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:30:47,780 INFO L195 NwaCegarLoop]: 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-27 14:30:47,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:30:47,987 WARN L477 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-27 14:30:47,988 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:30:47,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:30:47,989 INFO L85 PathProgramCache]: Analyzing trace with hash 276758134, now seen corresponding path program 1 times [2022-04-27 14:30:47,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:30:47,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796759122] [2022-04-27 14:30:47,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:30:48,005 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:30:48,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881801451] [2022-04-27 14:30:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:48,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:30:48,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:30:48,007 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-27 14:30:48,028 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-27 14:30:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:48,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:30:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:48,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:30:48,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {380#true} call ULTIMATE.init(); {380#true} is VALID [2022-04-27 14:30:48,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {380#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); {380#true} is VALID [2022-04-27 14:30:48,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {380#true} assume true; {380#true} is VALID [2022-04-27 14:30:48,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {380#true} {380#true} #57#return; {380#true} is VALID [2022-04-27 14:30:48,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {380#true} call #t~ret5 := main(); {380#true} is VALID [2022-04-27 14:30:48,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {380#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; {380#true} is VALID [2022-04-27 14:30:48,270 INFO L272 TraceCheckUtils]: 6: Hoare triple {380#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {380#true} is VALID [2022-04-27 14:30:48,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {380#true} ~cond := #in~cond; {380#true} is VALID [2022-04-27 14:30:48,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {380#true} assume !(0 == ~cond); {380#true} is VALID [2022-04-27 14:30:48,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#true} assume true; {380#true} is VALID [2022-04-27 14:30:48,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {380#true} {380#true} #51#return; {380#true} is VALID [2022-04-27 14:30:48,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {380#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {418#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:30:48,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {418#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:30:48,278 INFO L272 TraceCheckUtils]: 13: Hoare triple {418#(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)); {380#true} is VALID [2022-04-27 14:30:48,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#true} ~cond := #in~cond; {380#true} is VALID [2022-04-27 14:30:48,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {380#true} assume !(0 == ~cond); {380#true} is VALID [2022-04-27 14:30:48,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {380#true} assume true; {380#true} is VALID [2022-04-27 14:30:48,280 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {380#true} {418#(and (= main_~x~0 0) (= main_~y~0 0))} #53#return; {418#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:30:48,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {418#(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; {440#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 14:30:48,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {440#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} assume !false; {440#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 14:30:48,282 INFO L272 TraceCheckUtils]: 20: Hoare triple {440#(and (= main_~y~0 1) (= (+ 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)); {447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:30:48,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:48,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {381#false} is VALID [2022-04-27 14:30:48,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {381#false} assume !false; {381#false} is VALID [2022-04-27 14:30:48,284 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-27 14:30:48,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:30:48,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {381#false} assume !false; {381#false} is VALID [2022-04-27 14:30:48,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {381#false} is VALID [2022-04-27 14:30:48,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:48,463 INFO L272 TraceCheckUtils]: 20: Hoare triple {467#(= (* 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)); {447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:30:48,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {467#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !false; {467#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:30:48,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {467#(= (* 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; {467#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:30:48,466 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {380#true} {467#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} #53#return; {467#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:30:48,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {380#true} assume true; {380#true} is VALID [2022-04-27 14:30:48,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {380#true} assume !(0 == ~cond); {380#true} is VALID [2022-04-27 14:30:48,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#true} ~cond := #in~cond; {380#true} is VALID [2022-04-27 14:30:48,467 INFO L272 TraceCheckUtils]: 13: Hoare triple {467#(= (* 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)); {380#true} is VALID [2022-04-27 14:30:48,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !false; {467#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:30:48,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {380#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {467#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:30:48,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {380#true} {380#true} #51#return; {380#true} is VALID [2022-04-27 14:30:48,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#true} assume true; {380#true} is VALID [2022-04-27 14:30:48,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {380#true} assume !(0 == ~cond); {380#true} is VALID [2022-04-27 14:30:48,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {380#true} ~cond := #in~cond; {380#true} is VALID [2022-04-27 14:30:48,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {380#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {380#true} is VALID [2022-04-27 14:30:48,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {380#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; {380#true} is VALID [2022-04-27 14:30:48,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {380#true} call #t~ret5 := main(); {380#true} is VALID [2022-04-27 14:30:48,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {380#true} {380#true} #57#return; {380#true} is VALID [2022-04-27 14:30:48,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {380#true} assume true; {380#true} is VALID [2022-04-27 14:30:48,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {380#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); {380#true} is VALID [2022-04-27 14:30:48,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {380#true} call ULTIMATE.init(); {380#true} is VALID [2022-04-27 14:30:48,470 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-27 14:30:48,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:30:48,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796759122] [2022-04-27 14:30:48,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:30:48,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881801451] [2022-04-27 14:30:48,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881801451] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:30:48,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:30:48,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:30:48,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224733027] [2022-04-27 14:30:48,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:30:48,473 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-27 14:30:48,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:30:48,473 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-27 14:30:48,493 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-27 14:30:48,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:30:48,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:30:48,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:30:48,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:30:48,494 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-27 14:30:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:48,583 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 14:30:48,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:30:48,583 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-27 14:30:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:30:48,584 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-27 14:30:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-04-27 14:30:48,587 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-27 14:30:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-04-27 14:30:48,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2022-04-27 14:30:48,609 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-27 14:30:48,609 INFO L225 Difference]: With dead ends: 29 [2022-04-27 14:30:48,609 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:30:48,610 INFO L412 NwaCegarLoop]: 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-27 14:30:48,611 INFO L413 NwaCegarLoop]: 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-27 14:30:48,611 INFO L414 NwaCegarLoop]: 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-27 14:30:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:30:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:30:48,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:30:48,612 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-27 14:30:48,612 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-27 14:30:48,612 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-27 14:30:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:48,612 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:30:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:30:48,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:48,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:48,613 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-27 14:30:48,613 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-27 14:30:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:48,613 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:30:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:30:48,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:48,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:48,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:30:48,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:30:48,614 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-27 14:30:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:30:48,614 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-27 14:30:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:30:48,614 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:30:48,614 INFO L496 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-27 14:30:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:30:48,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:48,617 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:30:48,639 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-27 14:30:48,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:30:48,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:30:48,882 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 14:30:48,882 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 14:30:48,882 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 14:30:48,885 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-27 14:30:48,885 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 14:30:48,890 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:30:48,891 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:30:48,891 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-27 14:30:48,891 INFO L895 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-27 14:30:48,893 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-04-27 14:30:48,893 INFO L895 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-27 14:30:48,893 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 40) no Hoare annotation was computed. [2022-04-27 14:30:48,893 INFO L895 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-27 14:30:48,893 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-27 14:30:48,893 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-04-27 14:30:48,893 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 40) no Hoare annotation was computed. [2022-04-27 14:30:48,893 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-27 14:30:48,893 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:30:48,894 INFO L895 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-27 14:30:48,894 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:30:48,894 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:30:48,894 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:30:48,894 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:30:48,894 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:30:48,894 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-27 14:30:48,894 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-27 14:30:48,894 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-27 14:30:48,894 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:30:48,894 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:30:48,894 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 14:30:48,897 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 14:30:48,899 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:30:48,901 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:30:48,901 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:30:48,903 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:30:48,903 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:30:48,903 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:30:48,903 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:30:48,903 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:30:48,903 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:30:48,903 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:30:48,904 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:30:48,905 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:30:48,905 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:30:48,905 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:30:48,905 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:30:48,905 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:30:48,905 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:30:48,905 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:30:48,905 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:30:48,906 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:30:48,906 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:30:48,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:30:48 BoogieIcfgContainer [2022-04-27 14:30:48,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:30:48,917 INFO L158 Benchmark]: Toolchain (without parser) took 2604.14ms. Allocated memory was 175.1MB in the beginning and 219.2MB in the end (delta: 44.0MB). Free memory was 124.2MB in the beginning and 133.4MB in the end (delta: -9.2MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2022-04-27 14:30:48,917 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory was 140.4MB in the beginning and 140.3MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:30:48,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.69ms. Allocated memory is still 175.1MB. Free memory was 124.0MB in the beginning and 149.4MB in the end (delta: -25.4MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 14:30:48,918 INFO L158 Benchmark]: Boogie Preprocessor took 22.72ms. Allocated memory is still 175.1MB. Free memory was 149.4MB in the beginning and 148.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:30:48,918 INFO L158 Benchmark]: RCFGBuilder took 235.15ms. Allocated memory is still 175.1MB. Free memory was 148.0MB in the beginning and 137.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:30:48,919 INFO L158 Benchmark]: TraceAbstraction took 2131.32ms. Allocated memory was 175.1MB in the beginning and 219.2MB in the end (delta: 44.0MB). Free memory was 136.8MB in the beginning and 133.4MB in the end (delta: 3.5MB). Peak memory consumption was 47.8MB. Max. memory is 8.0GB. [2022-04-27 14:30:48,920 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory was 140.4MB in the beginning and 140.3MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.69ms. Allocated memory is still 175.1MB. Free memory was 124.0MB in the beginning and 149.4MB in the end (delta: -25.4MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.72ms. Allocated memory is still 175.1MB. Free memory was 149.4MB in the beginning and 148.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 235.15ms. Allocated memory is still 175.1MB. Free memory was 148.0MB in the beginning and 137.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2131.32ms. Allocated memory was 175.1MB in the beginning and 219.2MB in the end (delta: 44.0MB). Free memory was 136.8MB in the beginning and 133.4MB in the end (delta: 3.5MB). Peak memory consumption was 47.8MB. 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: 2.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 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, 10 LocationsWithAnnotation, 15 PreInvPairs, 21 NumberOfFragments, 40 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 2 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 14:30:48,948 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...