/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_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:34:53,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:34:53,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:34:53,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:34:53,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:34:53,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:34:53,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:34:53,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:34:53,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:34:53,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:34:53,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:34:53,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:34:53,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:34:53,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:34:53,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:34:53,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:34:53,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:34:53,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:34:53,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:34:53,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:34:53,969 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:34:53,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:34:53,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:34:53,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:34:53,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:34:53,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:34:53,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:34:53,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:34:53,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:34:53,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:34:53,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:34:53,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:34:53,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:34:53,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:34:53,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:34:53,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:34:53,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:34:53,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:34:53,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:34:53,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:34:53,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:34:53,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:34:53,983 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:54,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:34:54,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:34:54,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:34:54,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:34:54,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:34:54,006 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:34:54,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:34:54,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:34:54,007 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:34:54,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:34:54,008 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:34:54,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:34:54,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:34:54,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:34:54,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:34:54,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:34:54,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:34:54,009 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:34:54,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:34:54,009 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:34:54,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:34:54,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:34:54,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:34:54,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:34:54,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:34:54,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:34:54,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:34:54,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:34:54,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:34:54,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:34:54,010 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:34:54,010 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:34:54,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:34:54,011 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:54,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:34:54,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:34:54,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:34:54,185 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:34:54,185 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:34:54,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound5.c [2022-04-27 14:34:54,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cebac45f/e2e09859256d4baba3ccd70befc9fb15/FLAGa86cced09 [2022-04-27 14:34:54,609 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:34:54,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound5.c [2022-04-27 14:34:54,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cebac45f/e2e09859256d4baba3ccd70befc9fb15/FLAGa86cced09 [2022-04-27 14:34:54,629 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cebac45f/e2e09859256d4baba3ccd70befc9fb15 [2022-04-27 14:34:54,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:34:54,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:34:54,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:34:54,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:34:54,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:34:54,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:34:54" (1/1) ... [2022-04-27 14:34:54,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df4ac69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:54, skipping insertion in model container [2022-04-27 14:34:54,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:34:54" (1/1) ... [2022-04-27 14:34:54,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:34:54,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:34:54,814 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_unwindbound5.c[458,471] [2022-04-27 14:34:54,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:34:54,845 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:34:54,856 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_unwindbound5.c[458,471] [2022-04-27 14:34:54,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:34:54,880 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:34:54,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:54 WrapperNode [2022-04-27 14:34:54,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:34:54,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:34:54,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:34:54,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:34:54,888 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:54" (1/1) ... [2022-04-27 14:34:54,888 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:54" (1/1) ... [2022-04-27 14:34:54,892 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:54" (1/1) ... [2022-04-27 14:34:54,892 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:54" (1/1) ... [2022-04-27 14:34:54,895 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:54" (1/1) ... [2022-04-27 14:34:54,897 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:54" (1/1) ... [2022-04-27 14:34:54,897 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:54" (1/1) ... [2022-04-27 14:34:54,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:34:54,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:34:54,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:34:54,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:34:54,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:54" (1/1) ... [2022-04-27 14:34:54,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:34:54,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:54,922 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:54,947 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:54,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:34:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:34:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:34:54,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:34:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:34:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:34:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:34:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:34:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:34:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:34:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:34:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:34:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:34:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:34:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:34:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:34:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:34:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:34:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:34:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:34:55,011 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:34:55,012 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:34:55,161 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:34:55,166 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:34:55,166 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:34:55,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:34:55 BoogieIcfgContainer [2022-04-27 14:34:55,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:34:55,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:34:55,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:34:55,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:34:55,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:34:54" (1/3) ... [2022-04-27 14:34:55,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8079ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:34:55, skipping insertion in model container [2022-04-27 14:34:55,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:34:54" (2/3) ... [2022-04-27 14:34:55,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8079ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:34:55, skipping insertion in model container [2022-04-27 14:34:55,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:34:55" (3/3) ... [2022-04-27 14:34:55,192 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound5.c [2022-04-27 14:34:55,200 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:34:55,208 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:34:55,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:34:55,253 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@72781163, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@782086 [2022-04-27 14:34:55,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:34:55,260 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:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 14:34:55,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:55,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:55,267 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:55,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-27 14:34:55,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:55,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640797491] [2022-04-27 14:34:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:55,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:34:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:55,404 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:55,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:34:55,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:34:55,406 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:55,406 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:55,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:34:55,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:34:55,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-27 14:34:55,407 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:55,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 14:34:55,408 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:55,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 14:34:55,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 14:34:55,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 14:34:55,408 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:55,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:55,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640797491] [2022-04-27 14:34:55,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640797491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:34:55,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:34:55,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:34:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648140782] [2022-04-27 14:34:55,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:55,413 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:55,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:55,416 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:55,427 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:55,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:34:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:55,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:34:55,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:34:55,446 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:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:55,546 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-27 14:34:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:34:55,546 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:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:55,547 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:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:34:55,552 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:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:34:55,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 14:34:55,619 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:55,626 INFO L225 Difference]: With dead ends: 41 [2022-04-27 14:34:55,626 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 14:34:55,628 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:55,630 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:55,630 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:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 14:34:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 14:34:55,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:55,648 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:55,649 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:55,649 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:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:55,651 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:34:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:34:55,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:55,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:55,652 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:55,652 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:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:55,654 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:34:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:34:55,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:55,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:55,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:55,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:55,655 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:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-27 14:34:55,657 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-27 14:34:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:55,657 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-27 14:34:55,657 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:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 14:34:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:34:55,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:55,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:55,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:34:55,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-27 14:34:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:55,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858871954] [2022-04-27 14:34:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:55,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:55,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711585641] [2022-04-27 14:34:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:55,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:55,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:55,672 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:55,676 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:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:55,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:34:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:55,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:55,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2022-04-27 14:34:55,829 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:55,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(<= ~counter~0 0)} assume true; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:55,830 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:55,831 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:55,831 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:55,831 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:55,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {156#false} is VALID [2022-04-27 14:34:55,832 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:55,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#false} ~cond := #in~cond; {156#false} is VALID [2022-04-27 14:34:55,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {156#false} assume 0 == ~cond; {156#false} is VALID [2022-04-27 14:34:55,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#false} assume !false; {156#false} is VALID [2022-04-27 14:34:55,834 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:55,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:34:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:55,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858871954] [2022-04-27 14:34:55,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:55,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711585641] [2022-04-27 14:34:55,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711585641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:34:55,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:34:55,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:34:55,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065953093] [2022-04-27 14:34:55,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:55,836 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:55,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:55,836 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:55,849 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:55,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:34:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:55,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:34:55,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:34:55,851 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:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:55,907 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 14:34:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:34:55,908 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:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:55,909 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:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:34:55,912 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:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:34:55,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-27 14:34:55,945 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:55,947 INFO L225 Difference]: With dead ends: 28 [2022-04-27 14:34:55,948 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 14:34:55,948 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:55,950 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:55,951 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:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 14:34:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 14:34:55,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:55,964 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:55,965 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:55,965 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:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:55,967 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:34:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:34:55,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:55,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:55,968 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:55,969 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:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:55,972 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:34:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:34:55,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:55,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:55,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:55,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:55,974 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:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 14:34:55,976 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-27 14:34:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:55,977 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 14:34:55,977 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:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:34:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:34:55,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:55,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:56,005 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:56,183 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:56,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-27 14:34:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:56,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32521260] [2022-04-27 14:34:56,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:56,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:56,195 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:56,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558775710] [2022-04-27 14:34:56,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:56,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:56,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:56,196 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:56,197 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:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:56,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:34:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:56,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:56,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2022-04-27 14:34:56,318 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:56,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 14:34:56,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #57#return; {305#true} is VALID [2022-04-27 14:34:56,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret6 := main(); {305#true} is VALID [2022-04-27 14:34:56,319 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:56,319 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:56,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:56,322 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:56,324 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:56,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {306#false} is VALID [2022-04-27 14:34:56,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-27 14:34:56,329 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:56,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:34:56,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:56,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32521260] [2022-04-27 14:34:56,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:56,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558775710] [2022-04-27 14:34:56,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558775710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:34:56,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:34:56,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:34:56,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579024544] [2022-04-27 14:34:56,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:56,330 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:56,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:56,330 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:56,340 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:56,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:34:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:56,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:34:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:34:56,341 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:56,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:56,560 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 14:34:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:34:56,560 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:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:56,561 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:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:34:56,562 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:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:34:56,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 14:34:56,588 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:56,588 INFO L225 Difference]: With dead ends: 30 [2022-04-27 14:34:56,589 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:34:56,589 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:56,590 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:56,590 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:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:34:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:34:56,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:56,595 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:56,596 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:56,596 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:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:56,597 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:34:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:34:56,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:56,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:56,598 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:56,598 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:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:56,599 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:34:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:34:56,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:56,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:56,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:56,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:56,600 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:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:34:56,601 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-27 14:34:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:56,601 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:34:56,601 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:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:34:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:34:56,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:56,602 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:56,621 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:56,821 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:56,821 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:56,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-27 14:34:56,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:56,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194287864] [2022-04-27 14:34:56,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:56,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:56,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:56,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425021194] [2022-04-27 14:34:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:56,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:56,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:56,833 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:56,834 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:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:56,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:34:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:56,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:56,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:34:56,993 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:56,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(<= ~counter~0 0)} assume true; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:56,994 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:56,994 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:56,995 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:56,995 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:56,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:56,996 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:56,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(<= ~counter~0 1)} ~cond := #in~cond; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:56,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= ~counter~0 1)} assume !(0 == ~cond); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:56,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= ~counter~0 1)} assume true; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:56,998 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:56,998 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:56,999 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:56,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {482#false} is VALID [2022-04-27 14:34:56,999 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:56,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:34:56,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:34:57,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:34:57,000 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:57,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:57,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:34:57,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:34:57,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:34:57,123 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:57,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {558#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {482#false} is VALID [2022-04-27 14:34:57,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {558#(< |main_#t~post5| 5)} is VALID [2022-04-27 14:34:57,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(< ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {562#(< ~counter~0 5)} is VALID [2022-04-27 14:34:57,125 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {481#true} {562#(< ~counter~0 5)} #51#return; {562#(< ~counter~0 5)} is VALID [2022-04-27 14:34:57,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-27 14:34:57,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-04-27 14:34:57,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-04-27 14:34:57,126 INFO L272 TraceCheckUtils]: 8: Hoare triple {562#(< ~counter~0 5)} 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:57,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {562#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {562#(< ~counter~0 5)} is VALID [2022-04-27 14:34:57,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {587#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {562#(< ~counter~0 5)} is VALID [2022-04-27 14:34:57,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#(< ~counter~0 4)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {587#(< ~counter~0 4)} is VALID [2022-04-27 14:34:57,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#(< ~counter~0 4)} call #t~ret6 := main(); {587#(< ~counter~0 4)} is VALID [2022-04-27 14:34:57,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#(< ~counter~0 4)} {481#true} #57#return; {587#(< ~counter~0 4)} is VALID [2022-04-27 14:34:57,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#(< ~counter~0 4)} assume true; {587#(< ~counter~0 4)} is VALID [2022-04-27 14:34:57,131 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; {587#(< ~counter~0 4)} is VALID [2022-04-27 14:34:57,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:34:57,132 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:57,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:57,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194287864] [2022-04-27 14:34:57,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:57,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425021194] [2022-04-27 14:34:57,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425021194] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:34:57,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:34:57,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:34:57,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072475051] [2022-04-27 14:34:57,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:57,133 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:34:57,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:57,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:34:57,156 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:57,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:34:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:57,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:34:57,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:34:57,157 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:34:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:57,316 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 14:34:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:34:57,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:34:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:34:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-27 14:34:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:34:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-27 14:34:57,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2022-04-27 14:34:57,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:57,389 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:34:57,389 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:34:57,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:34:57,390 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:57,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:34:57,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:34:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-27 14:34:57,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:57,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:57,403 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:57,403 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:57,405 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:34:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:34:57,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:57,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:57,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 14:34:57,406 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 14:34:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:57,408 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:34:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:34:57,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:57,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:57,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:57,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-27 14:34:57,411 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 20 [2022-04-27 14:34:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:57,411 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-27 14:34:57,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:34:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-27 14:34:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:34:57,412 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:57,412 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:57,429 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:57,627 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:57,628 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:57,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-27 14:34:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:57,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426492499] [2022-04-27 14:34:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:57,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:57,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399416703] [2022-04-27 14:34:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:57,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:57,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:57,640 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:57,655 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:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:57,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:34:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:57,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:57,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2022-04-27 14:34:57,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#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; {875#true} is VALID [2022-04-27 14:34:57,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:34:57,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #57#return; {875#true} is VALID [2022-04-27 14:34:57,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret6 := main(); {875#true} is VALID [2022-04-27 14:34:57,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#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; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:57,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:57,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:57,792 INFO L272 TraceCheckUtils]: 8: Hoare triple {895#(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)); {875#true} is VALID [2022-04-27 14:34:57,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} ~cond := #in~cond; {875#true} is VALID [2022-04-27 14:34:57,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} assume !(0 == ~cond); {875#true} is VALID [2022-04-27 14:34:57,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:34:57,794 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {895#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:57,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {895#(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; {920#(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:57,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(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; {920#(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:57,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {920#(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:57,796 INFO L272 TraceCheckUtils]: 16: Hoare triple {920#(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)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:57,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:57,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {876#false} is VALID [2022-04-27 14:34:57,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} assume !false; {876#false} is VALID [2022-04-27 14:34:57,797 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:57,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:57,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} assume !false; {876#false} is VALID [2022-04-27 14:34:57,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {876#false} is VALID [2022-04-27 14:34:57,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:57,903 INFO L272 TraceCheckUtils]: 16: Hoare triple {950#(= (+ (* 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)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:57,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(= (+ (* 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 < 5);havoc #t~post5; {950#(= (+ (* 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:57,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= (+ (* 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; {950#(= (+ (* 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:57,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(= (+ (* 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; {950#(= (+ (* 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:57,918 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {950#(= (+ (* 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; {950#(= (+ (* 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:57,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:34:57,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} assume !(0 == ~cond); {875#true} is VALID [2022-04-27 14:34:57,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} ~cond := #in~cond; {875#true} is VALID [2022-04-27 14:34:57,918 INFO L272 TraceCheckUtils]: 8: Hoare triple {950#(= (+ (* 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)); {875#true} is VALID [2022-04-27 14:34:57,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {950#(= (+ (* 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 < 5);havoc #t~post5; {950#(= (+ (* 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:57,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#(= (+ (* 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; {950#(= (+ (* 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:57,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#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; {950#(= (+ (* 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:57,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret6 := main(); {875#true} is VALID [2022-04-27 14:34:57,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #57#return; {875#true} is VALID [2022-04-27 14:34:57,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:34:57,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#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; {875#true} is VALID [2022-04-27 14:34:57,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2022-04-27 14:34:57,920 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:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:57,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426492499] [2022-04-27 14:34:57,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:57,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399416703] [2022-04-27 14:34:57,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399416703] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:57,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:57,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:34:57,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56343107] [2022-04-27 14:34:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:34:57,921 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:57,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:57,921 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:57,939 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:57,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:34:57,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:57,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:34:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:34:57,940 INFO L87 Difference]: Start difference. First operand 48 states and 57 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:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:58,028 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-27 14:34:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:34:58,029 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:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:58,029 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:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:34:58,031 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:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:34:58,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-27 14:34:58,058 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:58,059 INFO L225 Difference]: With dead ends: 62 [2022-04-27 14:34:58,059 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 14:34:58,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:34:58,060 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:58,060 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:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 14:34:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-27 14:34:58,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:58,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:58,076 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:58,076 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:58,077 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 14:34:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 14:34:58,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:58,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:58,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 14:34:58,078 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 14:34:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:58,079 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 14:34:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 14:34:58,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:58,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:58,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:58,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-27 14:34:58,081 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2022-04-27 14:34:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:58,081 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-27 14:34:58,081 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:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-27 14:34:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:34:58,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:58,082 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:58,098 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:58,282 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:58,282 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:58,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:58,283 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-27 14:34:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:58,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390631845] [2022-04-27 14:34:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:58,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:58,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408395494] [2022-04-27 14:34:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:58,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:58,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:58,293 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:58,294 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:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:58,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 14:34:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:58,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:58,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1257#true} is VALID [2022-04-27 14:34:58,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#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; {1257#true} is VALID [2022-04-27 14:34:58,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-27 14:34:58,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #57#return; {1257#true} is VALID [2022-04-27 14:34:58,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} call #t~ret6 := main(); {1257#true} is VALID [2022-04-27 14:34:58,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#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; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:58,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:58,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:58,668 INFO L272 TraceCheckUtils]: 8: Hoare triple {1277#(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)); {1257#true} is VALID [2022-04-27 14:34:58,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {1257#true} ~cond := #in~cond; {1257#true} is VALID [2022-04-27 14:34:58,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {1257#true} assume !(0 == ~cond); {1257#true} is VALID [2022-04-27 14:34:58,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-27 14:34:58,669 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1257#true} {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:58,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(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; {1302#(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:58,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {1302#(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; {1302#(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:58,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(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 < 5);havoc #t~post5; {1302#(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:58,670 INFO L272 TraceCheckUtils]: 16: Hoare triple {1302#(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)); {1257#true} is VALID [2022-04-27 14:34:58,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#true} ~cond := #in~cond; {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:58,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:58,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:58,672 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} {1302#(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; {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:34:58,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:58,673 INFO L272 TraceCheckUtils]: 22: Hoare triple {1330#(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)); {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:58,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1338#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:58,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {1338#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1258#false} is VALID [2022-04-27 14:34:58,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2022-04-27 14:34:58,674 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:58,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:29,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:29,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390631845] [2022-04-27 14:35:29,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:29,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408395494] [2022-04-27 14:35:29,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408395494] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:29,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:29,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:35:29,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580281170] [2022-04-27 14:35:29,168 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:29,168 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:29,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:29,168 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:29,187 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:29,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:35:29,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:29,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:35:29,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:35:29,187 INFO L87 Difference]: Start difference. First operand 45 states and 48 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:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:29,449 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-27 14:35:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:35:29,450 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:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:29,450 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:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:35:29,451 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:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:35:29,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-27 14:35:29,477 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:29,478 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:35:29,478 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:35:29,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:35:29,479 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:29,479 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:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:35:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:35:29,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:29,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:29,500 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:29,500 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:29,501 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 14:35:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:35:29,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:29,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:29,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:29,502 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:29,503 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 14:35:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:35:29,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:29,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:29,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:29,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-27 14:35:29,504 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2022-04-27 14:35:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:29,504 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-27 14:35:29,505 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:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:35:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:35:29,505 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:29,505 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:29,525 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:29,717 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:29,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:29,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 2 times [2022-04-27 14:35:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:29,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199682153] [2022-04-27 14:35:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:29,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:29,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:29,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446066932] [2022-04-27 14:35:29,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:35:29,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:29,734 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:29,734 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:29,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:35:29,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:29,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:35:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:29,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:30,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-27 14:35:30,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#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; {1622#true} is VALID [2022-04-27 14:35:30,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:30,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1622#true} #57#return; {1622#true} is VALID [2022-04-27 14:35:30,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {1622#true} call #t~ret6 := main(); {1622#true} is VALID [2022-04-27 14:35:30,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {1622#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; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:30,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:30,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:30,075 INFO L272 TraceCheckUtils]: 8: Hoare triple {1642#(and (= 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)); {1622#true} is VALID [2022-04-27 14:35:30,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:35:30,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:35:30,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:30,076 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1622#true} {1642#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:30,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:30,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:30,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:30,077 INFO L272 TraceCheckUtils]: 16: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~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)); {1622#true} is VALID [2022-04-27 14:35:30,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:35:30,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:35:30,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:30,078 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1622#true} {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:30,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:30,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:30,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 5);havoc #t~post5; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:30,079 INFO L272 TraceCheckUtils]: 24: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} 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)); {1622#true} is VALID [2022-04-27 14:35:30,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:35:30,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:35:30,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:30,079 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1622#true} {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #51#return; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:30,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:35:30,080 INFO L272 TraceCheckUtils]: 30: Hoare triple {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:30,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1725#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:30,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {1725#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1623#false} is VALID [2022-04-27 14:35:30,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-27 14:35:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:35:30,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199682153] [2022-04-27 14:35:30,312 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446066932] [2022-04-27 14:35:30,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446066932] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:30,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:30,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:35:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244060884] [2022-04-27 14:35:30,312 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:30,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 14:35:30,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:30,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:30,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:30,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:35:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:30,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:35:30,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:35:30,333 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:30,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:30,525 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-27 14:35:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:35:30,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 14:35:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 14:35:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 14:35:30,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 14:35:30,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:30,553 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:35:30,553 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:35:30,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:35:30,554 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:30,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:35:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:35:30,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:30,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:30,571 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:30,571 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:30,572 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 14:35:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:35:30,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:30,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:30,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:30,573 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:30,574 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 14:35:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:35:30,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:30,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:30,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:30,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-27 14:35:30,575 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2022-04-27 14:35:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:30,575 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-27 14:35:30,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:35:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 14:35:30,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:30,576 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:30,594 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:30,791 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:30,791 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 3 times [2022-04-27 14:35:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:30,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636898528] [2022-04-27 14:35:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:30,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:30,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149367706] [2022-04-27 14:35:30,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:35:30,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:30,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:30,810 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:35:30,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 14:35:30,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:35:30,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:30,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:35:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:30,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:31,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {2005#true} call ULTIMATE.init(); {2005#true} is VALID [2022-04-27 14:35:31,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#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; {2005#true} is VALID [2022-04-27 14:35:31,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:31,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2005#true} #57#return; {2005#true} is VALID [2022-04-27 14:35:31,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {2005#true} call #t~ret6 := main(); {2005#true} is VALID [2022-04-27 14:35:31,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#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; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:31,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:31,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:31,175 INFO L272 TraceCheckUtils]: 8: Hoare triple {2025#(and (= 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)); {2005#true} is VALID [2022-04-27 14:35:31,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:31,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:31,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:31,177 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2005#true} {2025#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:31,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:31,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:31,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:31,178 INFO L272 TraceCheckUtils]: 16: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~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)); {2005#true} is VALID [2022-04-27 14:35:31,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:31,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:31,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:31,179 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2005#true} {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:31,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~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; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:31,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:31,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:31,192 INFO L272 TraceCheckUtils]: 24: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:35:31,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:31,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:31,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:31,193 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2005#true} {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #51#return; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:31,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:31,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:31,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 5);havoc #t~post5; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:31,194 INFO L272 TraceCheckUtils]: 32: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~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)); {2005#true} is VALID [2022-04-27 14:35:31,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:31,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:31,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:31,195 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2005#true} {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #51#return; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:31,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:31,196 INFO L272 TraceCheckUtils]: 38: Hoare triple {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:31,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:31,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {2133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2006#false} is VALID [2022-04-27 14:35:31,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {2006#false} assume !false; {2006#false} is VALID [2022-04-27 14:35:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:35:31,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:31,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:31,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636898528] [2022-04-27 14:35:31,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:31,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149367706] [2022-04-27 14:35:31,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149367706] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:31,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:31,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:35:31,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938471356] [2022-04-27 14:35:31,462 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:31,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 14:35:31,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:31,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:31,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:31,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:35:31,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:31,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:35:31,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:35:31,486 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:31,770 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:35:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:35:31,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 14:35:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:35:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:35:31,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-27 14:35:31,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:31,830 INFO L225 Difference]: With dead ends: 52 [2022-04-27 14:35:31,830 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 14:35:31,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:35:31,831 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:31,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 14:35:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 14:35:31,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:31,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:31,857 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:31,857 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:31,859 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 14:35:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:35:31,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:31,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:31,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 14:35:31,859 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 14:35:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:31,863 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 14:35:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:35:31,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:31,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:31,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:31,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-27 14:35:31,866 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-27 14:35:31,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:31,866 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-27 14:35:31,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:35:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 14:35:31,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:31,867 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:31,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:32,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:32,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 2 times [2022-04-27 14:35:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:32,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735995303] [2022-04-27 14:35:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:32,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:32,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:32,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [192882048] [2022-04-27 14:35:32,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:35:32,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:32,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:32,079 INFO L229 MonitoredProcess]: Starting monitored process 9 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:32,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 14:35:32,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:35:32,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:32,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:35:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:32,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:32,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2022-04-27 14:35:32,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#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; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:32,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {2431#(<= ~counter~0 0)} assume true; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:32,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2431#(<= ~counter~0 0)} {2423#true} #57#return; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:32,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {2431#(<= ~counter~0 0)} call #t~ret6 := main(); {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:32,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {2431#(<= ~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; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:32,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {2431#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,370 INFO L272 TraceCheckUtils]: 8: Hoare triple {2447#(<= ~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)); {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {2447#(<= ~counter~0 1)} ~cond := #in~cond; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {2447#(<= ~counter~0 1)} assume !(0 == ~cond); {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#(<= ~counter~0 1)} assume true; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,371 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2447#(<= ~counter~0 1)} {2447#(<= ~counter~0 1)} #51#return; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {2447#(<= ~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; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {2447#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,373 INFO L272 TraceCheckUtils]: 16: Hoare triple {2472#(<= ~counter~0 2)} 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)); {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {2472#(<= ~counter~0 2)} ~cond := #in~cond; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#(<= ~counter~0 2)} assume !(0 == ~cond); {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {2472#(<= ~counter~0 2)} assume true; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,374 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2472#(<= ~counter~0 2)} {2472#(<= ~counter~0 2)} #51#return; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#(<= ~counter~0 2)} 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; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {2472#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {2497#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,380 INFO L272 TraceCheckUtils]: 24: Hoare triple {2497#(<= ~counter~0 3)} 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)); {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {2497#(<= ~counter~0 3)} ~cond := #in~cond; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {2497#(<= ~counter~0 3)} assume !(0 == ~cond); {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {2497#(<= ~counter~0 3)} assume true; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,385 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2497#(<= ~counter~0 3)} {2497#(<= ~counter~0 3)} #51#return; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {2497#(<= ~counter~0 3)} 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; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {2497#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {2522#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,389 INFO L272 TraceCheckUtils]: 32: Hoare triple {2522#(<= ~counter~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)); {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {2522#(<= ~counter~0 4)} ~cond := #in~cond; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {2522#(<= ~counter~0 4)} assume !(0 == ~cond); {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {2522#(<= ~counter~0 4)} assume true; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,392 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2522#(<= ~counter~0 4)} {2522#(<= ~counter~0 4)} #51#return; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {2522#(<= ~counter~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; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {2522#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2547#(<= |main_#t~post5| 4)} is VALID [2022-04-27 14:35:32,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {2547#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {2424#false} is VALID [2022-04-27 14:35:32,393 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2424#false} is VALID [2022-04-27 14:35:32,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} ~cond := #in~cond; {2424#false} is VALID [2022-04-27 14:35:32,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} assume 0 == ~cond; {2424#false} is VALID [2022-04-27 14:35:32,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-04-27 14:35:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:35:32,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:32,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-04-27 14:35:32,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} assume 0 == ~cond; {2424#false} is VALID [2022-04-27 14:35:32,581 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} ~cond := #in~cond; {2424#false} is VALID [2022-04-27 14:35:32,581 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2424#false} is VALID [2022-04-27 14:35:32,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {2547#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {2424#false} is VALID [2022-04-27 14:35:32,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {2522#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2547#(<= |main_#t~post5| 4)} is VALID [2022-04-27 14:35:32,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {2522#(<= ~counter~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; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,583 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2423#true} {2522#(<= ~counter~0 4)} #51#return; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:32,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:32,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:32,583 INFO L272 TraceCheckUtils]: 32: Hoare triple {2522#(<= ~counter~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)); {2423#true} is VALID [2022-04-27 14:35:32,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {2522#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {2497#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:32,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {2497#(<= ~counter~0 3)} 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; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,585 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2423#true} {2497#(<= ~counter~0 3)} #51#return; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:32,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:32,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:32,585 INFO L272 TraceCheckUtils]: 24: Hoare triple {2497#(<= ~counter~0 3)} 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)); {2423#true} is VALID [2022-04-27 14:35:32,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {2497#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {2472#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:32,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#(<= ~counter~0 2)} 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; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,588 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2423#true} {2472#(<= ~counter~0 2)} #51#return; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:32,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:32,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:32,588 INFO L272 TraceCheckUtils]: 16: Hoare triple {2472#(<= ~counter~0 2)} 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)); {2423#true} is VALID [2022-04-27 14:35:32,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {2447#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:32,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {2447#(<= ~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; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,589 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2423#true} {2447#(<= ~counter~0 1)} #51#return; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:32,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:32,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:32,589 INFO L272 TraceCheckUtils]: 8: Hoare triple {2447#(<= ~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)); {2423#true} is VALID [2022-04-27 14:35:32,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {2431#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:32,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {2431#(<= ~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; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:32,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {2431#(<= ~counter~0 0)} call #t~ret6 := main(); {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:32,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2431#(<= ~counter~0 0)} {2423#true} #57#return; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:32,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2431#(<= ~counter~0 0)} assume true; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:32,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#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; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:32,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2022-04-27 14:35:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:35:32,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:32,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735995303] [2022-04-27 14:35:32,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:32,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192882048] [2022-04-27 14:35:32,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192882048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:35:32,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:35:32,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-27 14:35:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329779175] [2022-04-27 14:35:32,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:32,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 7 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 44 [2022-04-27 14:35:32,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:32,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 7 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:35:32,646 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:35:32,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:35:32,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:35:32,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:35:32,648 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 7 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:35:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:32,762 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-04-27 14:35:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:35:32,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 7 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 44 [2022-04-27 14:35:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 7 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:35:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-27 14:35:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 7 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:35:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-27 14:35:32,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-27 14:35:32,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:32,811 INFO L225 Difference]: With dead ends: 58 [2022-04-27 14:35:32,811 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 14:35:32,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:35:32,812 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:32,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:35:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 14:35:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-27 14:35:32,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:32,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:32,836 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:32,836 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:32,838 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-27 14:35:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-27 14:35:32,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:32,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:32,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-27 14:35:32,838 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-27 14:35:32,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:32,844 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-27 14:35:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-27 14:35:32,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:32,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:32,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:32,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-04-27 14:35:32,846 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 44 [2022-04-27 14:35:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:32,846 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-04-27 14:35:32,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 7 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:35:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-27 14:35:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 14:35:32,848 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:32,848 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:32,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:33,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 14:35:33,065 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:33,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 4 times [2022-04-27 14:35:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:33,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540696445] [2022-04-27 14:35:33,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:33,077 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:33,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708673042] [2022-04-27 14:35:33,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:35:33,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:33,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:33,078 INFO L229 MonitoredProcess]: Starting monitored process 10 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:33,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 14:35:33,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:35:33,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:33,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:35:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:33,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:33,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-27 14:35:33,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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; {2965#true} is VALID [2022-04-27 14:35:33,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-27 14:35:33,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #57#return; {2965#true} is VALID [2022-04-27 14:35:33,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret6 := main(); {2965#true} is VALID [2022-04-27 14:35:33,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#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; {2985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:33,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {2985#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:33,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {2985#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:33,590 INFO L272 TraceCheckUtils]: 8: Hoare triple {2985#(and (= 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)); {2965#true} is VALID [2022-04-27 14:35:33,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-27 14:35:33,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-27 14:35:33,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-27 14:35:33,591 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2965#true} {2985#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {2985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:33,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {2985#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3010#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:35:33,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {3010#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3010#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:35:33,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {3010#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 5);havoc #t~post5; {3010#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:35:33,592 INFO L272 TraceCheckUtils]: 16: Hoare triple {3010#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2965#true} is VALID [2022-04-27 14:35:33,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-27 14:35:33,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-27 14:35:33,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-27 14:35:33,593 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2965#true} {3010#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #51#return; {3010#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:35:33,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {3010#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:33,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {3035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:33,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {3035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 5);havoc #t~post5; {3035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:33,595 INFO L272 TraceCheckUtils]: 24: Hoare triple {3035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~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)); {2965#true} is VALID [2022-04-27 14:35:33,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-27 14:35:33,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-27 14:35:33,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-27 14:35:33,595 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2965#true} {3035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #51#return; {3035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:33,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {3035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~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; {3060#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:33,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {3060#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3060#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:33,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {3060#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(#t~post5 < 5);havoc #t~post5; {3060#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:33,597 INFO L272 TraceCheckUtils]: 32: Hoare triple {3060#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~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)); {2965#true} is VALID [2022-04-27 14:35:33,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-27 14:35:33,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-27 14:35:33,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-27 14:35:33,598 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2965#true} {3060#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #51#return; {3060#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:33,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {3060#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~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; {3085#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:33,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {3085#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3085#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:33,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {3085#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 5);havoc #t~post5; {3085#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:33,599 INFO L272 TraceCheckUtils]: 40: Hoare triple {3085#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~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)); {2965#true} is VALID [2022-04-27 14:35:33,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-27 14:35:33,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-27 14:35:33,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-27 14:35:33,600 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2965#true} {3085#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #51#return; {3085#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:33,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {3085#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {3110#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:35:33,601 INFO L272 TraceCheckUtils]: 46: Hoare triple {3110#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3114#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:33,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {3114#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3118#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:33,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {3118#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2966#false} is VALID [2022-04-27 14:35:33,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-27 14:35:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:35:33,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:34,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:34,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540696445] [2022-04-27 14:35:34,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:34,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708673042] [2022-04-27 14:35:34,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708673042] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:34,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:34,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:35:34,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430805065] [2022-04-27 14:35:34,108 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:34,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 14:35:34,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:34,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:34,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:34,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:35:34,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:35:34,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:35:34,131 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:34,495 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-27 14:35:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:35:34,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 14:35:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-27 14:35:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-27 14:35:34,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-27 14:35:34,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:34,537 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:35:34,537 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 14:35:34,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:35:34,538 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:34,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:34,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 14:35:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 14:35:34,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:34,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:34,570 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:34,570 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:34,571 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-27 14:35:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-27 14:35:34,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:34,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:34,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 55 states. [2022-04-27 14:35:34,572 INFO L87 Difference]: Start difference. First operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 55 states. [2022-04-27 14:35:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:34,573 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-27 14:35:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-27 14:35:34,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:34,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:34,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:34,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-27 14:35:34,574 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2022-04-27 14:35:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:34,574 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-27 14:35:34,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-27 14:35:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 14:35:34,575 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:34,575 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:34,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:34,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 14:35:34,775 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:34,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 3 times [2022-04-27 14:35:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:34,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583194707] [2022-04-27 14:35:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:34,787 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:34,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944679868] [2022-04-27 14:35:34,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:35:34,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:34,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:34,798 INFO L229 MonitoredProcess]: Starting monitored process 11 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:34,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 14:35:34,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-27 14:35:34,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 14:35:34,888 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 14:35:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 14:35:34,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 14:35:34,933 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 14:35:34,933 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:35:34,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:35,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 14:35:35,137 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2022-04-27 14:35:35,139 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:35:35,167 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:35:35,168 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:35:35,168 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:35,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:35:35 BoogieIcfgContainer [2022-04-27 14:35:35,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:35:35,169 INFO L158 Benchmark]: Toolchain (without parser) took 40537.14ms. Allocated memory was 189.8MB in the beginning and 260.0MB in the end (delta: 70.3MB). Free memory was 140.2MB in the beginning and 121.6MB in the end (delta: 18.5MB). Peak memory consumption was 89.7MB. Max. memory is 8.0GB. [2022-04-27 14:35:35,169 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:35:35,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.18ms. Allocated memory is still 189.8MB. Free memory was 140.0MB in the beginning and 165.5MB in the end (delta: -25.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-27 14:35:35,170 INFO L158 Benchmark]: Boogie Preprocessor took 17.06ms. Allocated memory is still 189.8MB. Free memory was 165.5MB in the beginning and 164.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:35:35,170 INFO L158 Benchmark]: RCFGBuilder took 268.00ms. Allocated memory is still 189.8MB. Free memory was 164.1MB in the beginning and 153.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:35:35,170 INFO L158 Benchmark]: TraceAbstraction took 40000.71ms. Allocated memory was 189.8MB in the beginning and 260.0MB in the end (delta: 70.3MB). Free memory was 152.6MB in the beginning and 121.6MB in the end (delta: 30.9MB). Peak memory consumption was 102.8MB. Max. memory is 8.0GB. [2022-04-27 14:35:35,171 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.18ms. Allocated memory is still 189.8MB. Free memory was 140.0MB in the beginning and 165.5MB in the end (delta: -25.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.06ms. Allocated memory is still 189.8MB. Free memory was 165.5MB in the beginning and 164.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 268.00ms. Allocated memory is still 189.8MB. Free memory was 164.1MB in the beginning and 153.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 40000.71ms. Allocated memory was 189.8MB in the beginning and 260.0MB in the end (delta: 70.3MB). Free memory was 152.6MB in the beginning and 121.6MB in the end (delta: 30.9MB). Peak memory consumption was 102.8MB. 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)=7, 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=6, x=0, y=0] [L27] EXPR counter++ VAL [\old(counter)=0, c=0, counter=1, counter++=0, k=6, x=0, y=0] [L27] COND TRUE counter++<5 [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=6, 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=6, x=1, y=1] [L27] EXPR counter++ VAL [\old(counter)=0, c=1, counter=2, counter++=1, k=6, x=1, y=1] [L27] COND TRUE counter++<5 [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=6, 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=6, x=9, y=2] [L27] EXPR counter++ VAL [\old(counter)=0, c=2, counter=3, counter++=2, k=6, x=9, y=2] [L27] COND TRUE counter++<5 [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=3] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=2, counter=3, k=6, x=9, y=2] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=3, counter=3, k=6, x=36, y=3] [L27] EXPR counter++ VAL [\old(counter)=0, c=3, counter=4, counter++=3, k=6, x=36, y=3] [L27] COND TRUE counter++<5 [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=4] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=3, counter=4, k=6, x=36, y=3] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=4, counter=4, k=6, x=100, y=4] [L27] EXPR counter++ VAL [\old(counter)=0, c=4, counter=5, counter++=4, k=6, x=100, y=4] [L27] COND TRUE counter++<5 [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=5] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=4, counter=5, k=6, x=100, y=4] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=5, counter=5, k=6, x=225, y=5] [L27] EXPR counter++ VAL [\old(counter)=0, c=5, counter=6, counter++=5, k=6, x=225, y=5] [L27] COND FALSE !(counter++<5) [L37] CALL __VERIFIER_assert(k*y - (y*y) == 0) VAL [\old(cond)=0, \old(counter)=0, counter=6] [L10] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] [L12] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.9s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 990 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 758 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 536 IncrementalHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 232 mSDtfsCounter, 536 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 343 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=10, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 1359 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1015 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 158/334 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:35,193 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...