/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:34:20,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:34:20,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:34:20,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:34:20,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:34:20,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:34:20,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:34:20,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:34:20,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:34:20,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:34:20,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:34:20,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:34:20,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:34:20,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:34:20,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:34:20,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:34:20,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:34:20,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:34:20,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:34:20,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:34:20,381 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:34:20,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:34:20,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:34:20,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:34:20,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:34:20,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:34:20,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:34:20,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:34:20,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:34:20,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:34:20,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:34:20,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:34:20,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:34:20,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:34:20,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:34:20,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:34:20,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:34:20,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:34:20,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:34:20,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:34:20,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:34:20,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:34:20,404 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:34:20,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:34:20,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:34:20,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:34:20,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:34:20,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:34:20,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:34:20,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:34:20,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:34:20,429 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:34:20,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:34:20,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:34:20,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:34:20,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:34:20,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:34:20,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:34:20,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:34:20,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:34:20,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:34:20,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:34:20,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:34:20,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:34:20,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:34:20,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:34:20,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:34:20,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:34:20,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:34:20,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:34:20,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:34:20,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:34:20,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:34:20,434 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:34:20,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:34:20,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:34:20,434 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:34:20,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:34:20,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:34:20,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:34:20,664 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:34:20,665 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:34:20,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c [2022-04-27 14:34:20,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86044f222/0eb46b263818477bb78c6c2ef3d252c0/FLAG27bd7403e [2022-04-27 14:34:21,123 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:34:21,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c [2022-04-27 14:34:21,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86044f222/0eb46b263818477bb78c6c2ef3d252c0/FLAG27bd7403e [2022-04-27 14:34:21,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86044f222/0eb46b263818477bb78c6c2ef3d252c0 [2022-04-27 14:34:21,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:34:21,541 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:34:21,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:34:21,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:34:21,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:34:21,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:34:21" (1/1) ... [2022-04-27 14:34:21,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb5dd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21, skipping insertion in model container [2022-04-27 14:34:21,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:34:21" (1/1) ... [2022-04-27 14:34:21,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:34:21,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:34:21,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c[458,471] [2022-04-27 14:34:21,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:34:21,747 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:34:21,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c[458,471] [2022-04-27 14:34:21,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:34:21,780 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:34:21,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21 WrapperNode [2022-04-27 14:34:21,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:34:21,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:34:21,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:34:21,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:34:21,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21" (1/1) ... [2022-04-27 14:34:21,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21" (1/1) ... [2022-04-27 14:34:21,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21" (1/1) ... [2022-04-27 14:34:21,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21" (1/1) ... [2022-04-27 14:34:21,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21" (1/1) ... [2022-04-27 14:34:21,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21" (1/1) ... [2022-04-27 14:34:21,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21" (1/1) ... [2022-04-27 14:34:21,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:34:21,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:34:21,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:34:21,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:34:21,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21" (1/1) ... [2022-04-27 14:34:21,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:34:21,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:21,848 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:34:21,868 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:34:21,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:34:21,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:34:21,884 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:34:21,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:34:21,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:34:21,886 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:34:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:34:21,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:34:21,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:34:21,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:34:21,940 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:34:21,941 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:34:22,094 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:34:22,099 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:34:22,100 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:34:22,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:34:22 BoogieIcfgContainer [2022-04-27 14:34:22,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:34:22,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:34:22,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:34:22,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:34:22,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:34:21" (1/3) ... [2022-04-27 14:34:22,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7467bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:34:22, skipping insertion in model container [2022-04-27 14:34:22,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:21" (2/3) ... [2022-04-27 14:34:22,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7467bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:34:22, skipping insertion in model container [2022-04-27 14:34:22,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:34:22" (3/3) ... [2022-04-27 14:34:22,107 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound2.c [2022-04-27 14:34:22,118 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:34:22,118 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:34:22,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:34:22,158 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@70bb2ea8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4dd927e2 [2022-04-27 14:34:22,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:34:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 14:34:22,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:22,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:22,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:22,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-27 14:34:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:22,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840926811] [2022-04-27 14:34:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:22,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:34:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:22,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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; {26#true} is VALID [2022-04-27 14:34:22,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:34:22,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:34:22,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:34:22,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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; {26#true} is VALID [2022-04-27 14:34:22,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:34:22,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:34:22,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-27 14:34:22,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {26#true} is VALID [2022-04-27 14:34:22,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 14:34:22,406 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-27 14:34:22,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 14:34:22,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 14:34:22,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 14:34:22,407 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:34:22,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:22,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840926811] [2022-04-27 14:34:22,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840926811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:34:22,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:34:22,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:34:22,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033531929] [2022-04-27 14:34:22,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:22,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:34:22,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:22,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:22,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:22,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:34:22,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:22,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:34:22,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:34:22,468 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:22,610 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-27 14:34:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:34:22,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:34:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:34:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:34:22,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 14:34:22,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:22,718 INFO L225 Difference]: With dead ends: 41 [2022-04-27 14:34:22,718 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 14:34:22,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:34:22,725 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:22,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:34:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 14:34:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 14:34:22,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:22,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:22,762 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:22,762 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:22,766 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:34:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:34:22,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:22,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:22,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 14:34:22,768 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 14:34:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:22,775 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:34:22,775 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:34:22,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:22,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:22,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:22,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-27 14:34:22,780 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-27 14:34:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:22,781 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-27 14:34:22,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 14:34:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:34:22,786 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:22,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:22,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:34:22,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-27 14:34:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:22,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172997579] [2022-04-27 14:34:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:22,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:22,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060318644] [2022-04-27 14:34:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:22,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:22,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:22,813 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:34:22,814 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:34:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:22,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:34:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:22,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:23,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2022-04-27 14:34:23,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#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; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:23,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(<= ~counter~0 0)} assume true; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:23,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#(<= ~counter~0 0)} {155#true} #57#return; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:23,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#(<= ~counter~0 0)} call #t~ret6 := main(); {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:23,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:23,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {179#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:34:23,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(<= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {156#false} is VALID [2022-04-27 14:34:23,030 INFO L272 TraceCheckUtils]: 8: Hoare triple {156#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {156#false} is VALID [2022-04-27 14:34:23,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#false} ~cond := #in~cond; {156#false} is VALID [2022-04-27 14:34:23,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {156#false} assume 0 == ~cond; {156#false} is VALID [2022-04-27 14:34:23,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#false} assume !false; {156#false} is VALID [2022-04-27 14:34:23,033 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:34:23,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:34:23,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:23,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172997579] [2022-04-27 14:34:23,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:23,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060318644] [2022-04-27 14:34:23,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060318644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:34:23,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:34:23,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:34:23,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899839119] [2022-04-27 14:34:23,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:34:23,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:23,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:23,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:23,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:34:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:23,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:34:23,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:34:23,052 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:23,120 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 14:34:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:34:23,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:34:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:34:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:34:23,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-27 14:34:23,159 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:34:23,160 INFO L225 Difference]: With dead ends: 28 [2022-04-27 14:34:23,160 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 14:34:23,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:34:23,162 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 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:34:23,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:34:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 14:34:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 14:34:23,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:23,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:23,170 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:23,171 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:23,172 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:34:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:34:23,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:23,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:23,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 14:34:23,174 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 14:34:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:23,175 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:34:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:34:23,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:23,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:23,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:23,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 14:34:23,178 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-27 14:34:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:23,178 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 14:34:23,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:34:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:34:23,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:23,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:23,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:34:23,400 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:34:23,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-27 14:34:23,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:23,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398607251] [2022-04-27 14:34:23,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:23,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:23,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494242700] [2022-04-27 14:34:23,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:23,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:23,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:23,422 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:34:23,424 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:34:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:23,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:34:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:23,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:23,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2022-04-27 14:34:23,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#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; {305#true} is VALID [2022-04-27 14:34:23,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 14:34:23,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #57#return; {305#true} is VALID [2022-04-27 14:34:23,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret6 := main(); {305#true} is VALID [2022-04-27 14:34:23,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:23,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:23,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:23,578 INFO L272 TraceCheckUtils]: 8: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:23,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:23,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {306#false} is VALID [2022-04-27 14:34:23,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-27 14:34:23,579 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:34:23,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:34:23,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:23,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398607251] [2022-04-27 14:34:23,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:23,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494242700] [2022-04-27 14:34:23,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494242700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:34:23,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:34:23,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:34:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552499074] [2022-04-27 14:34:23,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:23,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:34:23,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:23,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:23,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:23,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:34:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:34:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:34:23,593 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:23,758 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 14:34:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:34:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:34:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:34:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:34:23,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 14:34:23,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:23,796 INFO L225 Difference]: With dead ends: 30 [2022-04-27 14:34:23,796 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:34:23,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:34:23,798 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:23,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:34:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:34:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:34:23,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:23,804 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:34:23,804 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:34:23,805 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:34:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:23,806 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:34:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:34:23,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:23,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:23,807 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:34:23,807 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:34:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:23,809 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:34:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:34:23,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:23,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:23,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:23,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:23,810 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:34:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:34:23,811 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-27 14:34:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:23,811 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:34:23,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:34:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:34:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:34:23,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:23,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:23,834 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:34:24,027 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:34:24,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-27 14:34:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:24,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108138696] [2022-04-27 14:34:24,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:24,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:24,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272449790] [2022-04-27 14:34:24,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:24,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:24,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:24,066 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:34:24,068 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:34:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:24,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:34:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:24,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:24,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:34:24,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#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; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:24,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(<= ~counter~0 0)} assume true; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:24,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#(<= ~counter~0 0)} {481#true} #57#return; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:24,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#(<= ~counter~0 0)} call #t~ret6 := main(); {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:24,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:24,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,318 INFO L272 TraceCheckUtils]: 8: Hoare triple {505#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(<= ~counter~0 1)} ~cond := #in~cond; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= ~counter~0 1)} assume !(0 == ~cond); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= ~counter~0 1)} assume true; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,320 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {505#(<= ~counter~0 1)} {505#(<= ~counter~0 1)} #51#return; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(<= ~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 + ~x~0; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {530#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:34:24,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {482#false} is VALID [2022-04-27 14:34:24,322 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {482#false} is VALID [2022-04-27 14:34:24,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:34:24,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:34:24,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:34:24,322 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:34:24,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:24,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:34:24,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:34:24,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:34:24,462 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {482#false} is VALID [2022-04-27 14:34:24,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {482#false} is VALID [2022-04-27 14:34:24,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {530#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:34:24,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(<= ~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 + ~x~0; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,466 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {481#true} {505#(<= ~counter~0 1)} #51#return; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-27 14:34:24,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-04-27 14:34:24,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-04-27 14:34:24,467 INFO L272 TraceCheckUtils]: 8: Hoare triple {505#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {481#true} is VALID [2022-04-27 14:34:24,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:24,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:24,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#(<= ~counter~0 0)} call #t~ret6 := main(); {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:24,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#(<= ~counter~0 0)} {481#true} #57#return; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:24,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(<= ~counter~0 0)} assume true; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:24,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#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; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:24,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:34:24,471 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:34:24,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:24,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108138696] [2022-04-27 14:34:24,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:24,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272449790] [2022-04-27 14:34:24,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272449790] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:34:24,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:34:24,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 14:34:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029039844] [2022-04-27 14:34:24,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:24,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-27 14:34:24,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:24,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:34:24,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:24,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:34:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:24,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:34:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:34:24,493 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:34:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:24,576 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-27 14:34:24,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:34:24,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-27 14:34:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:34:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 14:34:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:34:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 14:34:24,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-27 14:34:24,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:24,615 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:34:24,615 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 14:34:24,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:34:24,616 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:24,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:34:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 14:34:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 14:34:24,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:24,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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:34:24,624 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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:34:24,624 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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:34:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:24,625 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 14:34:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-27 14:34:24,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:24,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:24,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 28 states. [2022-04-27 14:34:24,627 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 28 states. [2022-04-27 14:34:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:24,628 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 14:34:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-27 14:34:24,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:24,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:24,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:24,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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:34:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-27 14:34:24,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-04-27 14:34:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:24,631 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-27 14:34:24,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:34:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-27 14:34:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:34:24,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:24,632 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:24,663 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:34:24,855 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:34:24,856 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-27 14:34:24,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:24,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483218934] [2022-04-27 14:34:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:24,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:24,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1431305073] [2022-04-27 14:34:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:24,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:24,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:24,869 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:34:24,883 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:34:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:24,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:34:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:24,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:25,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {756#true} call ULTIMATE.init(); {756#true} is VALID [2022-04-27 14:34:25,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#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; {756#true} is VALID [2022-04-27 14:34:25,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2022-04-27 14:34:25,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} #57#return; {756#true} is VALID [2022-04-27 14:34:25,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {756#true} call #t~ret6 := main(); {756#true} is VALID [2022-04-27 14:34:25,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {756#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {776#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:25,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {776#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {776#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:25,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {776#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {776#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:25,078 INFO L272 TraceCheckUtils]: 8: Hoare triple {776#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {756#true} is VALID [2022-04-27 14:34:25,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {756#true} ~cond := #in~cond; {756#true} is VALID [2022-04-27 14:34:25,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {756#true} assume !(0 == ~cond); {756#true} is VALID [2022-04-27 14:34:25,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {756#true} assume true; {756#true} is VALID [2022-04-27 14:34:25,079 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {756#true} {776#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {776#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:25,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:34:25,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:34:25,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 2);havoc #t~post5; {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:34:25,081 INFO L272 TraceCheckUtils]: 16: Hoare triple {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:25,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:25,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {757#false} is VALID [2022-04-27 14:34:25,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {757#false} assume !false; {757#false} is VALID [2022-04-27 14:34:25,083 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:34:25,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:28,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {757#false} assume !false; {757#false} is VALID [2022-04-27 14:34:28,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {757#false} is VALID [2022-04-27 14:34:28,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:28,600 INFO L272 TraceCheckUtils]: 16: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:28,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 2);havoc #t~post5; {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:34:28,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:34:28,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:34:28,906 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {756#true} {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #51#return; {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:34:28,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {756#true} assume true; {756#true} is VALID [2022-04-27 14:34:28,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {756#true} assume !(0 == ~cond); {756#true} is VALID [2022-04-27 14:34:28,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {756#true} ~cond := #in~cond; {756#true} is VALID [2022-04-27 14:34:28,907 INFO L272 TraceCheckUtils]: 8: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {756#true} is VALID [2022-04-27 14:34:28,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 2);havoc #t~post5; {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:34:28,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:34:28,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {756#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:34:28,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {756#true} call #t~ret6 := main(); {756#true} is VALID [2022-04-27 14:34:28,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} #57#return; {756#true} is VALID [2022-04-27 14:34:28,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2022-04-27 14:34:28,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#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; {756#true} is VALID [2022-04-27 14:34:28,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {756#true} call ULTIMATE.init(); {756#true} is VALID [2022-04-27 14:34:28,911 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:34:28,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483218934] [2022-04-27 14:34:28,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:28,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431305073] [2022-04-27 14:34:28,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431305073] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:28,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:28,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:34:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394027237] [2022-04-27 14:34:28,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:34:28,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:28,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:34:29,438 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:34:29,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:34:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:29,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:34:29,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2022-04-27 14:34:29,439 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:34:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:29,562 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 14:34:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:34:29,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:34:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:34:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:34:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:34:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:34:29,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-27 14:34:30,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:30,149 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:34:30,149 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 14:34:30,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-04-27 14:34:30,151 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:30,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:34:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 14:34:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 14:34:30,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:30,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:30,162 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:30,162 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:30,163 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 14:34:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 14:34:30,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:30,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:30,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-27 14:34:30,164 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-27 14:34:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:30,165 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 14:34:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 14:34:30,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:30,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:30,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:30,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:34:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-27 14:34:30,167 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2022-04-27 14:34:30,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:30,167 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-27 14:34:30,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:34:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 14:34:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:34:30,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:30,168 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:30,192 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:34:30,369 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:34:30,369 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:30,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:30,369 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-27 14:34:30,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:30,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955702391] [2022-04-27 14:34:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:30,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:30,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:30,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1932163153] [2022-04-27 14:34:30,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:30,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:30,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:30,382 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:34:30,394 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:34:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:30,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 14:34:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:30,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:30,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {1032#true} call ULTIMATE.init(); {1032#true} is VALID [2022-04-27 14:34:30,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {1032#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; {1032#true} is VALID [2022-04-27 14:34:30,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#true} assume true; {1032#true} is VALID [2022-04-27 14:34:30,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1032#true} #57#return; {1032#true} is VALID [2022-04-27 14:34:30,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#true} call #t~ret6 := main(); {1032#true} is VALID [2022-04-27 14:34:30,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:30,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:30,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:30,868 INFO L272 TraceCheckUtils]: 8: Hoare triple {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1032#true} is VALID [2022-04-27 14:34:30,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#true} ~cond := #in~cond; {1032#true} is VALID [2022-04-27 14:34:30,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {1032#true} assume !(0 == ~cond); {1032#true} is VALID [2022-04-27 14:34:30,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {1032#true} assume true; {1032#true} is VALID [2022-04-27 14:34:30,869 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1032#true} {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:30,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:34:30,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:34:30,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:34:30,872 INFO L272 TraceCheckUtils]: 16: Hoare triple {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1032#true} is VALID [2022-04-27 14:34:30,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#true} ~cond := #in~cond; {1090#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:30,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {1090#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1094#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:30,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {1094#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1094#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:30,874 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1094#(not (= |__VERIFIER_assert_#in~cond| 0))} {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #51#return; {1101#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:34:30,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {1101#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1105#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:30,876 INFO L272 TraceCheckUtils]: 22: Hoare triple {1105#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1109#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:30,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {1109#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1113#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:30,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {1113#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1033#false} is VALID [2022-04-27 14:34:30,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {1033#false} assume !false; {1033#false} is VALID [2022-04-27 14:34:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 14:34:30,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:07,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:07,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955702391] [2022-04-27 14:35:07,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:07,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932163153] [2022-04-27 14:35:07,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932163153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:07,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:07,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:35:07,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769394513] [2022-04-27 14:35:07,259 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:07,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 14:35:07,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:07,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:07,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:07,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:35:07,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:07,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:35:07,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2022-04-27 14:35:07,285 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:07,614 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-27 14:35:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:35:07,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 14:35:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:35:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:35:07,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-27 14:35:07,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:07,646 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:35:07,646 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:35:07,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=67, Invalid=238, Unknown=1, NotChecked=0, Total=306 [2022-04-27 14:35:07,647 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:07,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:35:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:35:07,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:07,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:07,660 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:07,660 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:07,661 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-27 14:35:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-27 14:35:07,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:07,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:07,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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 31 states. [2022-04-27 14:35:07,662 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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 31 states. [2022-04-27 14:35:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:07,663 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-27 14:35:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-27 14:35:07,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:07,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:07,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:07,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-27 14:35:07,665 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-27 14:35:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:07,666 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-27 14:35:07,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-27 14:35:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:35:07,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:07,667 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:07,695 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:35:07,883 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:35:07,883 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:07,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 2 times [2022-04-27 14:35:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:07,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141476084] [2022-04-27 14:35:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:07,899 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:07,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133899047] [2022-04-27 14:35:07,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:35:07,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:07,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:07,905 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:35:07,905 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:35:07,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:35:07,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 14:35:07,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 14:35:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 14:35:08,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 14:35:08,002 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 14:35:08,003 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:35:08,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:08,223 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:35:08,226 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-04-27 14:35:08,228 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:35:08,247 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:35:08,248 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:35:08,249 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:35:08,249 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:35:08,249 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:35:08,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:35:08 BoogieIcfgContainer [2022-04-27 14:35:08,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:35:08,250 INFO L158 Benchmark]: Toolchain (without parser) took 46708.90ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 133.1MB in the beginning and 155.4MB in the end (delta: -22.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 14:35:08,250 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:35:08,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.05ms. Allocated memory is still 182.5MB. Free memory was 132.8MB in the beginning and 158.3MB in the end (delta: -25.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 14:35:08,250 INFO L158 Benchmark]: Boogie Preprocessor took 34.73ms. Allocated memory is still 182.5MB. Free memory was 158.3MB in the beginning and 157.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:35:08,251 INFO L158 Benchmark]: RCFGBuilder took 283.51ms. Allocated memory is still 182.5MB. Free memory was 156.7MB in the beginning and 145.9MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:35:08,251 INFO L158 Benchmark]: TraceAbstraction took 46146.87ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 145.5MB in the beginning and 155.4MB in the end (delta: -9.9MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. [2022-04-27 14:35:08,252 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.05ms. Allocated memory is still 182.5MB. Free memory was 132.8MB in the beginning and 158.3MB in the end (delta: -25.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.73ms. Allocated memory is still 182.5MB. Free memory was 158.3MB in the beginning and 157.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 283.51ms. Allocated memory is still 182.5MB. Free memory was 156.7MB in the beginning and 145.9MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 46146.87ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 145.5MB in the beginning and 155.4MB in the end (delta: -9.9MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; VAL [\old(counter)=10, counter=0] [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L23] y = 0 [L24] x = 0 [L25] c = 0 VAL [\old(counter)=0, c=0, counter=0, k=3, x=0, y=0] [L27] EXPR counter++ VAL [\old(counter)=0, c=0, counter=1, counter++=0, k=3, x=0, y=0] [L27] COND TRUE counter++<2 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=0, counter=1, k=3, x=0, y=0] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=1, counter=1, k=3, x=1, y=1] [L27] EXPR counter++ VAL [\old(counter)=0, c=1, counter=2, counter++=1, k=3, x=1, y=1] [L27] COND TRUE counter++<2 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=1, counter=2, k=3, x=1, y=1] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=2, counter=2, k=3, x=9, y=2] [L27] EXPR counter++ VAL [\old(counter)=0, c=2, counter=3, counter++=2, k=3, x=9, y=2] [L27] COND FALSE !(counter++<2) [L37] CALL __VERIFIER_assert(k*y - (y*y) == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L10] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L12] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.1s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 375 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 117 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 21.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 41.6s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 541 SizeOfPredicates, 9 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 18/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 14:35:08,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...