/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/sqrt1-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:55:57,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:55:57,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:55:57,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:55:57,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:55:57,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:55:57,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:55:57,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:55:57,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:55:57,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:55:57,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:55:57,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:55:57,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:55:57,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:55:57,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:55:57,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:55:57,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:55:57,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:55:57,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:55:57,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:55:57,824 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:55:57,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:55:57,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:55:57,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:55:57,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:55:57,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:55:57,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:55:57,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:55:57,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:55:57,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:55:57,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:55:57,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:55:57,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:55:57,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:55:57,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:55:57,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:55:57,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:55:57,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:55:57,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:55:57,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:55:57,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:55:57,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:55:57,834 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:55:57,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:55:57,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:55:57,860 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:55:57,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:55:57,860 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:55:57,860 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:55:57,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:55:57,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:55:57,861 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:55:57,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:55:57,862 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:55:57,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:55:57,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:55:57,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:55:57,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:55:57,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:55:57,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:55:57,863 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:55:57,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:55:57,863 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:55:57,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:55:57,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:55:57,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:55:57,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:55:57,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:55:57,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:55:57,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:55:57,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:55:57,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:55:57,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:55:57,864 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:55:57,864 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:55:57,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:55:57,864 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:55:58,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:55:58,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:55:58,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:55:58,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:55:58,056 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:55:58,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2022-04-27 14:55:58,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725a213ec/7061e9d102c84f6d8cd88f6b381620b2/FLAG1daec525e [2022-04-27 14:55:58,437 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:55:58,437 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2022-04-27 14:55:58,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725a213ec/7061e9d102c84f6d8cd88f6b381620b2/FLAG1daec525e [2022-04-27 14:55:58,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725a213ec/7061e9d102c84f6d8cd88f6b381620b2 [2022-04-27 14:55:58,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:55:58,451 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:55:58,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:55:58,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:55:58,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:55:58,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:55:58" (1/1) ... [2022-04-27 14:55:58,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eac19a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58, skipping insertion in model container [2022-04-27 14:55:58,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:55:58" (1/1) ... [2022-04-27 14:55:58,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:55:58,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:55:58,556 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/sqrt1-ll_valuebound2.c[520,533] [2022-04-27 14:55:58,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:55:58,585 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:55:58,604 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/sqrt1-ll_valuebound2.c[520,533] [2022-04-27 14:55:58,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:55:58,617 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:55:58,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58 WrapperNode [2022-04-27 14:55:58,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:55:58,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:55:58,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:55:58,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:55:58,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58" (1/1) ... [2022-04-27 14:55:58,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58" (1/1) ... [2022-04-27 14:55:58,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58" (1/1) ... [2022-04-27 14:55:58,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58" (1/1) ... [2022-04-27 14:55:58,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58" (1/1) ... [2022-04-27 14:55:58,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58" (1/1) ... [2022-04-27 14:55:58,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58" (1/1) ... [2022-04-27 14:55:58,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:55:58,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:55:58,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:55:58,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:55:58,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58" (1/1) ... [2022-04-27 14:55:58,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:55:58,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:58,656 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:55:58,660 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:55:58,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:55:58,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:55:58,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:55:58,686 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:55:58,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:55:58,686 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:55:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:55:58,724 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:55:58,725 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:55:58,800 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:55:58,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:55:58,805 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:55:58,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:55:58 BoogieIcfgContainer [2022-04-27 14:55:58,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:55:58,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:55:58,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:55:58,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:55:58,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:55:58" (1/3) ... [2022-04-27 14:55:58,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225c9393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:55:58, skipping insertion in model container [2022-04-27 14:55:58,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:58" (2/3) ... [2022-04-27 14:55:58,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225c9393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:55:58, skipping insertion in model container [2022-04-27 14:55:58,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:55:58" (3/3) ... [2022-04-27 14:55:58,816 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound2.c [2022-04-27 14:55:58,825 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:55:58,825 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:55:58,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:55:58,862 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@68fe88c9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37f619d9 [2022-04-27 14:55:58,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:55:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:55:58,872 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:58,872 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:55:58,872 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:58,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-27 14:55:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:58,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736954795] [2022-04-27 14:55:58,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:58,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:55:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:58,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(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(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-27 14:55:58,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 14:55:58,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-27 14:55:58,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:55:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:59,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 14:55:59,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 14:55:59,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 14:55:59,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-27 14:55:59,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:55:59,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(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(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-27 14:55:59,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 14:55:59,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-27 14:55:59,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-27 14:55:59,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-27 14:55:59,009 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {34#true} is VALID [2022-04-27 14:55:59,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 14:55:59,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 14:55:59,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 14:55:59,010 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-27 14:55:59,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-27 14:55:59,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-27 14:55:59,010 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-27 14:55:59,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 14:55:59,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 14:55:59,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 14:55:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:55:59,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:59,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736954795] [2022-04-27 14:55:59,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736954795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:59,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:59,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:55:59,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681245470] [2022-04-27 14:55:59,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:59,017 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:55:59,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:59,020 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:55:59,057 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:55:59,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:55:59,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:59,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:55:59,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:55:59,084 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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:55:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:59,197 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-27 14:55:59,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:55:59,197 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:55:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:59,198 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:55:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-27 14:55:59,205 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:55:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-27 14:55:59,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-27 14:55:59,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:59,292 INFO L225 Difference]: With dead ends: 53 [2022-04-27 14:55:59,292 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:55:59,294 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:55:59,296 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:59,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:55:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:55:59,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:59,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:55:59,362 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:55:59,363 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:55:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:59,366 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 14:55:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:55:59,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:59,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:59,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 14:55:59,368 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 14:55:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:59,370 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 14:55:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:55:59,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:59,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:59,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:59,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:55:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-27 14:55:59,374 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-27 14:55:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:59,374 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-27 14:55:59,374 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:55:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:55:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:55:59,375 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:59,375 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:55:59,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:55:59,376 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:59,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:59,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-27 14:55:59,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:59,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049572758] [2022-04-27 14:55:59,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:55:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:59,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(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(11, 2);call #Ultimate.allocInit(12, 3); {213#true} is VALID [2022-04-27 14:55:59,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:55:59,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213#true} {213#true} #69#return; {213#true} is VALID [2022-04-27 14:55:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:55:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:59,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#true} ~cond := #in~cond; {213#true} is VALID [2022-04-27 14:55:59,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} assume !(0 == ~cond); {213#true} is VALID [2022-04-27 14:55:59,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:55:59,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #55#return; {213#true} is VALID [2022-04-27 14:55:59,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {213#true} call ULTIMATE.init(); {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:55:59,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(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(11, 2);call #Ultimate.allocInit(12, 3); {213#true} is VALID [2022-04-27 14:55:59,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:55:59,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #69#return; {213#true} is VALID [2022-04-27 14:55:59,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {213#true} call #t~ret5 := main(); {213#true} is VALID [2022-04-27 14:55:59,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {213#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {213#true} is VALID [2022-04-27 14:55:59,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {213#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {213#true} is VALID [2022-04-27 14:55:59,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#true} ~cond := #in~cond; {213#true} is VALID [2022-04-27 14:55:59,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#true} assume !(0 == ~cond); {213#true} is VALID [2022-04-27 14:55:59,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:55:59,464 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {213#true} {213#true} #55#return; {213#true} is VALID [2022-04-27 14:55:59,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:55:59,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:55:59,466 INFO L272 TraceCheckUtils]: 13: Hoare triple {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:55:59,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:55:59,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {214#false} is VALID [2022-04-27 14:55:59,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#false} assume !false; {214#false} is VALID [2022-04-27 14:55:59,467 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:55:59,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:59,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049572758] [2022-04-27 14:55:59,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049572758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:59,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:59,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:55:59,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499788088] [2022-04-27 14:55:59,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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:55:59,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:59,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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:55:59,481 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:55:59,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:55:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:59,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:55:59,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:55:59,482 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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:55:59,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:59,797 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 14:55:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:55:59,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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:55:59,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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:55:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 14:55:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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:55:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 14:55:59,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-27 14:55:59,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:59,866 INFO L225 Difference]: With dead ends: 40 [2022-04-27 14:55:59,866 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 14:55:59,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:55:59,867 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:59,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:55:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 14:55:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-27 14:55:59,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:59,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:59,885 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:59,885 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:59,887 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:55:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:55:59,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:59,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:59,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 14:55:59,888 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 14:55:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:59,890 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:55:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:55:59,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:59,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:59,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:59,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 14:55:59,893 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-27 14:55:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:59,893 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 14:55:59,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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:55:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 14:55:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:55:59,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:59,894 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:59,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 14:55:59,894 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:59,895 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-27 14:55:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:59,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731405541] [2022-04-27 14:55:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:59,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:59,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:59,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009479125] [2022-04-27 14:55:59,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:59,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:59,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:59,929 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:55:59,931 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:55:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:59,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:55:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:59,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:00,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {430#true} call ULTIMATE.init(); {430#true} is VALID [2022-04-27 14:56:00,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#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(11, 2);call #Ultimate.allocInit(12, 3); {430#true} is VALID [2022-04-27 14:56:00,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:56:00,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} #69#return; {430#true} is VALID [2022-04-27 14:56:00,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {430#true} call #t~ret5 := main(); {430#true} is VALID [2022-04-27 14:56:00,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {430#true} is VALID [2022-04-27 14:56:00,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {430#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {430#true} is VALID [2022-04-27 14:56:00,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#true} ~cond := #in~cond; {430#true} is VALID [2022-04-27 14:56:00,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#true} assume !(0 == ~cond); {430#true} is VALID [2022-04-27 14:56:00,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:56:00,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {430#true} {430#true} #55#return; {430#true} is VALID [2022-04-27 14:56:00,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:56:00,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:56:00,112 INFO L272 TraceCheckUtils]: 13: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {430#true} is VALID [2022-04-27 14:56:00,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {430#true} ~cond := #in~cond; {430#true} is VALID [2022-04-27 14:56:00,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#true} assume !(0 == ~cond); {430#true} is VALID [2022-04-27 14:56:00,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:56:00,113 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {430#true} {468#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:56:00,114 INFO L272 TraceCheckUtils]: 18: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {490#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:00,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {494#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:00,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {494#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {431#false} is VALID [2022-04-27 14:56:00,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {431#false} assume !false; {431#false} is VALID [2022-04-27 14:56:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:56:00,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:56:00,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:00,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731405541] [2022-04-27 14:56:00,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:00,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009479125] [2022-04-27 14:56:00,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009479125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:56:00,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:56:00,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:56:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382931604] [2022-04-27 14:56:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:00,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-27 14:56:00,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:00,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:56:00,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:00,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:56:00,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:00,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:56:00,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:56:00,140 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:56:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:00,263 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-27 14:56:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:56:00,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-27 14:56:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:56:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:56:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:00,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 14:56:00,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:00,307 INFO L225 Difference]: With dead ends: 44 [2022-04-27 14:56:00,307 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:56:00,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:56:00,310 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:00,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:56:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-27 14:56:00,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:00,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:00,326 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:00,326 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:00,332 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 14:56:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-27 14:56:00,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:00,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:00,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-27 14:56:00,338 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-27 14:56:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:00,340 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 14:56:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-27 14:56:00,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:00,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:00,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:00,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-27 14:56:00,342 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-27 14:56:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:00,342 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-27 14:56:00,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:56:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-27 14:56:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 14:56:00,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:00,343 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:00,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:56:00,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:00,554 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-27 14:56:00,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:00,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148901650] [2022-04-27 14:56:00,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:00,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:00,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:00,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139563682] [2022-04-27 14:56:00,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:00,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:00,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:00,568 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:56:00,570 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:56:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:00,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:56:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:00,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:00,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {716#true} call ULTIMATE.init(); {716#true} is VALID [2022-04-27 14:56:00,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#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(11, 2);call #Ultimate.allocInit(12, 3); {716#true} is VALID [2022-04-27 14:56:00,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:00,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {716#true} {716#true} #69#return; {716#true} is VALID [2022-04-27 14:56:00,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {716#true} call #t~ret5 := main(); {716#true} is VALID [2022-04-27 14:56:00,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {716#true} is VALID [2022-04-27 14:56:00,707 INFO L272 TraceCheckUtils]: 6: Hoare triple {716#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {716#true} is VALID [2022-04-27 14:56:00,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:56:00,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:56:00,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:00,707 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {716#true} {716#true} #55#return; {716#true} is VALID [2022-04-27 14:56:00,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:00,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:00,708 INFO L272 TraceCheckUtils]: 13: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {716#true} is VALID [2022-04-27 14:56:00,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:56:00,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:56:00,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:00,709 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {716#true} {754#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:00,709 INFO L272 TraceCheckUtils]: 18: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {716#true} is VALID [2022-04-27 14:56:00,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:56:00,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:56:00,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:00,710 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {716#true} {754#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:00,710 INFO L272 TraceCheckUtils]: 23: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:00,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:00,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {717#false} is VALID [2022-04-27 14:56:00,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {717#false} assume !false; {717#false} is VALID [2022-04-27 14:56:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:56:00,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:56:00,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:00,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148901650] [2022-04-27 14:56:00,712 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:00,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139563682] [2022-04-27 14:56:00,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139563682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:56:00,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:56:00,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:56:00,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957457787] [2022-04-27 14:56:00,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 14:56:00,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:00,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:00,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:00,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:56:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:00,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:56:00,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:56:00,729 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:00,841 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-27 14:56:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:56:00,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 14:56:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:00,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 14:56:00,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:00,884 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:56:00,884 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 14:56:00,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:56:00,885 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:00,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 14:56:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 14:56:00,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:00,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:00,898 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:00,898 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:00,901 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:56:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:56:00,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:00,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:00,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 14:56:00,902 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 14:56:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:00,910 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:56:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:56:00,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:00,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:00,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:00,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-27 14:56:00,922 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-27 14:56:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:00,922 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-27 14:56:00,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:56:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:56:00,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:00,923 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:00,942 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:56:01,142 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,SelfDestructingSolverStorable3 [2022-04-27 14:56:01,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:01,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-27 14:56:01,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:01,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819699994] [2022-04-27 14:56:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:01,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:01,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530518237] [2022-04-27 14:56:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:01,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:01,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:01,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:56:01,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:56:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:01,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:56:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:01,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:01,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-27 14:56:01,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#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(11, 2);call #Ultimate.allocInit(12, 3); {1025#true} is VALID [2022-04-27 14:56:01,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:01,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #69#return; {1025#true} is VALID [2022-04-27 14:56:01,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret5 := main(); {1025#true} is VALID [2022-04-27 14:56:01,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1025#true} is VALID [2022-04-27 14:56:01,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:01,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:01,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:01,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:01,336 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1025#true} {1025#true} #55#return; {1025#true} is VALID [2022-04-27 14:56:01,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:01,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} assume !false; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:01,337 INFO L272 TraceCheckUtils]: 13: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:01,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:01,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:01,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:01,338 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #57#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:01,338 INFO L272 TraceCheckUtils]: 18: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:01,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:01,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:01,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:01,339 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #59#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:01,339 INFO L272 TraceCheckUtils]: 23: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:01,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:01,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:01,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:01,352 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #61#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:01,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:01,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:01,353 INFO L272 TraceCheckUtils]: 30: Hoare triple {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:01,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:01,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {1126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1026#false} is VALID [2022-04-27 14:56:01,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-27 14:56:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:56:01,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:01,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-27 14:56:01,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {1126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1026#false} is VALID [2022-04-27 14:56:01,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:01,504 INFO L272 TraceCheckUtils]: 30: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:01,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:01,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:01,506 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #61#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:01,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:01,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:01,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:01,506 INFO L272 TraceCheckUtils]: 23: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:01,506 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #59#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:01,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:01,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:01,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:01,507 INFO L272 TraceCheckUtils]: 18: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:01,507 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #57#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:01,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:01,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:01,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:01,507 INFO L272 TraceCheckUtils]: 13: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:01,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:01,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:01,508 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1025#true} {1025#true} #55#return; {1025#true} is VALID [2022-04-27 14:56:01,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:01,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:01,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:01,508 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:01,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1025#true} is VALID [2022-04-27 14:56:01,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret5 := main(); {1025#true} is VALID [2022-04-27 14:56:01,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #69#return; {1025#true} is VALID [2022-04-27 14:56:01,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:01,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#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(11, 2);call #Ultimate.allocInit(12, 3); {1025#true} is VALID [2022-04-27 14:56:01,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-27 14:56:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 14:56:01,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:01,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819699994] [2022-04-27 14:56:01,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:01,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530518237] [2022-04-27 14:56:01,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530518237] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:56:01,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:56:01,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:56:01,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971890392] [2022-04-27 14:56:01,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:01,510 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:56:01,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:01,510 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:01,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:01,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:56:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:01,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:56:01,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:56:01,527 INFO L87 Difference]: Start difference. First operand 43 states and 48 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:01,631 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-27 14:56:01,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:56:01,631 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:56:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:01,632 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 14:56:01,632 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 14:56:01,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-27 14:56:01,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:01,658 INFO L225 Difference]: With dead ends: 49 [2022-04-27 14:56:01,658 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 14:56:01,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 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:56:01,659 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:01,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:01,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 14:56:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 14:56:01,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:01,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:01,665 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:01,666 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:01,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:01,667 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 14:56:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:56:01,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:01,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:01,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-27 14:56:01,667 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-27 14:56:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:01,669 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 14:56:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:56:01,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:01,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:01,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:01,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-27 14:56:01,670 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-27 14:56:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:01,670 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-27 14:56:01,671 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:56:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 14:56:01,671 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:01,671 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 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:56:01,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:56:01,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:01,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:01,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:01,888 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 2 times [2022-04-27 14:56:01,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:01,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201139950] [2022-04-27 14:56:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:01,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:01,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:01,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625037964] [2022-04-27 14:56:01,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:56:01,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:01,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:01,898 INFO L229 MonitoredProcess]: Starting monitored process 5 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:56:01,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:56:01,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:56:01,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:56:01,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 14:56:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:01,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:02,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-27 14:56:02,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#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(11, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-27 14:56:02,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #69#return; {1471#true} is VALID [2022-04-27 14:56:02,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret5 := main(); {1471#true} is VALID [2022-04-27 14:56:02,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1471#true} is VALID [2022-04-27 14:56:02,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:02,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:02,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:02,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1471#true} {1471#true} #55#return; {1471#true} is VALID [2022-04-27 14:56:02,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:02,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:02,097 INFO L272 TraceCheckUtils]: 13: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:02,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:02,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:02,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,099 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:02,099 INFO L272 TraceCheckUtils]: 18: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:02,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:02,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:02,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,100 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:02,100 INFO L272 TraceCheckUtils]: 23: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:02,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:02,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:02,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,100 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:02,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:02,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:02,101 INFO L272 TraceCheckUtils]: 30: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:02,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:02,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:02,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,104 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1471#true} {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} #57#return; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:02,105 INFO L272 TraceCheckUtils]: 35: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:02,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:02,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1472#false} is VALID [2022-04-27 14:56:02,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-27 14:56:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:56:02,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:02,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-27 14:56:02,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1472#false} is VALID [2022-04-27 14:56:02,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:02,236 INFO L272 TraceCheckUtils]: 35: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:02,236 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1471#true} {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:56:02,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:02,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:02,237 INFO L272 TraceCheckUtils]: 30: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:02,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:56:02,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:56:02,257 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:56:02,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:02,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:02,257 INFO L272 TraceCheckUtils]: 23: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:02,258 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:56:02,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:02,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:02,258 INFO L272 TraceCheckUtils]: 18: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:02,258 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:56:02,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:02,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:02,259 INFO L272 TraceCheckUtils]: 13: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:02,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:56:02,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:56:02,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1471#true} {1471#true} #55#return; {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret5 := main(); {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #69#return; {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#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(11, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-27 14:56:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:56:02,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:02,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201139950] [2022-04-27 14:56:02,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:02,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625037964] [2022-04-27 14:56:02,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625037964] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:56:02,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:56:02,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 14:56:02,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474359324] [2022-04-27 14:56:02,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:56:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-27 14:56:02,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:02,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:02,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:02,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:56:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:02,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:56:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:56:02,296 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:02,686 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-27 14:56:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:56:02,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-27 14:56:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 14:56:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 14:56:02,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-27 14:56:02,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:02,752 INFO L225 Difference]: With dead ends: 55 [2022-04-27 14:56:02,752 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:56:02,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:56:02,753 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:02,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:56:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:56:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:56:02,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:02,754 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:56:02,754 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:56:02,754 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:56:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:02,754 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:56:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:56:02,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:02,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:02,754 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:56:02,754 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:56:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:02,754 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:56:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:56:02,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:02,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:02,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:02,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:02,754 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:56:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:56:02,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-27 14:56:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:02,755 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:56:02,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:56:02,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:02,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:56:02,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:56:02,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:02,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:56:03,114 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 14:56:03,114 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 14:56:03,114 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 14:56:03,114 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 14:56:03,114 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 14:56:03,114 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:56:03,114 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:56:03,114 INFO L899 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-27 14:56:03,115 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:03,115 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:03,115 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:56:03,115 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 14:56:03,115 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:56:03,115 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:03,115 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:03,115 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-27 14:56:03,115 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:03,115 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:03,115 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-27 14:56:03,115 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-27 14:56:03,115 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (and (= main_~t~0 1) (= main_~s~0 1))) [2022-04-27 14:56:03,115 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:56:03,115 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:56:03,115 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:56:03,115 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:56:03,115 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:56:03,115 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:56:03,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:56:03,116 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 14:56:03,116 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 14:56:03,116 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 14:56:03,116 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:56:03,116 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:56:03,116 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 14:56:03,118 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-27 14:56:03,119 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:56:03,121 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:56:03,121 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 14:56:03,122 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:56:03,123 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:03,123 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:03,123 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:03,123 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:03,123 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:03,124 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:03,124 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:56:03,124 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:56:03,124 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:56:03,124 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:56:03,124 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:56:03,124 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:56:03,124 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:56:03,124 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:56:03,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:56:03 BoogieIcfgContainer [2022-04-27 14:56:03,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:56:03,129 INFO L158 Benchmark]: Toolchain (without parser) took 4678.24ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 129.7MB in the beginning and 151.6MB in the end (delta: -21.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2022-04-27 14:56:03,130 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:56:03,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.18ms. Allocated memory is still 180.4MB. Free memory was 129.5MB in the beginning and 154.2MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 14:56:03,130 INFO L158 Benchmark]: Boogie Preprocessor took 16.56ms. Allocated memory is still 180.4MB. Free memory was 154.2MB in the beginning and 152.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 14:56:03,130 INFO L158 Benchmark]: RCFGBuilder took 171.51ms. Allocated memory is still 180.4MB. Free memory was 152.7MB in the beginning and 141.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:56:03,130 INFO L158 Benchmark]: TraceAbstraction took 4321.72ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 141.4MB in the beginning and 151.6MB in the end (delta: -10.2MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. [2022-04-27 14:56:03,131 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 165.18ms. Allocated memory is still 180.4MB. Free memory was 129.5MB in the beginning and 154.2MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.56ms. Allocated memory is still 180.4MB. Free memory was 154.2MB in the beginning and 152.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 171.51ms. Allocated memory is still 180.4MB. Free memory was 152.7MB in the beginning and 141.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4321.72ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 141.4MB in the beginning and 151.6MB in the end (delta: -10.2MB). Peak memory consumption was 27.5MB. 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: 14]: 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 457 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 168 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 37 PreInvPairs, 58 NumberOfFragments, 161 HoareAnnotationTreeSize, 37 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 476 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 SizeOfPredicates, 5 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 112/120 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: 30]: Loop Invariant Derived loop invariant: t + s == a * 4 + 2 + a * a && t == a * 2 + 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 14:56:03,149 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...