/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/ps4-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:35:37,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:35:37,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:35:37,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:35:37,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:35:37,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:35:37,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:35:37,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:35:37,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:35:37,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:35:37,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:35:37,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:35:37,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:35:37,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:35:37,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:35:37,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:35:37,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:35:37,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:35:37,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:35:37,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:35:37,698 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:35:37,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:35:37,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:35:37,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:35:37,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:35:37,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:35:37,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:35:37,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:35:37,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:35:37,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:35:37,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:35:37,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:35:37,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:35:37,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:35:37,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:35:37,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:35:37,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:35:37,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:35:37,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:35:37,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:35:37,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:35:37,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:35:37,713 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:35:37,736 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:35:37,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:35:37,736 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:35:37,736 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:35:37,737 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:35:37,737 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:35:37,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:35:37,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:35:37,737 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:35:37,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:35:37,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:35:37,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:35:37,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:35:37,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:35:37,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:35:37,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:35:37,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:35:37,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:35:37,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:35:37,740 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:35:37,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:35:37,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:35:37,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:35:37,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:35:37,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:35:37,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:35:37,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:35:37,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:35:37,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:35:37,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:35:37,741 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:35:37,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:35:37,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:35:37,741 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:35:37,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:35:37,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:35:37,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:35:37,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:35:37,958 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:35:37,958 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c [2022-04-27 14:35:37,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bc0cdf3/fda3f32275234662bea143ca0b2b6f32/FLAG1bdd1a169 [2022-04-27 14:35:38,356 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:35:38,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c [2022-04-27 14:35:38,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bc0cdf3/fda3f32275234662bea143ca0b2b6f32/FLAG1bdd1a169 [2022-04-27 14:35:38,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bc0cdf3/fda3f32275234662bea143ca0b2b6f32 [2022-04-27 14:35:38,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:35:38,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:35:38,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:35:38,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:35:38,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:35:38,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:35:38" (1/1) ... [2022-04-27 14:35:38,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae037cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38, skipping insertion in model container [2022-04-27 14:35:38,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:35:38" (1/1) ... [2022-04-27 14:35:38,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:35:38,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:35:38,530 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/ps4-ll_valuebound1.c[458,471] [2022-04-27 14:35:38,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:35:38,544 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:35:38,551 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/ps4-ll_valuebound1.c[458,471] [2022-04-27 14:35:38,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:35:38,563 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:35:38,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38 WrapperNode [2022-04-27 14:35:38,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:35:38,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:35:38,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:35:38,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:35:38,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38" (1/1) ... [2022-04-27 14:35:38,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38" (1/1) ... [2022-04-27 14:35:38,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38" (1/1) ... [2022-04-27 14:35:38,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38" (1/1) ... [2022-04-27 14:35:38,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38" (1/1) ... [2022-04-27 14:35:38,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38" (1/1) ... [2022-04-27 14:35:38,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38" (1/1) ... [2022-04-27 14:35:38,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:35:38,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:35:38,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:35:38,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:35:38,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38" (1/1) ... [2022-04-27 14:35:38,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:35:38,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:38,624 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:35:38,642 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:35:38,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:35:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:35:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:35:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:35:38,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:35:38,660 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:35:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:35:38,699 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:35:38,700 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:35:38,805 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:35:38,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:35:38,810 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:35:38,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:35:38 BoogieIcfgContainer [2022-04-27 14:35:38,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:35:38,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:35:38,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:35:38,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:35:38,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:35:38" (1/3) ... [2022-04-27 14:35:38,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5fe1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:35:38, skipping insertion in model container [2022-04-27 14:35:38,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:38" (2/3) ... [2022-04-27 14:35:38,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5fe1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:35:38, skipping insertion in model container [2022-04-27 14:35:38,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:35:38" (3/3) ... [2022-04-27 14:35:38,819 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound1.c [2022-04-27 14:35:38,828 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:35:38,828 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:35:38,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:35:38,858 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@1ad2b00d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d193fef [2022-04-27 14:35:38,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:35:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:35:38,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:38,867 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:35:38,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:38,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-27 14:35:38,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:38,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318014426] [2022-04-27 14:35:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:35:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:39,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 14:35:39,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:35:39,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:35:39,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:35:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:39,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:35:39,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:35:39,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:35:39,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:35:39,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:35:39,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 14:35:39,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:35:39,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:35:39,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-27 14:35:39,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-27 14:35:39,081 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {31#true} is VALID [2022-04-27 14:35:39,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:35:39,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:35:39,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:35:39,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:35:39,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-27 14:35:39,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-27 14:35:39,083 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-27 14:35:39,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-27 14:35:39,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-27 14:35:39,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 14:35:39,084 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:35:39,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:39,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318014426] [2022-04-27 14:35:39,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318014426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:35:39,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:35:39,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:35:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562831140] [2022-04-27 14:35:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:35:39,091 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:35:39,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:39,095 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:35:39,130 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:35:39,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:35:39,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:39,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:35:39,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:35:39,147 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:35:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:39,251 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 14:35:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:35:39,251 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:35:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:39,252 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:35:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:35:39,260 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:35:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:35:39,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-27 14:35:39,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:39,345 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:35:39,345 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 14:35:39,347 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:35:39,351 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:39,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:35:39,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 14:35:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 14:35:39,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:39,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:39,379 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:39,379 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:39,387 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:35:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:35:39,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:39,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:39,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 14:35:39,389 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 14:35:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:39,392 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:35:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:35:39,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:39,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:39,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:39,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 14:35:39,402 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-27 14:35:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:39,403 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 14:35:39,403 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:35:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:35:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:35:39,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:39,404 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:35:39,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:35:39,404 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:39,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-27 14:35:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:39,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569190448] [2022-04-27 14:35:39,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:39,437 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:39,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1768819306] [2022-04-27 14:35:39,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:39,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:39,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:39,443 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:35:39,449 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:35:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:39,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:35:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:39,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:39,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2022-04-27 14:35:39,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {186#true} is VALID [2022-04-27 14:35:39,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:35:39,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #60#return; {186#true} is VALID [2022-04-27 14:35:39,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret5 := main(); {186#true} is VALID [2022-04-27 14:35:39,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {186#true} is VALID [2022-04-27 14:35:39,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {186#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {186#true} is VALID [2022-04-27 14:35:39,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-04-27 14:35:39,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} assume !(0 == ~cond); {186#true} is VALID [2022-04-27 14:35:39,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:35:39,628 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {186#true} {186#true} #52#return; {186#true} is VALID [2022-04-27 14:35:39,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:39,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:39,630 INFO L272 TraceCheckUtils]: 13: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:39,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:39,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {187#false} is VALID [2022-04-27 14:35:39,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-04-27 14:35:39,631 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:35:39,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:35:39,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:39,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569190448] [2022-04-27 14:35:39,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:39,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768819306] [2022-04-27 14:35:39,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768819306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:35:39,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:35:39,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:35:39,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760896919] [2022-04-27 14:35:39,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:35:39,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:35:39,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:39,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:35:39,648 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:35:39,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:35:39,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:39,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:35:39,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:35:39,651 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:35:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:48,194 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:35:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:35:48,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:35:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:35:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:35:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:35:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:35:48,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-27 14:35:48,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:48,229 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:35:48,229 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 14:35:48,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:35:48,230 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:48,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:35:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 14:35:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 14:35:48,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:48,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:48,235 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:48,235 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:48,237 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:35:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:35:48,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:48,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:48,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 14:35:48,238 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 14:35:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:48,239 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:35:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:35:48,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:48,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:48,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:48,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 14:35:48,241 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 14:35:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:48,241 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 14:35:48,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:35:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:35:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 14:35:48,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:48,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:48,263 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:35:48,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:48,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:48,456 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-27 14:35:48,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:48,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39207751] [2022-04-27 14:35:48,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:48,468 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:48,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579487334] [2022-04-27 14:35:48,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:48,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:48,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:48,470 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:35:48,479 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:35:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:48,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:35:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:48,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:48,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:35:48,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {397#true} is VALID [2022-04-27 14:35:48,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:35:48,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:35:48,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:35:48,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {397#true} is VALID [2022-04-27 14:35:48,629 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {397#true} is VALID [2022-04-27 14:35:48,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:35:48,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:35:48,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:35:48,630 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:35:48,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:48,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:48,631 INFO L272 TraceCheckUtils]: 13: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {397#true} is VALID [2022-04-27 14:35:48,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:35:48,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:35:48,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:35:48,632 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {435#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:48,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:35:48,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:35:48,634 INFO L272 TraceCheckUtils]: 20: Hoare triple {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:48,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:48,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:35:48,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:35:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:35:48,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:48,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:35:48,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:35:48,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:48,834 INFO L272 TraceCheckUtils]: 20: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:48,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:48,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:48,843 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:48,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:35:48,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:35:48,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:35:48,843 INFO L272 TraceCheckUtils]: 13: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {397#true} is VALID [2022-04-27 14:35:48,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:48,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:48,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:35:48,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:35:48,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:35:48,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:35:48,847 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {397#true} is VALID [2022-04-27 14:35:48,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {397#true} is VALID [2022-04-27 14:35:48,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:35:48,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:35:48,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:35:48,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {397#true} is VALID [2022-04-27 14:35:48,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:35:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 14:35:48,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:48,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39207751] [2022-04-27 14:35:48,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:48,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579487334] [2022-04-27 14:35:48,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579487334] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:48,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:48,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:35:48,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140295161] [2022-04-27 14:35:48,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:35:48,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 14:35:48,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:48,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:35:48,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:48,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:35:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:35:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:35:48,874 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:35:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:48,961 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-27 14:35:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:35:48,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 14:35:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:35:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:35:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:35:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:35:48,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 14:35:49,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:49,002 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:35:49,002 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:35:49,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:35:49,004 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:49,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:35:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:35:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:35:49,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:49,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:49,013 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:49,014 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:49,015 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:35:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:35:49,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:49,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:49,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-27 14:35:49,016 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-27 14:35:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:49,017 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:35:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:35:49,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:49,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:49,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:49,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-27 14:35:49,019 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-27 14:35:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:49,019 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-27 14:35:49,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:35:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:35:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 14:35:49,020 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:49,020 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:49,045 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:35:49,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:35:49,235 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-27 14:35:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:49,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718720910] [2022-04-27 14:35:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:49,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:49,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:49,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532694039] [2022-04-27 14:35:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:49,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:49,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:49,250 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:35:49,251 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:35:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:49,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 14:35:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:49,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:49,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2022-04-27 14:35:49,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {707#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {707#true} is VALID [2022-04-27 14:35:49,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:35:49,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #60#return; {707#true} is VALID [2022-04-27 14:35:49,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2022-04-27 14:35:49,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {707#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {707#true} is VALID [2022-04-27 14:35:49,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {707#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {707#true} is VALID [2022-04-27 14:35:49,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:35:49,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:35:49,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:35:49,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {707#true} {707#true} #52#return; {707#true} is VALID [2022-04-27 14:35:49,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {745#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:49,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {745#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !false; {745#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:49,595 INFO L272 TraceCheckUtils]: 13: Hoare triple {745#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {707#true} is VALID [2022-04-27 14:35:49,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:35:49,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:35:49,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:35:49,597 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {707#true} {745#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #54#return; {745#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:49,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {745#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {767#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:49,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {767#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:49,598 INFO L272 TraceCheckUtils]: 20: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {707#true} is VALID [2022-04-27 14:35:49,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {707#true} ~cond := #in~cond; {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:49,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:35:49,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:35:49,600 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {767#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {788#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:49,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {788#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {792#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:49,601 INFO L272 TraceCheckUtils]: 26: Hoare triple {792#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:49,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:49,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {708#false} is VALID [2022-04-27 14:35:49,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-04-27 14:35:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 14:35:49,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:22,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718720910] [2022-04-27 14:36:22,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:22,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532694039] [2022-04-27 14:36:22,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532694039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:22,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:22,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:36:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192968572] [2022-04-27 14:36:22,959 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:22,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-27 14:36:22,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:22,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:22,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:22,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:36:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:36:22,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:36:22,984 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:23,213 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-27 14:36:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:36:23,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-27 14:36:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-27 14:36:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-27 14:36:23,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-27 14:36:23,239 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:36:23,240 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:36:23,240 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:36:23,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:36:23,241 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:23,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 107 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:36:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:36:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 14:36:23,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:23,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:23,251 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:23,251 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:23,254 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:36:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:36:23,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:23,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:23,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 14:36:23,255 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 14:36:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:23,258 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:36:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:36:23,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:23,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:23,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:23,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-27 14:36:23,260 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-27 14:36:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:23,260 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-27 14:36:23,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:36:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:36:23,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:23,261 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:23,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 14:36:23,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:23,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 2 times [2022-04-27 14:36:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:23,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23708503] [2022-04-27 14:36:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:23,479 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:23,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740003595] [2022-04-27 14:36:23,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:36:23,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:23,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:23,483 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:36:23,483 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:36:23,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:36:23,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:23,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 14:36:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:23,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:23,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {1031#true} call ULTIMATE.init(); {1031#true} is VALID [2022-04-27 14:36:23,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {1031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1031#true} is VALID [2022-04-27 14:36:23,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {1031#true} assume true; {1031#true} is VALID [2022-04-27 14:36:23,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1031#true} {1031#true} #60#return; {1031#true} is VALID [2022-04-27 14:36:23,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {1031#true} call #t~ret5 := main(); {1031#true} is VALID [2022-04-27 14:36:23,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {1031#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1031#true} is VALID [2022-04-27 14:36:23,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {1031#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {1031#true} is VALID [2022-04-27 14:36:23,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {1031#true} ~cond := #in~cond; {1057#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:36:23,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {1057#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1061#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:36:23,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1061#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:36:23,731 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1061#(not (= |assume_abort_if_not_#in~cond| 0))} {1031#true} #52#return; {1068#(and (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-27 14:36:23,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {1068#(and (<= 0 main_~k~0) (<= main_~k~0 1))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1072#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-27 14:36:23,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {1072#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} assume !false; {1072#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-27 14:36:23,732 INFO L272 TraceCheckUtils]: 13: Hoare triple {1072#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1031#true} is VALID [2022-04-27 14:36:23,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1031#true} ~cond := #in~cond; {1031#true} is VALID [2022-04-27 14:36:23,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {1031#true} assume !(0 == ~cond); {1031#true} is VALID [2022-04-27 14:36:23,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {1031#true} assume true; {1031#true} is VALID [2022-04-27 14:36:23,733 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1031#true} {1072#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} #54#return; {1072#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-27 14:36:23,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {1072#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1094#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-27 14:36:23,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {1094#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} assume !false; {1094#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-27 14:36:23,734 INFO L272 TraceCheckUtils]: 20: Hoare triple {1094#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1031#true} is VALID [2022-04-27 14:36:23,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {1031#true} ~cond := #in~cond; {1031#true} is VALID [2022-04-27 14:36:23,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {1031#true} assume !(0 == ~cond); {1031#true} is VALID [2022-04-27 14:36:23,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {1031#true} assume true; {1031#true} is VALID [2022-04-27 14:36:23,734 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1031#true} {1094#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} #54#return; {1094#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-27 14:36:23,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {1094#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1032#false} is VALID [2022-04-27 14:36:23,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {1032#false} assume !false; {1032#false} is VALID [2022-04-27 14:36:23,735 INFO L272 TraceCheckUtils]: 27: Hoare triple {1032#false} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1032#false} is VALID [2022-04-27 14:36:23,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {1032#false} ~cond := #in~cond; {1032#false} is VALID [2022-04-27 14:36:23,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {1032#false} assume !(0 == ~cond); {1032#false} is VALID [2022-04-27 14:36:23,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {1032#false} assume true; {1032#false} is VALID [2022-04-27 14:36:23,736 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1032#false} {1032#false} #54#return; {1032#false} is VALID [2022-04-27 14:36:23,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {1032#false} assume !(~c~0 < ~k~0); {1032#false} is VALID [2022-04-27 14:36:23,736 INFO L272 TraceCheckUtils]: 33: Hoare triple {1032#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1032#false} is VALID [2022-04-27 14:36:23,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {1032#false} ~cond := #in~cond; {1032#false} is VALID [2022-04-27 14:36:23,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {1032#false} assume 0 == ~cond; {1032#false} is VALID [2022-04-27 14:36:23,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {1032#false} assume !false; {1032#false} is VALID [2022-04-27 14:36:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:36:23,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:36:23,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:23,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23708503] [2022-04-27 14:36:23,737 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:23,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740003595] [2022-04-27 14:36:23,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740003595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:36:23,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:36:23,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 14:36:23,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319904071] [2022-04-27 14:36:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:36:23,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:36:23,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:23,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:23,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:23,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:36:23,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:23,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:36:23,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:36:23,763 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:23,835 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-27 14:36:23,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:36:23,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:36:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-27 14:36:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-27 14:36:23,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-27 14:36:23,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:23,860 INFO L225 Difference]: With dead ends: 38 [2022-04-27 14:36:23,861 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:36:23,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:36:23,861 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:23,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 64 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:36:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:36:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:36:23,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:23,862 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:36:23,862 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:36:23,862 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:36:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:23,863 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:36:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:36:23,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:23,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:23,863 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:36:23,863 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:36:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:23,863 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:36:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:36:23,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:23,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:23,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:23,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:23,863 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:36:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:36:23,864 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2022-04-27 14:36:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:23,864 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:36:23,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:36:23,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:23,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:36:23,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 14:36:24,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:24,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:36:24,245 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 14:36:24,245 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 14:36:24,245 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 14:36:24,246 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-27 14:36:24,246 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 14:36:24,246 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:36:24,246 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:36:24,246 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-27 14:36:24,246 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 1)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (<= main_~c~0 1)) (and (<= 0 main_~k~0) .cse0 (= main_~c~0 0) (= main_~y~0 0) .cse1))) [2022-04-27 14:36:24,246 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-04-27 14:36:24,246 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 1)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (<= main_~c~0 1)) (and (<= 0 main_~k~0) .cse0 (= main_~c~0 0) (= main_~y~0 0) .cse1))) [2022-04-27 14:36:24,246 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 40) no Hoare annotation was computed. [2022-04-27 14:36:24,246 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 0)) (let ((.cse0 (* main_~y~0 main_~y~0 main_~y~0))) (and (<= main_~k~0 1) (<= main_~x~0 .cse0) (< 0 main_~k~0) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* .cse0 2)) (* main_~x~0 4)) (<= main_~c~0 1)))) [2022-04-27 14:36:24,246 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-27 14:36:24,246 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-04-27 14:36:24,246 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 40) no Hoare annotation was computed. [2022-04-27 14:36:24,246 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-04-27 14:36:24,246 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) [2022-04-27 14:36:24,246 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:36:24,247 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:36:24,247 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:36:24,247 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:36:24,247 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:36:24,247 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:36:24,247 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:36:24,247 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-27 14:36:24,247 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-27 14:36:24,247 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-27 14:36:24,247 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:36:24,247 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:36:24,247 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 14:36:24,250 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-27 14:36:24,251 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:36:24,253 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:36:24,253 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:36:24,254 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:36:24,254 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:36:24,254 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:36:24,254 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:36:24,254 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:36:24,254 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:36:24,254 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:36:24,255 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:36:24,260 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:36:24,260 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:36:24,260 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:36:24,260 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:36:24,260 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:36:24,260 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:36:24,260 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:36:24,260 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:36:24,261 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:36:24,261 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:36:24,261 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:36:24,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:36:24 BoogieIcfgContainer [2022-04-27 14:36:24,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:36:24,268 INFO L158 Benchmark]: Toolchain (without parser) took 45892.79ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 135.2MB in the beginning and 89.4MB in the end (delta: 45.8MB). Peak memory consumption was 99.2MB. Max. memory is 8.0GB. [2022-04-27 14:36:24,268 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 186.6MB. Free memory was 151.4MB in the beginning and 151.3MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:36:24,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.97ms. Allocated memory is still 186.6MB. Free memory was 134.9MB in the beginning and 160.4MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:36:24,269 INFO L158 Benchmark]: Boogie Preprocessor took 33.52ms. Allocated memory is still 186.6MB. Free memory was 160.4MB in the beginning and 158.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:36:24,269 INFO L158 Benchmark]: RCFGBuilder took 212.88ms. Allocated memory is still 186.6MB. Free memory was 158.9MB in the beginning and 148.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:36:24,269 INFO L158 Benchmark]: TraceAbstraction took 45455.44ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 147.9MB in the beginning and 89.4MB in the end (delta: 58.5MB). Peak memory consumption was 112.5MB. Max. memory is 8.0GB. [2022-04-27 14:36:24,271 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.23ms. Allocated memory is still 186.6MB. Free memory was 151.4MB in the beginning and 151.3MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.97ms. Allocated memory is still 186.6MB. Free memory was 134.9MB in the beginning and 160.4MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.52ms. Allocated memory is still 186.6MB. Free memory was 160.4MB in the beginning and 158.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 212.88ms. Allocated memory is still 186.6MB. Free memory was 158.9MB in the beginning and 148.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 45455.44ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 147.9MB in the beginning and 89.4MB in the end (delta: 58.5MB). Peak memory consumption was 112.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: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.4s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 347 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 239 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 108 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 21 PreInvPairs, 29 NumberOfFragments, 211 HoareAnnotationTreeSize, 21 FomulaSimplifications, 22 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 34.5s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 464 SizeOfPredicates, 7 NumberOfNonLiveVariables, 360 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 40/46 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((1 <= c && k <= 1) && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c <= 1) || ((((0 <= k && k <= 1) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:36:24,288 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...