/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/ps3-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:32:22,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:32:22,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:32:22,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:32:22,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:32:22,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:32:22,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:32:22,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:32:22,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:32:22,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:32:22,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:32:22,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:32:22,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:32:22,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:32:22,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:32:22,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:32:22,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:32:22,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:32:22,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:32:22,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:32:22,136 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:32:22,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:32:22,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:32:22,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:32:22,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:32:22,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:32:22,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:32:22,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:32:22,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:32:22,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:32:22,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:32:22,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:32:22,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:32:22,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:32:22,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:32:22,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:32:22,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:32:22,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:32:22,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:32:22,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:32:22,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:32:22,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:32:22,155 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:32:22,175 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:32:22,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:32:22,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:32:22,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:32:22,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:32:22,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:32:22,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:32:22,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:32:22,177 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:32:22,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:32:22,177 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:32:22,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:32:22,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:32:22,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:32:22,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:32:22,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:32:22,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:32:22,178 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:32:22,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:32:22,178 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:32:22,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:32:22,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:32:22,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:32:22,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:32:22,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:32:22,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:32:22,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:32:22,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:32:22,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:32:22,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:32:22,180 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:32:22,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:32:22,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:32:22,180 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:32:22,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:32:22,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:32:22,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:32:22,386 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:32:22,386 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:32:22,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_unwindbound5.c [2022-04-27 14:32:22,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa67fa4de/b1d1820ce9ac4056a24f31fabe710e1e/FLAG11c4d4e45 [2022-04-27 14:32:22,764 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:32:22,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_unwindbound5.c [2022-04-27 14:32:22,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa67fa4de/b1d1820ce9ac4056a24f31fabe710e1e/FLAG11c4d4e45 [2022-04-27 14:32:23,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa67fa4de/b1d1820ce9ac4056a24f31fabe710e1e [2022-04-27 14:32:23,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:32:23,211 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:32:23,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:32:23,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:32:23,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:32:23,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:32:23" (1/1) ... [2022-04-27 14:32:23,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f50b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23, skipping insertion in model container [2022-04-27 14:32:23,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:32:23" (1/1) ... [2022-04-27 14:32:23,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:32:23,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:32:23,363 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/ps3-ll_unwindbound5.c[458,471] [2022-04-27 14:32:23,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:32:23,392 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:32:23,407 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/ps3-ll_unwindbound5.c[458,471] [2022-04-27 14:32:23,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:32:23,427 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:32:23,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23 WrapperNode [2022-04-27 14:32:23,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:32:23,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:32:23,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:32:23,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:32:23,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23" (1/1) ... [2022-04-27 14:32:23,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23" (1/1) ... [2022-04-27 14:32:23,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23" (1/1) ... [2022-04-27 14:32:23,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23" (1/1) ... [2022-04-27 14:32:23,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23" (1/1) ... [2022-04-27 14:32:23,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23" (1/1) ... [2022-04-27 14:32:23,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23" (1/1) ... [2022-04-27 14:32:23,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:32:23,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:32:23,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:32:23,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:32:23,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23" (1/1) ... [2022-04-27 14:32:23,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:32:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:32:23,478 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:32:23,479 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:32:23,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:32:23,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:32:23,503 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:32:23,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:32:23,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:32:23,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:32:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:32:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:32:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:32:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:32:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:32:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:32:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:32:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:32:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:32:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:32:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:32:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:32:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:32:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:32:23,550 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:32:23,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:32:23,677 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:32:23,682 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:32:23,682 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:32:23,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:32:23 BoogieIcfgContainer [2022-04-27 14:32:23,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:32:23,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:32:23,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:32:23,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:32:23,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:32:23" (1/3) ... [2022-04-27 14:32:23,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e539fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:32:23, skipping insertion in model container [2022-04-27 14:32:23,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:32:23" (2/3) ... [2022-04-27 14:32:23,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e539fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:32:23, skipping insertion in model container [2022-04-27 14:32:23,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:32:23" (3/3) ... [2022-04-27 14:32:23,707 INFO L111 eAbstractionObserver]: Analyzing ICFG ps3-ll_unwindbound5.c [2022-04-27 14:32:23,721 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:32:23,721 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:32:23,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:32:23,763 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@16566f12, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4239c3bd [2022-04-27 14:32:23,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:32:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:32:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 14:32:23,776 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:32:23,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:32:23,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:32:23,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:32:23,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-27 14:32:23,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:32:23,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301611927] [2022-04-27 14:32:23,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:32:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:32:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:23,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-27 14:32:23,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 14:32:23,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-27 14:32:23,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:32:23,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-27 14:32:23,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 14:32:23,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-27 14:32:23,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2022-04-27 14:32:23,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25#true} is VALID [2022-04-27 14:32:23,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-27 14:32:23,953 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-27 14:32:23,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 14:32:23,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 14:32:23,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 14:32:23,954 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:32:23,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:32:23,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301611927] [2022-04-27 14:32:23,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301611927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:32:23,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:32:23,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:32:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436662250] [2022-04-27 14:32:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:32:23,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:32:23,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:32:23,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:23,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:23,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:32:23,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:32:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:32:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:32:24,000 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:24,078 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-27 14:32:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:32:24,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:32:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:32:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 14:32:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 14:32:24,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-27 14:32:24,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:24,149 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:32:24,149 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 14:32:24,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:32:24,154 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:32:24,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:32:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 14:32:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-27 14:32:24,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:32:24,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:24,178 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:24,179 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:24,181 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 14:32:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 14:32:24,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:24,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:24,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-27 14:32:24,183 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-27 14:32:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:24,185 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 14:32:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 14:32:24,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:24,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:24,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:32:24,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:32:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 14:32:24,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-27 14:32:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:32:24,189 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 14:32:24,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 14:32:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:32:24,190 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:32:24,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:32:24,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:32:24,190 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:32:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:32:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-27 14:32:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:32:24,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485897742] [2022-04-27 14:32:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:32:24,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:32:24,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606228973] [2022-04-27 14:32:24,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:24,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:32:24,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:32:24,211 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:32:24,222 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:32:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:24,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:32:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:24,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:32:24,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2022-04-27 14:32:24,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {154#(<= ~counter~0 0)} is VALID [2022-04-27 14:32:24,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#(<= ~counter~0 0)} assume true; {154#(<= ~counter~0 0)} is VALID [2022-04-27 14:32:24,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#(<= ~counter~0 0)} {146#true} #54#return; {154#(<= ~counter~0 0)} is VALID [2022-04-27 14:32:24,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#(<= ~counter~0 0)} call #t~ret6 := main(); {154#(<= ~counter~0 0)} is VALID [2022-04-27 14:32:24,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(<= ~counter~0 0)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {154#(<= ~counter~0 0)} is VALID [2022-04-27 14:32:24,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {170#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:32:24,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {147#false} is VALID [2022-04-27 14:32:24,435 INFO L272 TraceCheckUtils]: 8: Hoare triple {147#false} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {147#false} is VALID [2022-04-27 14:32:24,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {147#false} ~cond := #in~cond; {147#false} is VALID [2022-04-27 14:32:24,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {147#false} assume 0 == ~cond; {147#false} is VALID [2022-04-27 14:32:24,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-04-27 14:32:24,437 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:32:24,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:32:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:32:24,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485897742] [2022-04-27 14:32:24,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:32:24,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606228973] [2022-04-27 14:32:24,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606228973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:32:24,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:32:24,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:32:24,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631813530] [2022-04-27 14:32:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:32:24,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:32:24,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:32:24,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:24,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:24,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:32:24,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:32:24,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:32:24,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:32:24,461 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:24,513 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 14:32:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:32:24,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:32:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:32:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 14:32:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 14:32:24,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-27 14:32:24,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:24,555 INFO L225 Difference]: With dead ends: 26 [2022-04-27 14:32:24,555 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 14:32:24,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:32:24,559 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:32:24,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:32:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 14:32:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 14:32:24,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:32:24,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:24,569 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:24,569 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:24,572 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 14:32:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 14:32:24,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:24,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:24,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-27 14:32:24,574 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-27 14:32:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:24,577 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 14:32:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 14:32:24,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:24,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:24,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:32:24,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:32:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 14:32:24,580 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-27 14:32:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:32:24,580 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 14:32:24,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 14:32:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:32:24,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:32:24,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:32:24,608 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:32:24,807 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:32:24,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:32:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:32:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-27 14:32:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:32:24,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113759811] [2022-04-27 14:32:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:32:24,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:32:24,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [309324551] [2022-04-27 14:32:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:24,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:32:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:32:24,827 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:32:24,828 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:32:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:24,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:32:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:24,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:32:24,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {288#true} is VALID [2022-04-27 14:32:24,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {288#true} is VALID [2022-04-27 14:32:24,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-27 14:32:24,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #54#return; {288#true} is VALID [2022-04-27 14:32:24,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret6 := main(); {288#true} is VALID [2022-04-27 14:32:24,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {308#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:32:24,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {308#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {308#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:32:25,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {308#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {308#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:32:25,002 INFO L272 TraceCheckUtils]: 8: Hoare triple {308#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:32:25,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:32:25,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {289#false} is VALID [2022-04-27 14:32:25,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-27 14:32:25,009 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:32:25,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:32:25,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:32:25,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113759811] [2022-04-27 14:32:25,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:32:25,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309324551] [2022-04-27 14:32:25,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309324551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:32:25,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:32:25,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:32:25,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339643730] [2022-04-27 14:32:25,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:32:25,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:32:25,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:32:25,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:25,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:25,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:32:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:32:25,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:32:25,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:32:25,023 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:25,114 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 14:32:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:32:25,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:32:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:32:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 14:32:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 14:32:25,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-27 14:32:25,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:25,151 INFO L225 Difference]: With dead ends: 28 [2022-04-27 14:32:25,151 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 14:32:25,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:32:25,154 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:32:25,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:32:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 14:32:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 14:32:25,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:32:25,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:32:25,173 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:32:25,174 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:32:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:25,176 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 14:32:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 14:32:25,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:25,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:25,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 14:32:25,177 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 14:32:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:25,183 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 14:32:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 14:32:25,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:25,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:25,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:32:25,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:32:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:32:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 14:32:25,186 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-27 14:32:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:32:25,187 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 14:32:25,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:32:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 14:32:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:32:25,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:32:25,189 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:32:25,206 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:32:25,395 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:32:25,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:32:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:32:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-27 14:32:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:32:25,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387092640] [2022-04-27 14:32:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:32:25,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:32:25,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1632676424] [2022-04-27 14:32:25,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:25,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:32:25,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:32:25,413 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:32:25,424 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:32:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:25,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:32:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:25,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:32:25,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2022-04-27 14:32:25,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:32:25,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#(<= ~counter~0 0)} assume true; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:32:25,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {464#(<= ~counter~0 0)} {456#true} #54#return; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:32:25,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {464#(<= ~counter~0 0)} call #t~ret6 := main(); {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:32:25,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#(<= ~counter~0 0)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:32:25,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:32:25,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:32:25,612 INFO L272 TraceCheckUtils]: 8: Hoare triple {480#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:32:25,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {480#(<= ~counter~0 1)} ~cond := #in~cond; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:32:25,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {480#(<= ~counter~0 1)} assume !(0 == ~cond); {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:32:25,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {480#(<= ~counter~0 1)} assume true; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:32:25,614 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {480#(<= ~counter~0 1)} {480#(<= ~counter~0 1)} #50#return; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:32:25,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:32:25,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {480#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {505#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:32:25,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {505#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {457#false} is VALID [2022-04-27 14:32:25,616 INFO L272 TraceCheckUtils]: 16: Hoare triple {457#false} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {457#false} is VALID [2022-04-27 14:32:25,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {457#false} ~cond := #in~cond; {457#false} is VALID [2022-04-27 14:32:25,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {457#false} assume 0 == ~cond; {457#false} is VALID [2022-04-27 14:32:25,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-04-27 14:32:25,616 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:32:25,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:32:25,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-04-27 14:32:25,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {457#false} assume 0 == ~cond; {457#false} is VALID [2022-04-27 14:32:25,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {457#false} ~cond := #in~cond; {457#false} is VALID [2022-04-27 14:32:25,761 INFO L272 TraceCheckUtils]: 16: Hoare triple {457#false} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {457#false} is VALID [2022-04-27 14:32:25,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {533#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {457#false} is VALID [2022-04-27 14:32:25,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {537#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {533#(< |main_#t~post5| 5)} is VALID [2022-04-27 14:32:25,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#(< ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {537#(< ~counter~0 5)} is VALID [2022-04-27 14:32:25,764 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {456#true} {537#(< ~counter~0 5)} #50#return; {537#(< ~counter~0 5)} is VALID [2022-04-27 14:32:25,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-27 14:32:25,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#true} assume !(0 == ~cond); {456#true} is VALID [2022-04-27 14:32:25,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#true} ~cond := #in~cond; {456#true} is VALID [2022-04-27 14:32:25,764 INFO L272 TraceCheckUtils]: 8: Hoare triple {537#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {456#true} is VALID [2022-04-27 14:32:25,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {537#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {537#(< ~counter~0 5)} is VALID [2022-04-27 14:32:25,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {562#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {537#(< ~counter~0 5)} is VALID [2022-04-27 14:32:25,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {562#(< ~counter~0 4)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {562#(< ~counter~0 4)} is VALID [2022-04-27 14:32:25,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {562#(< ~counter~0 4)} call #t~ret6 := main(); {562#(< ~counter~0 4)} is VALID [2022-04-27 14:32:25,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {562#(< ~counter~0 4)} {456#true} #54#return; {562#(< ~counter~0 4)} is VALID [2022-04-27 14:32:25,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {562#(< ~counter~0 4)} assume true; {562#(< ~counter~0 4)} is VALID [2022-04-27 14:32:25,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {562#(< ~counter~0 4)} is VALID [2022-04-27 14:32:25,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2022-04-27 14:32:25,770 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:32:25,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:32:25,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387092640] [2022-04-27 14:32:25,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:32:25,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632676424] [2022-04-27 14:32:25,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632676424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:32:25,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:32:25,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:32:25,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756061747] [2022-04-27 14:32:25,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:32:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:32:25,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:32:25,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:32:25,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:25,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:32:25,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:32:25,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:32:25,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:32:25,799 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:32:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:25,957 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-27 14:32:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:32:25,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:32:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:32:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:32:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-27 14:32:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:32:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-27 14:32:25,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-27 14:32:26,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:26,014 INFO L225 Difference]: With dead ends: 56 [2022-04-27 14:32:26,014 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 14:32:26,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:32:26,017 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:32:26,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 69 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:32:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 14:32:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-04-27 14:32:26,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:32:26,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:32:26,038 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:32:26,038 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:32:26,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:26,044 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-27 14:32:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-27 14:32:26,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:26,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:26,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 49 states. [2022-04-27 14:32:26,051 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 49 states. [2022-04-27 14:32:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:26,053 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-27 14:32:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-27 14:32:26,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:26,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:26,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:32:26,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:32:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:32:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-27 14:32:26,056 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 20 [2022-04-27 14:32:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:32:26,056 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-27 14:32:26,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:32:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:32:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:32:26,057 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:32:26,057 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:32:26,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:32:26,275 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:32:26,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:32:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:32:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-27 14:32:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:32:26,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951127446] [2022-04-27 14:32:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:32:26,287 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:32:26,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210853370] [2022-04-27 14:32:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:26,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:32:26,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:32:26,289 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:32:26,311 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:32:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:26,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:32:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:26,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:32:26,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2022-04-27 14:32:26,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {830#true} is VALID [2022-04-27 14:32:26,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 14:32:26,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #54#return; {830#true} is VALID [2022-04-27 14:32:26,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret6 := main(); {830#true} is VALID [2022-04-27 14:32:26,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {830#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {850#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:32:26,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {850#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {850#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:32:26,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {850#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:32:26,463 INFO L272 TraceCheckUtils]: 8: Hoare triple {850#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {830#true} is VALID [2022-04-27 14:32:26,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#true} ~cond := #in~cond; {830#true} is VALID [2022-04-27 14:32:26,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {830#true} assume !(0 == ~cond); {830#true} is VALID [2022-04-27 14:32:26,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 14:32:26,464 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {830#true} {850#(and (= main_~x~0 0) (= main_~y~0 0))} #50#return; {850#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:32:26,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {850#(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 + ~x~0; {875#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:32:26,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {875#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {875#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:32:26,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {875#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {875#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:32:26,470 INFO L272 TraceCheckUtils]: 16: Hoare triple {875#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {885#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:32:26,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {885#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {889#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:32:26,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {889#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {831#false} is VALID [2022-04-27 14:32:26,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {831#false} assume !false; {831#false} is VALID [2022-04-27 14:32:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:32:26,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:32:26,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {831#false} assume !false; {831#false} is VALID [2022-04-27 14:32:26,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {889#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {831#false} is VALID [2022-04-27 14:32:26,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {885#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {889#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:32:26,603 INFO L272 TraceCheckUtils]: 16: Hoare triple {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {885#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:32:26,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-27 14:32:26,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-27 14:32:26,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-27 14:32:26,787 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {830#true} {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} #50#return; {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-27 14:32:26,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 14:32:26,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {830#true} assume !(0 == ~cond); {830#true} is VALID [2022-04-27 14:32:26,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#true} ~cond := #in~cond; {830#true} is VALID [2022-04-27 14:32:26,788 INFO L272 TraceCheckUtils]: 8: Hoare triple {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {830#true} is VALID [2022-04-27 14:32:26,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-27 14:32:26,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-27 14:32:26,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {830#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {905#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-27 14:32:26,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret6 := main(); {830#true} is VALID [2022-04-27 14:32:26,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #54#return; {830#true} is VALID [2022-04-27 14:32:26,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 14:32:26,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {830#true} is VALID [2022-04-27 14:32:26,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2022-04-27 14:32:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 14:32:26,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:32:26,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951127446] [2022-04-27 14:32:26,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:32:26,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210853370] [2022-04-27 14:32:26,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210853370] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:32:26,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:32:26,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:32:26,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670417689] [2022-04-27 14:32:26,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:32:26,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:32:26,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:32:26,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:28,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:28,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:32:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:32:28,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:32:28,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:32:28,812 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:28,906 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:32:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:32:28,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:32:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:32:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-27 14:32:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-27 14:32:28,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-27 14:32:31,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:31,182 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:32:31,182 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:32:31,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:32:31,184 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:32:31,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:32:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:32:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:32:31,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:32:31,185 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:32:31,185 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:32:31,185 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:32:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:31,185 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:32:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:32:31,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:31,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:31,194 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:32:31,194 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:32:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:31,194 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:32:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:32:31,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:31,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:31,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:32:31,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:32:31,195 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:32:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:32:31,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-27 14:32:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:32:31,195 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:32:31,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:32:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:32:31,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:31,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:32:31,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:32:31,419 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:32:31,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:32:31,487 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 14:32:31,487 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 14:32:31,488 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 14:32:31,488 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:32:31,488 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 14:32:31,488 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:32:31,488 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:32:31,488 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 18 39) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-27 14:32:31,488 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6)) (not (<= |old(~counter~0)| 0))) [2022-04-27 14:32:31,488 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-04-27 14:32:31,488 INFO L899 garLoopResultBuilder]: For program point L27-1(lines 27 36) no Hoare annotation was computed. [2022-04-27 14:32:31,488 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 18 39) no Hoare annotation was computed. [2022-04-27 14:32:31,489 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (or (= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6)) (not (<= |old(~counter~0)| 0))) [2022-04-27 14:32:31,489 INFO L895 garLoopResultBuilder]: At program point L27-4(lines 27 36) the Hoare annotation is: (or (= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6)) (not (<= |old(~counter~0)| 0))) [2022-04-27 14:32:31,489 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 18 39) no Hoare annotation was computed. [2022-04-27 14:32:31,489 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-27 14:32:31,489 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:32:31,489 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:32:31,489 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:32:31,489 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:32:31,489 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-27 14:32:31,489 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:32:31,489 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:32:31,489 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-27 14:32:31,490 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-27 14:32:31,490 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-27 14:32:31,490 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:32:31,490 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:32:31,490 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 14:32:31,493 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 14:32:31,494 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:32:31,497 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:32:31,497 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:32:31,498 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:32:31,499 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:32:31,499 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:32:31,499 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:32:31,499 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:32:31,499 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:32:31,499 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:32:31,500 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:32:31,501 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:32:31,501 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:32:31,501 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:32:31,501 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:32:31,501 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:32:31,501 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:32:31,501 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:32:31,501 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:32:31,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:32:31 BoogieIcfgContainer [2022-04-27 14:32:31,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:32:31,510 INFO L158 Benchmark]: Toolchain (without parser) took 8298.79ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 122.1MB in the beginning and 176.5MB in the end (delta: -54.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:32:31,510 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory was 138.0MB in the beginning and 137.9MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:32:31,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.37ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 121.8MB in the beginning and 185.4MB in the end (delta: -63.5MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-04-27 14:32:31,511 INFO L158 Benchmark]: Boogie Preprocessor took 24.51ms. Allocated memory is still 209.7MB. Free memory was 185.4MB in the beginning and 183.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 14:32:31,511 INFO L158 Benchmark]: RCFGBuilder took 233.15ms. Allocated memory is still 209.7MB. Free memory was 183.8MB in the beginning and 172.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:32:31,511 INFO L158 Benchmark]: TraceAbstraction took 7807.07ms. Allocated memory is still 209.7MB. Free memory was 172.4MB in the beginning and 176.5MB in the end (delta: -4.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:32:31,513 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.11ms. Allocated memory is still 174.1MB. Free memory was 138.0MB in the beginning and 137.9MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.37ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 121.8MB in the beginning and 185.4MB in the end (delta: -63.5MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.51ms. Allocated memory is still 209.7MB. Free memory was 185.4MB in the beginning and 183.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 233.15ms. Allocated memory is still 209.7MB. Free memory was 183.8MB in the beginning and 172.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7807.07ms. Allocated memory is still 209.7MB. Free memory was 172.4MB in the beginning and 176.5MB in the end (delta: -4.1MB). There was no memory consumed. 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 89 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 27, 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 19 PreInvPairs, 32 NumberOfFragments, 89 HoareAnnotationTreeSize, 19 FomulaSimplifications, 203 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 59 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 376 SizeOfPredicates, 5 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 11/18 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: 3 * (y * y) + y + y * y * y * 2 == x * 6 || !(\old(counter) <= 0) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:32:31,529 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...