/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/ps5-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:39:20,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:39:20,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:39:20,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:39:20,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:39:20,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:39:20,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:39:20,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:39:20,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:39:20,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:39:20,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:39:20,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:39:20,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:39:20,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:39:20,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:39:20,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:39:20,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:39:20,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:39:20,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:39:20,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:39:20,374 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:39:20,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:39:20,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:39:20,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:39:20,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:39:20,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:39:20,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:39:20,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:39:20,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:39:20,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:39:20,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:39:20,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:39:20,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:39:20,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:39:20,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:39:20,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:39:20,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:39:20,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:39:20,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:39:20,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:39:20,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:39:20,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:39:20,386 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:39:20,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:39:20,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:39:20,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:39:20,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:39:20,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:39:20,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:39:20,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:39:20,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:39:20,409 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:39:20,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:39:20,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:39:20,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:39:20,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:39:20,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:39:20,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:39:20,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:39:20,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:39:20,411 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:39:20,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:39:20,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:39:20,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:39:20,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:39:20,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:39:20,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:39:20,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:39:20,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:39:20,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:39:20,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:39:20,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:39:20,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:39:20,412 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:39:20,412 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:39:20,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:39:20,413 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:39:20,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:39:20,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:39:20,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:39:20,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:39:20,620 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:39:20,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound5.c [2022-04-27 14:39:20,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d783d2a80/4c47fbf32fb649a6a94bc82d070442c9/FLAGc4a745cd7 [2022-04-27 14:39:21,055 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:39:21,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound5.c [2022-04-27 14:39:21,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d783d2a80/4c47fbf32fb649a6a94bc82d070442c9/FLAGc4a745cd7 [2022-04-27 14:39:21,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d783d2a80/4c47fbf32fb649a6a94bc82d070442c9 [2022-04-27 14:39:21,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:39:21,077 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:39:21,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:39:21,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:39:21,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:39:21,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:39:21" (1/1) ... [2022-04-27 14:39:21,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc2c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21, skipping insertion in model container [2022-04-27 14:39:21,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:39:21" (1/1) ... [2022-04-27 14:39:21,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:39:21,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:39:21,261 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/ps5-ll_unwindbound5.c[458,471] [2022-04-27 14:39:21,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:39:21,296 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:39:21,308 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/ps5-ll_unwindbound5.c[458,471] [2022-04-27 14:39:21,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:39:21,331 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:39:21,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21 WrapperNode [2022-04-27 14:39:21,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:39:21,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:39:21,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:39:21,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:39:21,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21" (1/1) ... [2022-04-27 14:39:21,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21" (1/1) ... [2022-04-27 14:39:21,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21" (1/1) ... [2022-04-27 14:39:21,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21" (1/1) ... [2022-04-27 14:39:21,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21" (1/1) ... [2022-04-27 14:39:21,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21" (1/1) ... [2022-04-27 14:39:21,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21" (1/1) ... [2022-04-27 14:39:21,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:39:21,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:39:21,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:39:21,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:39:21,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21" (1/1) ... [2022-04-27 14:39:21,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:39:21,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:21,397 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:39:21,415 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:39:21,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:39:21,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:39:21,430 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:39:21,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:39:21,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:39:21,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:39:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:39:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:39:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:39:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:39:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:39:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:39:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:39:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:39:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:39:21,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:39:21,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:39:21,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:39:21,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:39:21,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:39:21,476 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:39:21,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:39:21,593 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:39:21,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:39:21,597 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:39:21,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:39:21 BoogieIcfgContainer [2022-04-27 14:39:21,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:39:21,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:39:21,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:39:21,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:39:21,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:39:21" (1/3) ... [2022-04-27 14:39:21,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c75c0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:39:21, skipping insertion in model container [2022-04-27 14:39:21,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:21" (2/3) ... [2022-04-27 14:39:21,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c75c0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:39:21, skipping insertion in model container [2022-04-27 14:39:21,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:39:21" (3/3) ... [2022-04-27 14:39:21,620 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound5.c [2022-04-27 14:39:21,629 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:39:21,629 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:39:21,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:39:21,673 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@107ce91, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e1fef28 [2022-04-27 14:39:21,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:39:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:39:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:39:21,685 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:21,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:21,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-27 14:39:21,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:21,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722501535] [2022-04-27 14:39:21,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:21,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:39:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:21,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(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; {32#true} is VALID [2022-04-27 14:39:21,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:39:21,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 14:39:21,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:39:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:21,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:39:21,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:39:21,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:39:21,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:39:21,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:39:21,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(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; {32#true} is VALID [2022-04-27 14:39:21,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:39:21,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 14:39:21,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-27 14:39:21,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#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; {32#true} is VALID [2022-04-27 14:39:21,891 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:39:21,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:39:21,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:39:21,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:39:21,892 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:39:21,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:39:21,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-27 14:39:21,893 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-27 14:39:21,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:39:21,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:39:21,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:39:21,894 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:39:21,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:21,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722501535] [2022-04-27 14:39:21,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722501535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:39:21,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:39:21,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:39:21,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261697726] [2022-04-27 14:39:21,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:39:21,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:39:21,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:21,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:21,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:21,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:39:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:21,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:39:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:39:21,956 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:22,095 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-27 14:39:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:39:22,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:39:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-27 14:39:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-27 14:39:22,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-27 14:39:22,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:22,199 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:39:22,200 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 14:39:22,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:39:22,205 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:22,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:39:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 14:39:22,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-27 14:39:22,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:22,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:22,236 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:22,237 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:22,239 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 14:39:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:39:22,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:22,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:22,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 14:39:22,241 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 14:39:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:22,243 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 14:39:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:39:22,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:22,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:22,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:22,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:39:22,246 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-27 14:39:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:22,246 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:39:22,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:39:22,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:39:22,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:22,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:22,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:39:22,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-27 14:39:22,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:22,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424890065] [2022-04-27 14:39:22,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:22,277 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:22,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426047208] [2022-04-27 14:39:22,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:22,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:22,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:22,284 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:39:22,285 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:39:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:22,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:39:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:22,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:22,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 14:39:22,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#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; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#(<= ~counter~0 0)} {196#true} #61#return; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#(<= ~counter~0 0)} call #t~ret6 := main(); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#(<= ~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; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,452 INFO L272 TraceCheckUtils]: 6: Hoare triple {204#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#(<= ~counter~0 0)} ~cond := #in~cond; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(<= ~counter~0 0)} assume !(0 == ~cond); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,454 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204#(<= ~counter~0 0)} {204#(<= ~counter~0 0)} #53#return; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:22,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {238#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:39:22,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {197#false} is VALID [2022-04-27 14:39:22,456 INFO L272 TraceCheckUtils]: 14: Hoare triple {197#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {197#false} is VALID [2022-04-27 14:39:22,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 14:39:22,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 14:39:22,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 14:39:22,457 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:39:22,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:39:22,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:22,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424890065] [2022-04-27 14:39:22,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:22,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426047208] [2022-04-27 14:39:22,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426047208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:39:22,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:39:22,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:39:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411390997] [2022-04-27 14:39:22,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:39:22,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:39:22,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:22,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:39:22,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:22,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:39:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:22,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:39:22,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:39:22,507 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:39:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:22,568 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:39:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:39:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:39:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:39:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:39:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:39:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:39:22,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 14:39:22,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:22,611 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:39:22,611 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:39:22,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:39:22,613 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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:39:22,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:39:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:39:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:39:22,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:22,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:22,623 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:22,623 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:22,626 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:39:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:39:22,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:22,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:22,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:39:22,628 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:39:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:22,630 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:39:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:39:22,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:22,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:22,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:22,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:39:22,635 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-27 14:39:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:22,635 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:39:22,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:39:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:39:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:39:22,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:22,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:22,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:39:22,847 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:39:22,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-27 14:39:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:22,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38581750] [2022-04-27 14:39:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:22,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:22,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [365526637] [2022-04-27 14:39:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:22,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:22,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:22,866 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:39:22,869 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:39:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:22,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:39:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:22,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:22,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2022-04-27 14:39:22,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#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; {392#true} is VALID [2022-04-27 14:39:22,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-27 14:39:22,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {392#true} {392#true} #61#return; {392#true} is VALID [2022-04-27 14:39:22,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {392#true} call #t~ret6 := main(); {392#true} is VALID [2022-04-27 14:39:22,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#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; {392#true} is VALID [2022-04-27 14:39:22,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {392#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {392#true} is VALID [2022-04-27 14:39:22,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2022-04-27 14:39:22,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2022-04-27 14:39:22,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-27 14:39:22,995 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {392#true} {392#true} #53#return; {392#true} is VALID [2022-04-27 14:39:22,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {392#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:22,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:22,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:22,997 INFO L272 TraceCheckUtils]: 14: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {440#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:22,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {444#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:22,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {444#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {393#false} is VALID [2022-04-27 14:39:22,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#false} assume !false; {393#false} is VALID [2022-04-27 14:39:22,998 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:39:22,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:39:22,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:22,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38581750] [2022-04-27 14:39:22,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:22,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365526637] [2022-04-27 14:39:22,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365526637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:39:22,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:39:22,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:39:22,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560186333] [2022-04-27 14:39:22,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:39:22,999 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), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:39:23,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:23,000 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:23,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:23,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:39:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:39:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:39:23,016 INFO L87 Difference]: Start difference. First operand 26 states and 29 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:23,147 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:39:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:39:23,147 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), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:39:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:23,148 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:39:23,149 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:39:23,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-27 14:39:23,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:23,192 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:39:23,192 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 14:39:23,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:39:23,195 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:23,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:39:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 14:39:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 14:39:23,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:23,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:39:23,204 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:39:23,204 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:39:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:23,206 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 14:39:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:39:23,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:23,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:23,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 14:39:23,207 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 14:39:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:23,208 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 14:39:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:39:23,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:23,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:23,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:23,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:39:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 14:39:23,210 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-27 14:39:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:23,210 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 14:39:23,210 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:39:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:39:23,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:23,211 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:23,227 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:39:23,427 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:39:23,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:23,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-27 14:39:23,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:23,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184815597] [2022-04-27 14:39:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:23,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:23,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:23,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071283751] [2022-04-27 14:39:23,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:23,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:23,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:23,443 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:39:23,444 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:39:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:23,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:39:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:23,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:23,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-27 14:39:23,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#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; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#(<= ~counter~0 0)} {614#true} #61#return; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#(<= ~counter~0 0)} call #t~ret6 := main(); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#(<= ~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; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {622#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(<= ~counter~0 0)} ~cond := #in~cond; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {622#(<= ~counter~0 0)} assume !(0 == ~cond); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {622#(<= ~counter~0 0)} {622#(<= ~counter~0 0)} #53#return; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {622#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:23,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {622#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:23,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:23,638 INFO L272 TraceCheckUtils]: 14: Hoare triple {656#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:23,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#(<= ~counter~0 1)} ~cond := #in~cond; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:23,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= ~counter~0 1)} assume !(0 == ~cond); {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:23,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#(<= ~counter~0 1)} assume true; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:23,648 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {656#(<= ~counter~0 1)} {656#(<= ~counter~0 1)} #55#return; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:23,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:23,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {681#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:39:23,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {615#false} is VALID [2022-04-27 14:39:23,651 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {615#false} is VALID [2022-04-27 14:39:23,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 14:39:23,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 14:39:23,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 14:39:23,651 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:39:23,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:23,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 14:39:23,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 14:39:23,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 14:39:23,822 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {615#false} is VALID [2022-04-27 14:39:23,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {709#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {615#false} is VALID [2022-04-27 14:39:23,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {713#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {709#(< |main_#t~post5| 5)} is VALID [2022-04-27 14:39:23,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#(< ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {713#(< ~counter~0 5)} is VALID [2022-04-27 14:39:23,824 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {614#true} {713#(< ~counter~0 5)} #55#return; {713#(< ~counter~0 5)} is VALID [2022-04-27 14:39:23,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 14:39:23,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-27 14:39:23,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-27 14:39:23,825 INFO L272 TraceCheckUtils]: 14: Hoare triple {713#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {614#true} is VALID [2022-04-27 14:39:23,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {713#(< ~counter~0 5)} is VALID [2022-04-27 14:39:23,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {738#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {713#(< ~counter~0 5)} is VALID [2022-04-27 14:39:23,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {738#(< ~counter~0 4)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {738#(< ~counter~0 4)} is VALID [2022-04-27 14:39:23,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {614#true} {738#(< ~counter~0 4)} #53#return; {738#(< ~counter~0 4)} is VALID [2022-04-27 14:39:23,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 14:39:23,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-27 14:39:23,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-27 14:39:23,827 INFO L272 TraceCheckUtils]: 6: Hoare triple {738#(< ~counter~0 4)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {614#true} is VALID [2022-04-27 14:39:23,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#(< ~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; {738#(< ~counter~0 4)} is VALID [2022-04-27 14:39:23,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#(< ~counter~0 4)} call #t~ret6 := main(); {738#(< ~counter~0 4)} is VALID [2022-04-27 14:39:23,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#(< ~counter~0 4)} {614#true} #61#return; {738#(< ~counter~0 4)} is VALID [2022-04-27 14:39:23,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#(< ~counter~0 4)} assume true; {738#(< ~counter~0 4)} is VALID [2022-04-27 14:39:23,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#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; {738#(< ~counter~0 4)} is VALID [2022-04-27 14:39:23,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-27 14:39:23,830 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:39:23,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:23,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184815597] [2022-04-27 14:39:23,830 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:23,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071283751] [2022-04-27 14:39:23,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071283751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:39:23,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:39:23,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:39:23,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864837541] [2022-04-27 14:39:23,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:23,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 14:39:23,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:23,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:23,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:23,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:39:23,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:23,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:39:23,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:39:23,865 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:24,043 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 14:39:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:39:24,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 14:39:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-27 14:39:24,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-27 14:39:24,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2022-04-27 14:39:24,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:24,106 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:39:24,106 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:39:24,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 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:39:24,108 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:24,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:39:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:39:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-04-27 14:39:24,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:24,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:24,125 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:24,126 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:24,128 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 14:39:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 14:39:24,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:24,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:24,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 14:39:24,129 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 14:39:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:24,136 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 14:39:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 14:39:24,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:24,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:24,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:24,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 14:39:24,144 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 26 [2022-04-27 14:39:24,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:24,144 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 14:39:24,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:39:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:39:24,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:24,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:24,160 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:39:24,345 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:39:24,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:24,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-27 14:39:24,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:24,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335924854] [2022-04-27 14:39:24,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:24,359 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:24,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629366396] [2022-04-27 14:39:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:24,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:24,360 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:39:24,379 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:39:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:24,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:39:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:24,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:24,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-27 14:39:24,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:39:24,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:24,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-27 14:39:24,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-27 14:39:24,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:39:24,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:39:24,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:39:24,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:39:24,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:24,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-27 14:39:24,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:24,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:24,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:24,546 INFO L272 TraceCheckUtils]: 14: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:39:24,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:39:24,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:39:24,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:24,546 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:24,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 14:39:24,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 14:39:24,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 14:39:24,549 INFO L272 TraceCheckUtils]: 22: Hoare triple {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:24,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:24,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-27 14:39:24,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-27 14:39:24,550 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:39:24,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:24,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-27 14:39:24,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-27 14:39:24,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:24,792 INFO L272 TraceCheckUtils]: 22: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:24,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(#t~post5 < 5);havoc #t~post5; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:24,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:26,802 WARN L290 TraceCheckUtils]: 19: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-27 14:39:26,808 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #55#return; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:26,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:26,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:39:26,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:39:26,808 INFO L272 TraceCheckUtils]: 14: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:39:26,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(#t~post5 < 5);havoc #t~post5; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:26,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:26,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:26,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-27 14:39:26,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:26,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:39:26,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:39:26,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:39:26,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:39:26,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-27 14:39:26,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-27 14:39:26,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:26,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:39:26,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-27 14:39:26,811 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:39:26,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:26,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335924854] [2022-04-27 14:39:26,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:26,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629366396] [2022-04-27 14:39:26,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629366396] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:26,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:26,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:39:26,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538805684] [2022-04-27 14:39:26,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:39:26,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 14:39:26,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:26,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:39:27,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:27,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:39:27,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:27,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:39:27,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:39:27,680 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:39:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:27,817 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-27 14:39:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:39:27,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 14:39:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:39:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:39:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:39:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:39:27,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:39:28,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:28,032 INFO L225 Difference]: With dead ends: 68 [2022-04-27 14:39:28,032 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 14:39:28,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:39:28,032 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:28,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:39:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 14:39:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-27 14:39:28,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:28,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:28,050 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:28,051 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:28,052 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 14:39:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 14:39:28,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:28,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:28,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 14:39:28,053 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 14:39:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:28,055 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 14:39:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 14:39:28,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:28,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:28,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:28,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-04-27 14:39:28,057 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 26 [2022-04-27 14:39:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:28,057 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-04-27 14:39:28,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:39:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-27 14:39:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:39:28,058 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:28,058 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:28,071 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:39:28,262 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:39:28,262 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:28,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:28,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-27 14:39:28,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:28,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266171845] [2022-04-27 14:39:28,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:28,277 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:28,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917819010] [2022-04-27 14:39:28,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:28,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:28,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:28,278 INFO L229 MonitoredProcess]: Starting monitored process 6 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:39:28,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:39:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:28,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:39:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:28,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:28,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2022-04-27 14:39:28,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#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; {1530#true} is VALID [2022-04-27 14:39:28,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:39:28,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1530#true} {1530#true} #61#return; {1530#true} is VALID [2022-04-27 14:39:28,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {1530#true} call #t~ret6 := main(); {1530#true} is VALID [2022-04-27 14:39:28,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {1530#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; {1530#true} is VALID [2022-04-27 14:39:28,611 INFO L272 TraceCheckUtils]: 6: Hoare triple {1530#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:39:28,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:39:28,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:39:28,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:39:28,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1530#true} {1530#true} #53#return; {1530#true} is VALID [2022-04-27 14:39:28,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {1530#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:28,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:28,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:28,613 INFO L272 TraceCheckUtils]: 14: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:39:28,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:39:28,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:39:28,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:39:28,616 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1530#true} {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:28,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:39:28,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:39:28,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:39:28,617 INFO L272 TraceCheckUtils]: 22: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:39:28,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:39:28,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:39:28,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:39:28,621 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1530#true} {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:39:28,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:28,621 INFO L272 TraceCheckUtils]: 28: Hoare triple {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:39:28,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:39:28,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:39:28,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:39:28,622 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1530#true} {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:28,622 INFO L272 TraceCheckUtils]: 33: Hoare triple {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:28,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:28,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {1641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1531#false} is VALID [2022-04-27 14:39:28,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2022-04-27 14:39:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:39:28,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:28,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266171845] [2022-04-27 14:39:28,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:28,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917819010] [2022-04-27 14:39:28,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917819010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:28,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:28,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:39:28,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268215278] [2022-04-27 14:39:28,886 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:39:28,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:28,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:39:28,910 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:39:28,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:39:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:28,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:39:28,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:39:28,911 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:39:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:29,117 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-27 14:39:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:39:29,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:39:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:39:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 14:39:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:39:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 14:39:29,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-27 14:39:29,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:29,152 INFO L225 Difference]: With dead ends: 59 [2022-04-27 14:39:29,152 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 14:39:29,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:39:29,153 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:29,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:39:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 14:39:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-27 14:39:29,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:29,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:29,173 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:29,173 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:29,174 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:39:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:39:29,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:29,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:29,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 14:39:29,175 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 14:39:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:29,176 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:39:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:39:29,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:29,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:29,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:29,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-27 14:39:29,178 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 37 [2022-04-27 14:39:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:29,179 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-27 14:39:29,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:39:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:39:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 14:39:29,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:29,179 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:29,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:39:29,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:29,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:29,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:29,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 2 times [2022-04-27 14:39:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:29,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459604751] [2022-04-27 14:39:29,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:29,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:29,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:29,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742449049] [2022-04-27 14:39:29,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:39:29,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:29,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:29,405 INFO L229 MonitoredProcess]: Starting monitored process 7 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:39:29,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 14:39:29,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:39:29,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:29,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:39:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:29,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:29,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1978#true} is VALID [2022-04-27 14:39:29,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#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; {1978#true} is VALID [2022-04-27 14:39:29,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:29,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #61#return; {1978#true} is VALID [2022-04-27 14:39:29,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret6 := main(); {1978#true} is VALID [2022-04-27 14:39:29,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#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; {1978#true} is VALID [2022-04-27 14:39:29,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {1978#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:39:29,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:39:29,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:39:29,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:29,789 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1978#true} {1978#true} #53#return; {1978#true} is VALID [2022-04-27 14:39:29,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {1978#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:29,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:29,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:29,791 INFO L272 TraceCheckUtils]: 14: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:39:29,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:39:29,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:39:29,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:29,792 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1978#true} {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:29,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:29,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:29,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:29,793 INFO L272 TraceCheckUtils]: 22: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:39:29,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:39:29,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:39:29,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:29,794 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1978#true} {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:29,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:39:29,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:39:29,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 5);havoc #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:39:29,795 INFO L272 TraceCheckUtils]: 30: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:39:29,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:39:29,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:39:29,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:29,796 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1978#true} {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #55#return; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:39:29,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:39:29,797 INFO L272 TraceCheckUtils]: 36: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:39:29,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:39:29,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:39:29,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:29,798 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1978#true} {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} #57#return; {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:39:29,798 INFO L272 TraceCheckUtils]: 41: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:29,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2114#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:29,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {2114#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1979#false} is VALID [2022-04-27 14:39:29,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-27 14:39:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:39:29,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459604751] [2022-04-27 14:39:30,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742449049] [2022-04-27 14:39:30,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742449049] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:30,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:30,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:39:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920629796] [2022-04-27 14:39:30,099 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:30,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 14:39:30,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:30,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:30,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:30,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:39:30,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:30,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:39:30,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:39:30,127 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:30,424 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-27 14:39:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:39:30,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 14:39:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 14:39:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 14:39:30,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-27 14:39:30,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:30,462 INFO L225 Difference]: With dead ends: 58 [2022-04-27 14:39:30,462 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:39:30,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:39:30,463 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:30,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:39:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:39:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 14:39:30,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:30,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:39:30,482 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:39:30,482 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:39:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:30,484 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:39:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:39:30,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:30,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:30,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 14:39:30,484 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 14:39:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:30,485 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:39:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:39:30,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:30,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:30,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:30,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:39:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-27 14:39:30,487 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2022-04-27 14:39:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:30,487 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-27 14:39:30,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:39:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 14:39:30,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:30,488 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:30,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 14:39:30,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:30,692 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 3 times [2022-04-27 14:39:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:30,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273362703] [2022-04-27 14:39:30,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:30,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:30,704 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:30,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583025900] [2022-04-27 14:39:30,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:39:30,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:30,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:30,705 INFO L229 MonitoredProcess]: Starting monitored process 8 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:39:30,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process