/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/ps6-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 15:35:52,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 15:35:52,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 15:35:52,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 15:35:52,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 15:35:52,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 15:35:52,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 15:35:52,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 15:35:52,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 15:35:52,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 15:35:52,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 15:35:52,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 15:35:52,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 15:35:52,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 15:35:52,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 15:35:52,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 15:35:52,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 15:35:52,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 15:35:52,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 15:35:52,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 15:35:52,862 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 15:35:52,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 15:35:52,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 15:35:52,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 15:35:52,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 15:35:52,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 15:35:52,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 15:35:52,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 15:35:52,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 15:35:52,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 15:35:52,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 15:35:52,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 15:35:52,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 15:35:52,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 15:35:52,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 15:35:52,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 15:35:52,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 15:35:52,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 15:35:52,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 15:35:52,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 15:35:52,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 15:35:52,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 15:35:52,890 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-07 15:35:52,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 15:35:52,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 15:35:52,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 15:35:52,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 15:35:52,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 15:35:52,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 15:35:52,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 15:35:52,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 15:35:52,916 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 15:35:52,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 15:35:52,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 15:35:52,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 15:35:52,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 15:35:52,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 15:35:52,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 15:35:52,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 15:35:52,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 15:35:52,917 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 15:35:52,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 15:35:52,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 15:35:52,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 15:35:52,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 15:35:52,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 15:35:52,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 15:35:52,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:35:52,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 15:35:52,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 15:35:52,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 15:35:52,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 15:35:52,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 15:35:52,919 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 15:35:52,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 15:35:52,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 15:35:52,919 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-07 15:35:53,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 15:35:53,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 15:35:53,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 15:35:53,130 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 15:35:53,132 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 15:35:53,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c [2022-04-07 15:35:53,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92ea756f/ddab26f20c5b44b0b948f9a0e9f60858/FLAGe3527182d [2022-04-07 15:35:53,565 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 15:35:53,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c [2022-04-07 15:35:53,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92ea756f/ddab26f20c5b44b0b948f9a0e9f60858/FLAGe3527182d [2022-04-07 15:35:53,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92ea756f/ddab26f20c5b44b0b948f9a0e9f60858 [2022-04-07 15:35:53,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 15:35:53,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 15:35:53,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 15:35:53,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 15:35:53,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 15:35:53,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:35:53" (1/1) ... [2022-04-07 15:35:53,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1285a20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53, skipping insertion in model container [2022-04-07 15:35:53,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:35:53" (1/1) ... [2022-04-07 15:35:53,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 15:35:53,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 15:35:53,711 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/ps6-ll_unwindbound5.c[458,471] [2022-04-07 15:35:53,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:35:53,750 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 15:35:53,757 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/ps6-ll_unwindbound5.c[458,471] [2022-04-07 15:35:53,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:35:53,772 INFO L208 MainTranslator]: Completed translation [2022-04-07 15:35:53,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53 WrapperNode [2022-04-07 15:35:53,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 15:35:53,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 15:35:53,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 15:35:53,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 15:35:53,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53" (1/1) ... [2022-04-07 15:35:53,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53" (1/1) ... [2022-04-07 15:35:53,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53" (1/1) ... [2022-04-07 15:35:53,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53" (1/1) ... [2022-04-07 15:35:53,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53" (1/1) ... [2022-04-07 15:35:53,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53" (1/1) ... [2022-04-07 15:35:53,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53" (1/1) ... [2022-04-07 15:35:53,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 15:35:53,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 15:35:53,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 15:35:53,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 15:35:53,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53" (1/1) ... [2022-04-07 15:35:53,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:35:53,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:35:53,815 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-07 15:35:53,817 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-07 15:35:53,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 15:35:53,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 15:35:53,843 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 15:35:53,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 15:35:53,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 15:35:53,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 15:35:53,847 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 15:35:53,847 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 15:35:53,848 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 15:35:53,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 15:35:53,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-07 15:35:53,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 15:35:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 15:35:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 15:35:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 15:35:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 15:35:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 15:35:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 15:35:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 15:35:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 15:35:53,902 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 15:35:53,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 15:35:53,999 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 15:35:54,004 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 15:35:54,004 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 15:35:54,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:35:54 BoogieIcfgContainer [2022-04-07 15:35:54,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 15:35:54,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 15:35:54,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 15:35:54,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 15:35:54,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 03:35:53" (1/3) ... [2022-04-07 15:35:54,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576bc47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:35:54, skipping insertion in model container [2022-04-07 15:35:54,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:35:53" (2/3) ... [2022-04-07 15:35:54,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576bc47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:35:54, skipping insertion in model container [2022-04-07 15:35:54,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:35:54" (3/3) ... [2022-04-07 15:35:54,011 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound5.c [2022-04-07 15:35:54,014 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 15:35:54,015 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 15:35:54,065 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 15:35:54,075 INFO L340 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 [2022-04-07 15:35:54,075 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 15:35:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:35:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 15:35:54,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:35:54,095 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:35:54,096 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:35:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:35:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-07 15:35:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:35:54,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795803430] [2022-04-07 15:35:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:35:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 15:35:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:54,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-07 15:35:54,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-07 15:35:54,251 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-07 15:35:54,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 15:35:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:54,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-07 15:35:54,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-07 15:35:54,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-07 15:35:54,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-07 15:35:54,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 15:35:54,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-07 15:35:54,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-07 15:35:54,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-07 15:35:54,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-07 15:35:54,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-07 15:35:54,271 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-07 15:35:54,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-07 15:35:54,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-07 15:35:54,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-07 15:35:54,272 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-07 15:35:54,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-07 15:35:54,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-07 15:35:54,273 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-07 15:35:54,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-07 15:35:54,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-07 15:35:54,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-07 15:35:54,274 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-07 15:35:54,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:35:54,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795803430] [2022-04-07 15:35:54,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795803430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:35:54,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:35:54,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 15:35:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324283898] [2022-04-07 15:35:54,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:35:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 15:35:54,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:35:54,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 15:35:54,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:35:54,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 15:35:54,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:35:54,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 15:35:54,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:35:54,340 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 15:35:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:54,579 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-07 15:35:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 15:35:54,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 15:35:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:35:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 15:35:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-07 15:35:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 15:35:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-07 15:35:54,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-07 15:35:54,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:35:54,666 INFO L225 Difference]: With dead ends: 50 [2022-04-07 15:35:54,667 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 15:35:54,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:35:54,672 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:35:54,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 15:35:54,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 15:35:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-07 15:35:54,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:35:54,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 15:35:54,693 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 15:35:54,694 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 15:35:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:54,697 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-07 15:35:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-07 15:35:54,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:54,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:54,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-07 15:35:54,698 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-07 15:35:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:54,700 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-07 15:35:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-07 15:35:54,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:54,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:54,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:35:54,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:35:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 15:35:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-07 15:35:54,704 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-07 15:35:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:35:54,704 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-07 15:35:54,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 15:35:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-07 15:35:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 15:35:54,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:35:54,705 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:35:54,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 15:35:54,705 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:35:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:35:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-07 15:35:54,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:35:54,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442286121] [2022-04-07 15:35:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:35:54,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:35:54,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672930264] [2022-04-07 15:35:54,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:54,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:35:54,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:35:54,724 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-07 15:35:54,739 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-07 15:35:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:54,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 15:35:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:54,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:35:54,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-07 15:35:54,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#(<= ~counter~0 0)} {196#true} #61#return; {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#(<= ~counter~0 0)} call #t~ret6 := main(); {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {204#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#(<= ~counter~0 0)} ~cond := #in~cond; {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(<= ~counter~0 0)} assume !(0 == ~cond); {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204#(<= ~counter~0 0)} {204#(<= ~counter~0 0)} #53#return; {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {204#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:54,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {238#(<= |main_#t~post5| 0)} is VALID [2022-04-07 15:35:54,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {197#false} is VALID [2022-04-07 15:35:54,943 INFO L272 TraceCheckUtils]: 14: Hoare triple {197#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {197#false} is VALID [2022-04-07 15:35:54,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-07 15:35:54,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-07 15:35:54,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-07 15:35:54,944 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-07 15:35:54,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:35:54,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:35:54,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442286121] [2022-04-07 15:35:54,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:35:54,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672930264] [2022-04-07 15:35:54,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672930264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:35:54,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:35:54,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 15:35:54,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179902040] [2022-04-07 15:35:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:35:54,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-07 15:35:54,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:35:54,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 15:35:54,965 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-07 15:35:54,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 15:35:54,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:35:54,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 15:35:54,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 15:35:54,968 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 15:35:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:55,069 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-07 15:35:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 15:35:55,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-07 15:35:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:35:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 15:35:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-07 15:35:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 15:35:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-07 15:35:55,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-07 15:35:55,105 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-07 15:35:55,107 INFO L225 Difference]: With dead ends: 34 [2022-04-07 15:35:55,107 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 15:35:55,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 15:35:55,109 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:35:55,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:35:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 15:35:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-07 15:35:55,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:35:55,121 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-07 15:35:55,121 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-07 15:35:55,122 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-07 15:35:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:55,132 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-07 15:35:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-07 15:35:55,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:55,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:55,133 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-07 15:35:55,134 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-07 15:35:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:55,138 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-07 15:35:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-07 15:35:55,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:55,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:55,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:35:55,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:35:55,141 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-07 15:35:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-07 15:35:55,144 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-07 15:35:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:35:55,145 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-07 15:35:55,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 15:35:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-07 15:35:55,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 15:35:55,145 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:35:55,145 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:35:55,165 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-07 15:35:55,346 WARN L460 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-07 15:35:55,347 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:35:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:35:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-07 15:35:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:35:55,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510232901] [2022-04-07 15:35:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:35:55,368 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:35:55,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635520970] [2022-04-07 15:35:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:55,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:35:55,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:35:55,369 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-07 15:35:55,374 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-07 15:35:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:55,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 15:35:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:55,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:35:55,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2022-04-07 15:35:55,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {392#true} is VALID [2022-04-07 15:35:55,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-07 15:35:55,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {392#true} {392#true} #61#return; {392#true} is VALID [2022-04-07 15:35:55,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {392#true} call #t~ret6 := main(); {392#true} is VALID [2022-04-07 15:35:55,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {392#true} is VALID [2022-04-07 15:35:55,485 INFO L272 TraceCheckUtils]: 6: Hoare triple {392#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {392#true} is VALID [2022-04-07 15:35:55,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2022-04-07 15:35:55,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2022-04-07 15:35:55,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-07 15:35:55,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {392#true} {392#true} #53#return; {392#true} is VALID [2022-04-07 15:35:55,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {392#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:55,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:55,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:55,488 INFO L272 TraceCheckUtils]: 14: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {440#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:35:55,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {444#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:35:55,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {444#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {393#false} is VALID [2022-04-07 15:35:55,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#false} assume !false; {393#false} is VALID [2022-04-07 15:35:55,489 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-07 15:35:55,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:35:55,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:35:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510232901] [2022-04-07 15:35:55,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:35:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635520970] [2022-04-07 15:35:55,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635520970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:35:55,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:35:55,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 15:35:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258057944] [2022-04-07 15:35:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:35:55,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 15:35:55,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:35:55,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 15:35:55,502 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-07 15:35:55,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:35:55,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:35:55,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:35:55,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 15:35:55,503 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 15:35:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:55,661 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 15:35:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:35:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 15:35:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:35:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 15:35:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-07 15:35:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 15:35:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-07 15:35:55,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-07 15:35:55,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:35:55,706 INFO L225 Difference]: With dead ends: 36 [2022-04-07 15:35:55,706 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 15:35:55,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 15:35:55,709 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:35:55,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 15:35:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 15:35:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 15:35:55,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:35:55,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:35:55,721 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:35:55,721 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:35:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:55,725 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-07 15:35:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-07 15:35:55,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:55,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:55,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-07 15:35:55,730 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-07 15:35:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:55,735 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-07 15:35:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-07 15:35:55,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:55,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:55,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:35:55,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:35:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:35:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-07 15:35:55,737 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-07 15:35:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:35:55,737 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-07 15:35:55,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 15:35:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-07 15:35:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 15:35:55,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:35:55,738 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:35:55,763 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-07 15:35:55,938 WARN L460 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-07 15:35:55,939 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:35:55,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:35:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-07 15:35:55,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:35:55,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944251692] [2022-04-07 15:35:55,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:35:55,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:35:55,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187097691] [2022-04-07 15:35:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:55,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:35:55,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:35:55,967 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-07 15:35:55,975 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-07 15:35:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:56,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 15:35:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:56,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:35:56,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-07 15:35:56,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#(<= ~counter~0 0)} {614#true} #61#return; {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#(<= ~counter~0 0)} call #t~ret6 := main(); {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,157 INFO L272 TraceCheckUtils]: 6: Hoare triple {622#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(<= ~counter~0 0)} ~cond := #in~cond; {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {622#(<= ~counter~0 0)} assume !(0 == ~cond); {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {622#(<= ~counter~0 0)} {622#(<= ~counter~0 0)} #53#return; {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {622#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {622#(<= ~counter~0 0)} is VALID [2022-04-07 15:35:56,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {622#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-07 15:35:56,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-07 15:35:56,160 INFO L272 TraceCheckUtils]: 14: Hoare triple {656#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {656#(<= ~counter~0 1)} is VALID [2022-04-07 15:35:56,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#(<= ~counter~0 1)} ~cond := #in~cond; {656#(<= ~counter~0 1)} is VALID [2022-04-07 15:35:56,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= ~counter~0 1)} assume !(0 == ~cond); {656#(<= ~counter~0 1)} is VALID [2022-04-07 15:35:56,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#(<= ~counter~0 1)} assume true; {656#(<= ~counter~0 1)} is VALID [2022-04-07 15:35:56,169 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {656#(<= ~counter~0 1)} {656#(<= ~counter~0 1)} #55#return; {656#(<= ~counter~0 1)} is VALID [2022-04-07 15:35:56,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {656#(<= ~counter~0 1)} is VALID [2022-04-07 15:35:56,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {681#(<= |main_#t~post5| 1)} is VALID [2022-04-07 15:35:56,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {615#false} is VALID [2022-04-07 15:35:56,170 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {615#false} is VALID [2022-04-07 15:35:56,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-07 15:35:56,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-07 15:35:56,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-07 15:35:56,171 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-07 15:35:56,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:35:56,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-07 15:35:56,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-07 15:35:56,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-07 15:35:56,333 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {615#false} is VALID [2022-04-07 15:35:56,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {709#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {615#false} is VALID [2022-04-07 15:35:56,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {713#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {709#(< |main_#t~post5| 5)} is VALID [2022-04-07 15:35:56,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#(< ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {713#(< ~counter~0 5)} is VALID [2022-04-07 15:35:56,336 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {614#true} {713#(< ~counter~0 5)} #55#return; {713#(< ~counter~0 5)} is VALID [2022-04-07 15:35:56,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-07 15:35:56,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-07 15:35:56,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-07 15:35:56,337 INFO L272 TraceCheckUtils]: 14: Hoare triple {713#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {614#true} is VALID [2022-04-07 15:35:56,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {713#(< ~counter~0 5)} is VALID [2022-04-07 15:35:56,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {738#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {713#(< ~counter~0 5)} is VALID [2022-04-07 15:35:56,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {738#(< ~counter~0 4)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {738#(< ~counter~0 4)} is VALID [2022-04-07 15:35:56,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {614#true} {738#(< ~counter~0 4)} #53#return; {738#(< ~counter~0 4)} is VALID [2022-04-07 15:35:56,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-07 15:35:56,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-07 15:35:56,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-07 15:35:56,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {738#(< ~counter~0 4)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {614#true} is VALID [2022-04-07 15:35:56,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#(< ~counter~0 4)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {738#(< ~counter~0 4)} is VALID [2022-04-07 15:35:56,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#(< ~counter~0 4)} call #t~ret6 := main(); {738#(< ~counter~0 4)} is VALID [2022-04-07 15:35:56,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#(< ~counter~0 4)} {614#true} #61#return; {738#(< ~counter~0 4)} is VALID [2022-04-07 15:35:56,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#(< ~counter~0 4)} assume true; {738#(< ~counter~0 4)} is VALID [2022-04-07 15:35:56,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {738#(< ~counter~0 4)} is VALID [2022-04-07 15:35:56,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-07 15:35:56,343 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-07 15:35:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:35:56,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944251692] [2022-04-07 15:35:56,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:35:56,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187097691] [2022-04-07 15:35:56,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187097691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:35:56,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:35:56,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 15:35:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298810907] [2022-04-07 15:35:56,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:35:56,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-07 15:35:56,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:35:56,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 15:35:56,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:35:56,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 15:35:56,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:35:56,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 15:35:56,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 15:35:56,389 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 15:35:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:56,561 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-07 15:35:56,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 15:35:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-07 15:35:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:35:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 15:35:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-07 15:35:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 15:35:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-07 15:35:56,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2022-04-07 15:35:56,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:35:56,633 INFO L225 Difference]: With dead ends: 66 [2022-04-07 15:35:56,633 INFO L226 Difference]: Without dead ends: 58 [2022-04-07 15:35:56,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 15:35:56,633 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:35:56,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:35:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-07 15:35:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-04-07 15:35:56,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:35:56,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:35:56,648 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:35:56,648 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:35:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:56,650 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-07 15:35:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-07 15:35:56,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:56,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:56,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-07 15:35:56,652 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-07 15:35:56,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:56,653 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-07 15:35:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-07 15:35:56,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:56,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:56,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:35:56,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:35:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:35:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-07 15:35:56,672 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 26 [2022-04-07 15:35:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:35:56,672 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-07 15:35:56,673 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 15:35:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-07 15:35:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 15:35:56,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:35:56,673 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:35:56,690 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-07 15:35:56,891 WARN L460 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-07 15:35:56,891 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:35:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:35:56,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-07 15:35:56,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:35:56,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984566431] [2022-04-07 15:35:56,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:56,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:35:56,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:35:56,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1863170908] [2022-04-07 15:35:56,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:56,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:35:56,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:35:56,905 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-07 15:35:56,925 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-07 15:35:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:56,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 15:35:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:56,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:35:57,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-07 15:35:57,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1072#true} is VALID [2022-04-07 15:35:57,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-07 15:35:57,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-07 15:35:57,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-07 15:35:57,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1072#true} is VALID [2022-04-07 15:35:57,089 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-07 15:35:57,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-07 15:35:57,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-07 15:35:57,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-07 15:35:57,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-07 15:35:57,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:57,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:57,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:57,093 INFO L272 TraceCheckUtils]: 14: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1072#true} is VALID [2022-04-07 15:35:57,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-07 15:35:57,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-07 15:35:57,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-07 15:35:57,100 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:57,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-07 15:35:57,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-07 15:35:57,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-07 15:35:57,102 INFO L272 TraceCheckUtils]: 22: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:35:57,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:35:57,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-07 15:35:57,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-07 15:35:57,103 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-07 15:35:57,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:35:57,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-07 15:35:57,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-07 15:35:57,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:35:57,249 INFO L272 TraceCheckUtils]: 22: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:35:57,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-07 15:35:57,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-07 15:35:57,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-07 15:35:57,331 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #55#return; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-07 15:35:57,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-07 15:35:57,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-07 15:35:57,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-07 15:35:57,331 INFO L272 TraceCheckUtils]: 14: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1072#true} is VALID [2022-04-07 15:35:57,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-07 15:35:57,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-07 15:35:57,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-07 15:35:57,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-07 15:35:57,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-07 15:35:57,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-07 15:35:57,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-07 15:35:57,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-07 15:35:57,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1072#true} is VALID [2022-04-07 15:35:57,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-07 15:35:57,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-07 15:35:57,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-07 15:35:57,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1072#true} is VALID [2022-04-07 15:35:57,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-07 15:35:57,334 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-07 15:35:57,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:35:57,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984566431] [2022-04-07 15:35:57,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:35:57,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863170908] [2022-04-07 15:35:57,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863170908] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 15:35:57,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:35:57,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-07 15:35:57,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537462064] [2022-04-07 15:35:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:35:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-07 15:35:57,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:35:57,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 15:35:57,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:35:57,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:35:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:35:57,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:35:57,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 15:35:57,431 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 15:35:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:57,536 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-07 15:35:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:35:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-07 15:35:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:35:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 15:35:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-07 15:35:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 15:35:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-07 15:35:57,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-07 15:35:57,639 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-07 15:35:57,641 INFO L225 Difference]: With dead ends: 68 [2022-04-07 15:35:57,641 INFO L226 Difference]: Without dead ends: 60 [2022-04-07 15:35:57,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 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-07 15:35:57,641 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:35:57,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:35:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-07 15:35:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-07 15:35:57,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:35:57,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:35:57,662 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:35:57,663 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:35:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:57,664 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-07 15:35:57,664 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-07 15:35:57,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:57,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:57,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-07 15:35:57,665 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-07 15:35:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:57,667 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-07 15:35:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-07 15:35:57,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:57,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:57,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:35:57,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:35:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:35:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-04-07 15:35:57,669 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 26 [2022-04-07 15:35:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:35:57,669 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-04-07 15:35:57,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 15:35:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-07 15:35:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 15:35:57,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:35:57,670 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:35:57,677 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-07 15:35:57,877 WARN L460 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-07 15:35:57,878 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:35:57,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:35:57,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-07 15:35:57,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:35:57,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189493709] [2022-04-07 15:35:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:35:57,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:35:57,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118699039] [2022-04-07 15:35:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:57,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:35:57,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:35:57,890 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-07 15:35:57,891 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-07 15:35:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:57,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 15:35:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:57,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:35:58,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2022-04-07 15:35:58,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1530#true} is VALID [2022-04-07 15:35:58,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-07 15:35:58,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1530#true} {1530#true} #61#return; {1530#true} is VALID [2022-04-07 15:35:58,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {1530#true} call #t~ret6 := main(); {1530#true} is VALID [2022-04-07 15:35:58,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {1530#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1530#true} is VALID [2022-04-07 15:35:58,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {1530#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1530#true} is VALID [2022-04-07 15:35:58,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-07 15:35:58,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-07 15:35:58,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-07 15:35:58,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1530#true} {1530#true} #53#return; {1530#true} is VALID [2022-04-07 15:35:58,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {1530#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:58,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:58,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:58,202 INFO L272 TraceCheckUtils]: 14: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1530#true} is VALID [2022-04-07 15:35:58,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-07 15:35:58,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-07 15:35:58,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-07 15:35:58,205 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1530#true} {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:58,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-07 15:35:58,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-07 15:35:58,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-07 15:35:58,209 INFO L272 TraceCheckUtils]: 22: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1530#true} is VALID [2022-04-07 15:35:58,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-07 15:35:58,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-07 15:35:58,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-07 15:35:58,210 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1530#true} {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-07 15:35:58,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-07 15:35:58,210 INFO L272 TraceCheckUtils]: 28: Hoare triple {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1530#true} is VALID [2022-04-07 15:35:58,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-07 15:35:58,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-07 15:35:58,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-07 15:35:58,211 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1530#true} {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-07 15:35:58,211 INFO L272 TraceCheckUtils]: 33: Hoare triple {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:35:58,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:35:58,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {1641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1531#false} is VALID [2022-04-07 15:35:58,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2022-04-07 15:35:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:35:58,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:35:58,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:35:58,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189493709] [2022-04-07 15:35:58,552 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:35:58,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118699039] [2022-04-07 15:35:58,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118699039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:35:58,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:35:58,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-07 15:35:58,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078695043] [2022-04-07 15:35:58,553 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:35:58,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-07 15:35:58,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:35:58,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 15:35:58,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:35:58,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 15:35:58,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:35:58,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 15:35:58,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 15:35:58,575 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 15:35:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:58,759 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-07 15:35:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 15:35:58,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-07 15:35:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:35:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 15:35:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-07 15:35:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 15:35:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-07 15:35:58,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-07 15:35:58,790 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-07 15:35:58,791 INFO L225 Difference]: With dead ends: 59 [2022-04-07 15:35:58,791 INFO L226 Difference]: Without dead ends: 53 [2022-04-07 15:35:58,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-07 15:35:58,792 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:35:58,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:35:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-07 15:35:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-07 15:35:58,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:35:58,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:35:58,810 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:35:58,811 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:35:58,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:58,812 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-07 15:35:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-07 15:35:58,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:58,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:58,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-07 15:35:58,813 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-07 15:35:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:35:58,814 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-07 15:35:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-07 15:35:58,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:35:58,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:35:58,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:35:58,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:35:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:35:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-07 15:35:58,816 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 37 [2022-04-07 15:35:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:35:58,816 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-07 15:35:58,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 15:35:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-07 15:35:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 15:35:58,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:35:58,817 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:35:58,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-07 15:35:59,034 WARN L460 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-07 15:35:59,034 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:35:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:35:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 2 times [2022-04-07 15:35:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:35:59,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271925572] [2022-04-07 15:35:59,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:35:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:35:59,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:35:59,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1331037867] [2022-04-07 15:35:59,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:35:59,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:35:59,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:35:59,045 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-07 15:35:59,046 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-07 15:35:59,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:35:59,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:35:59,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-07 15:35:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:35:59,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:35:59,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1978#true} is VALID [2022-04-07 15:35:59,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1978#true} is VALID [2022-04-07 15:35:59,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-07 15:35:59,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #61#return; {1978#true} is VALID [2022-04-07 15:35:59,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret6 := main(); {1978#true} is VALID [2022-04-07 15:35:59,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1978#true} is VALID [2022-04-07 15:35:59,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {1978#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1978#true} is VALID [2022-04-07 15:35:59,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-07 15:35:59,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-07 15:35:59,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-07 15:35:59,403 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1978#true} {1978#true} #53#return; {1978#true} is VALID [2022-04-07 15:35:59,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {1978#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:59,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:59,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:59,404 INFO L272 TraceCheckUtils]: 14: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1978#true} is VALID [2022-04-07 15:35:59,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-07 15:35:59,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-07 15:35:59,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-07 15:35:59,405 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1978#true} {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:35:59,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:35:59,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:35:59,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:35:59,406 INFO L272 TraceCheckUtils]: 22: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1978#true} is VALID [2022-04-07 15:35:59,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-07 15:35:59,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-07 15:35:59,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-07 15:35:59,406 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1978#true} {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:35:59,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-07 15:35:59,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-07 15:35:59,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 5);havoc #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-07 15:35:59,408 INFO L272 TraceCheckUtils]: 30: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1978#true} is VALID [2022-04-07 15:35:59,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-07 15:35:59,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-07 15:35:59,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-07 15:35:59,408 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1978#true} {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #55#return; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-07 15:35:59,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-07 15:35:59,409 INFO L272 TraceCheckUtils]: 36: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1978#true} is VALID [2022-04-07 15:35:59,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-07 15:35:59,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-07 15:35:59,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-07 15:35:59,409 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1978#true} {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} #57#return; {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-07 15:35:59,410 INFO L272 TraceCheckUtils]: 41: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:35:59,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2114#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:35:59,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {2114#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1979#false} is VALID [2022-04-07 15:35:59,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-07 15:35:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 15:35:59,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:35:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:35:59,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271925572] [2022-04-07 15:35:59,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:35:59,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331037867] [2022-04-07 15:35:59,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331037867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:35:59,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:35:59,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-07 15:35:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157294526] [2022-04-07 15:35:59,725 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:35:59,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-07 15:35:59,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:35:59,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 15:35:59,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:35:59,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 15:35:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:35:59,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 15:35:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-07 15:35:59,748 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 15:36:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:00,039 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-07 15:36:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 15:36:00,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-07 15:36:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:36:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 15:36:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-07 15:36:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 15:36:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-07 15:36:00,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-07 15:36:00,076 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-07 15:36:00,077 INFO L225 Difference]: With dead ends: 58 [2022-04-07 15:36:00,077 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 15:36:00,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-07 15:36:00,078 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:36:00,078 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 15:36:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 15:36:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-07 15:36:00,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:36:00,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:36:00,097 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:36:00,098 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:36:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:00,099 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-07 15:36:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-07 15:36:00,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:36:00,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:36:00,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-07 15:36:00,100 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-07 15:36:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:00,101 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-07 15:36:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-07 15:36:00,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:36:00,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:36:00,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:36:00,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:36:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:36:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-07 15:36:00,103 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2022-04-07 15:36:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:36:00,103 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-07 15:36:00,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 15:36:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-07 15:36:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-07 15:36:00,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:36:00,104 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:36:00,116 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-07 15:36:00,308 WARN L460 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-07 15:36:00,309 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:36:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:36:00,309 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 3 times [2022-04-07 15:36:00,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:36:00,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824339764] [2022-04-07 15:36:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:36:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:36:00,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:36:00,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538030603] [2022-04-07 15:36:00,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 15:36:00,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:36:00,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:36:00,326 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-07 15:36:00,327 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-07 15:36:00,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 15:36:00,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:36:00,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 15:36:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:36:00,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:36:01,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2022-04-07 15:36:01,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#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; {2445#true} is VALID [2022-04-07 15:36:01,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-07 15:36:01,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #61#return; {2445#true} is VALID [2022-04-07 15:36:01,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret6 := main(); {2445#true} is VALID [2022-04-07 15:36:01,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {2445#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; {2445#true} is VALID [2022-04-07 15:36:01,086 INFO L272 TraceCheckUtils]: 6: Hoare triple {2445#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2445#true} is VALID [2022-04-07 15:36:01,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-07 15:36:01,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-07 15:36:01,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-07 15:36:01,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2445#true} {2445#true} #53#return; {2445#true} is VALID [2022-04-07 15:36:01,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:36:01,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:36:01,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:36:01,092 INFO L272 TraceCheckUtils]: 14: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2445#true} is VALID [2022-04-07 15:36:01,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-07 15:36:01,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-07 15:36:01,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-07 15:36:01,102 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2445#true} {2483#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:36:01,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:36:01,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:36:01,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:36:01,103 INFO L272 TraceCheckUtils]: 22: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2445#true} is VALID [2022-04-07 15:36:01,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-07 15:36:01,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-07 15:36:01,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-07 15:36:01,104 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2445#true} {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:36:01,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:36:01,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:36:01,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:36:01,105 INFO L272 TraceCheckUtils]: 30: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2445#true} is VALID [2022-04-07 15:36:01,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-07 15:36:01,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-07 15:36:01,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-07 15:36:01,106 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2445#true} {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #55#return; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:36:01,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {2533#(and (= main_~y~0 2) (= 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 * ~y~0 * ~y~0 + ~x~0; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-07 15:36:01,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-07 15:36:01,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 5);havoc #t~post5; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-07 15:36:01,107 INFO L272 TraceCheckUtils]: 38: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2445#true} is VALID [2022-04-07 15:36:01,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-07 15:36:01,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-07 15:36:01,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-07 15:36:01,108 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2445#true} {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #55#return; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-07 15:36:01,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-07 15:36:01,109 INFO L272 TraceCheckUtils]: 44: Hoare triple {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2445#true} is VALID [2022-04-07 15:36:01,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-07 15:36:01,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-07 15:36:01,109 INFO L290 TraceCheckUtils]: 47: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-07 15:36:01,109 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2445#true} {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} #57#return; {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-07 15:36:01,110 INFO L272 TraceCheckUtils]: 49: Hoare triple {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:36:01,110 INFO L290 TraceCheckUtils]: 50: Hoare triple {2602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:36:01,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {2606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2446#false} is VALID [2022-04-07 15:36:01,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2022-04-07 15:36:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-07 15:36:01,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:36:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:36:01,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824339764] [2022-04-07 15:36:01,390 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:36:01,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538030603] [2022-04-07 15:36:01,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538030603] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:36:01,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:36:01,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 15:36:01,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881921412] [2022-04-07 15:36:01,390 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:36:01,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-07 15:36:01,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:36:01,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-07 15:36:01,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:36:01,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 15:36:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:36:01,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 15:36:01,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-07 15:36:01,421 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-07 15:36:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:01,771 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-07 15:36:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 15:36:01,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-07 15:36:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:36:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-07 15:36:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-07 15:36:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-07 15:36:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-07 15:36:01,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-07 15:36:01,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:36:01,836 INFO L225 Difference]: With dead ends: 60 [2022-04-07 15:36:01,836 INFO L226 Difference]: Without dead ends: 54 [2022-04-07 15:36:01,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 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-07 15:36:01,837 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:36:01,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 15:36:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-07 15:36:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-07 15:36:01,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:36:01,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:36:01,861 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:36:01,861 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:36:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:01,862 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-07 15:36:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-07 15:36:01,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:36:01,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:36:01,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-07 15:36:01,863 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-07 15:36:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:01,864 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-07 15:36:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-07 15:36:01,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:36:01,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:36:01,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:36:01,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:36:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:36:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-07 15:36:01,865 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-07 15:36:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:36:01,865 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-07 15:36:01,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-07 15:36:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-07 15:36:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 15:36:01,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:36:01,866 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:36:01,873 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-07 15:36:02,071 WARN L460 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-07 15:36:02,071 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:36:02,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:36:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 1 times [2022-04-07 15:36:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:36:02,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721045965] [2022-04-07 15:36:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:36:02,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:36:02,081 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:36:02,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887696945] [2022-04-07 15:36:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:36:02,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:36:02,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:36:02,082 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-07 15:36:02,084 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-07 15:36:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:36:02,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 15:36:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:36:02,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:36:02,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {2947#true} call ULTIMATE.init(); {2947#true} is VALID [2022-04-07 15:36:02,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {2947#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; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {2955#(<= ~counter~0 0)} assume true; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2955#(<= ~counter~0 0)} {2947#true} #61#return; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {2955#(<= ~counter~0 0)} call #t~ret6 := main(); {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#(<= ~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; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {2955#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {2955#(<= ~counter~0 0)} ~cond := #in~cond; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {2955#(<= ~counter~0 0)} assume !(0 == ~cond); {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {2955#(<= ~counter~0 0)} assume true; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2955#(<= ~counter~0 0)} {2955#(<= ~counter~0 0)} #53#return; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {2955#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {2989#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,373 INFO L272 TraceCheckUtils]: 14: Hoare triple {2989#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {2989#(<= ~counter~0 1)} ~cond := #in~cond; {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {2989#(<= ~counter~0 1)} assume !(0 == ~cond); {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {2989#(<= ~counter~0 1)} assume true; {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,374 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2989#(<= ~counter~0 1)} {2989#(<= ~counter~0 1)} #55#return; {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {2989#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {2989#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {3014#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,375 INFO L272 TraceCheckUtils]: 22: Hoare triple {3014#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {3014#(<= ~counter~0 2)} ~cond := #in~cond; {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {3014#(<= ~counter~0 2)} assume !(0 == ~cond); {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {3014#(<= ~counter~0 2)} assume true; {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,376 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3014#(<= ~counter~0 2)} {3014#(<= ~counter~0 2)} #55#return; {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {3014#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {3014#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {3039#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,377 INFO L272 TraceCheckUtils]: 30: Hoare triple {3039#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {3039#(<= ~counter~0 3)} ~cond := #in~cond; {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {3039#(<= ~counter~0 3)} assume !(0 == ~cond); {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {3039#(<= ~counter~0 3)} assume true; {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,378 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3039#(<= ~counter~0 3)} {3039#(<= ~counter~0 3)} #55#return; {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {3039#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {3039#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {3064#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,389 INFO L272 TraceCheckUtils]: 38: Hoare triple {3064#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {3064#(<= ~counter~0 4)} ~cond := #in~cond; {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {3064#(<= ~counter~0 4)} assume !(0 == ~cond); {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {3064#(<= ~counter~0 4)} assume true; {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,391 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3064#(<= ~counter~0 4)} {3064#(<= ~counter~0 4)} #55#return; {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {3064#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {3064#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3089#(<= |main_#t~post5| 4)} is VALID [2022-04-07 15:36:02,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {3089#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {2948#false} is VALID [2022-04-07 15:36:02,392 INFO L272 TraceCheckUtils]: 46: Hoare triple {2948#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2948#false} is VALID [2022-04-07 15:36:02,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-07 15:36:02,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {2948#false} assume !(0 == ~cond); {2948#false} is VALID [2022-04-07 15:36:02,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {2948#false} assume true; {2948#false} is VALID [2022-04-07 15:36:02,392 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2948#false} {2948#false} #57#return; {2948#false} is VALID [2022-04-07 15:36:02,392 INFO L272 TraceCheckUtils]: 51: Hoare triple {2948#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2948#false} is VALID [2022-04-07 15:36:02,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-07 15:36:02,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {2948#false} assume 0 == ~cond; {2948#false} is VALID [2022-04-07 15:36:02,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {2948#false} assume !false; {2948#false} is VALID [2022-04-07 15:36:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 15:36:02,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:36:02,614 INFO L290 TraceCheckUtils]: 54: Hoare triple {2948#false} assume !false; {2948#false} is VALID [2022-04-07 15:36:02,615 INFO L290 TraceCheckUtils]: 53: Hoare triple {2948#false} assume 0 == ~cond; {2948#false} is VALID [2022-04-07 15:36:02,615 INFO L290 TraceCheckUtils]: 52: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-07 15:36:02,615 INFO L272 TraceCheckUtils]: 51: Hoare triple {2948#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2948#false} is VALID [2022-04-07 15:36:02,615 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2947#true} {2948#false} #57#return; {2948#false} is VALID [2022-04-07 15:36:02,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-07 15:36:02,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-07 15:36:02,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-07 15:36:02,615 INFO L272 TraceCheckUtils]: 46: Hoare triple {2948#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-07 15:36:02,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {3089#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {2948#false} is VALID [2022-04-07 15:36:02,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {3064#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3089#(<= |main_#t~post5| 4)} is VALID [2022-04-07 15:36:02,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {3064#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,616 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2947#true} {3064#(<= ~counter~0 4)} #55#return; {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-07 15:36:02,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-07 15:36:02,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-07 15:36:02,617 INFO L272 TraceCheckUtils]: 38: Hoare triple {3064#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-07 15:36:02,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {3064#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {3039#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3064#(<= ~counter~0 4)} is VALID [2022-04-07 15:36:02,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {3039#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,622 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2947#true} {3039#(<= ~counter~0 3)} #55#return; {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-07 15:36:02,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-07 15:36:02,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-07 15:36:02,622 INFO L272 TraceCheckUtils]: 30: Hoare triple {3039#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-07 15:36:02,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {3039#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {3014#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3039#(<= ~counter~0 3)} is VALID [2022-04-07 15:36:02,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {3014#(<= ~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 * ~y~0 * ~y~0 + ~x~0; {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,624 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2947#true} {3014#(<= ~counter~0 2)} #55#return; {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-07 15:36:02,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-07 15:36:02,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-07 15:36:02,624 INFO L272 TraceCheckUtils]: 22: Hoare triple {3014#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-07 15:36:02,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {3014#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {2989#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3014#(<= ~counter~0 2)} is VALID [2022-04-07 15:36:02,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {2989#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,625 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2947#true} {2989#(<= ~counter~0 1)} #55#return; {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-07 15:36:02,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-07 15:36:02,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-07 15:36:02,626 INFO L272 TraceCheckUtils]: 14: Hoare triple {2989#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-07 15:36:02,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {2989#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {2955#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2989#(<= ~counter~0 1)} is VALID [2022-04-07 15:36:02,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2947#true} {2955#(<= ~counter~0 0)} #53#return; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-07 15:36:02,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-07 15:36:02,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-07 15:36:02,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {2955#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2947#true} is VALID [2022-04-07 15:36:02,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#(<= ~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; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {2955#(<= ~counter~0 0)} call #t~ret6 := main(); {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2955#(<= ~counter~0 0)} {2947#true} #61#return; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {2955#(<= ~counter~0 0)} assume true; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {2947#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; {2955#(<= ~counter~0 0)} is VALID [2022-04-07 15:36:02,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {2947#true} call ULTIMATE.init(); {2947#true} is VALID [2022-04-07 15:36:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-07 15:36:02,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:36:02,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721045965] [2022-04-07 15:36:02,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:36:02,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887696945] [2022-04-07 15:36:02,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887696945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:36:02,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:36:02,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-07 15:36:02,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182431897] [2022-04-07 15:36:02,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:36:02,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 55 [2022-04-07 15:36:02,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:36:02,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-07 15:36:02,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:36:02,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 15:36:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:36:02,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 15:36:02,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 15:36:02,678 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-07 15:36:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:02,846 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-07 15:36:02,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 15:36:02,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 55 [2022-04-07 15:36:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:36:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-07 15:36:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-07 15:36:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-07 15:36:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-07 15:36:02,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-07 15:36:02,898 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-07 15:36:02,899 INFO L225 Difference]: With dead ends: 70 [2022-04-07 15:36:02,899 INFO L226 Difference]: Without dead ends: 60 [2022-04-07 15:36:02,899 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 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-07 15:36:02,899 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:36:02,900 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:36:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-07 15:36:02,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-07 15:36:02,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:36:02,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:36:02,928 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:36:02,928 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:36:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:02,929 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-07 15:36:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-07 15:36:02,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:36:02,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:36:02,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-07 15:36:02,930 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-07 15:36:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:02,931 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-07 15:36:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-07 15:36:02,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:36:02,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:36:02,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:36:02,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:36:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:36:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-07 15:36:02,933 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-07 15:36:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:36:02,933 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-07 15:36:02,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-07 15:36:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-07 15:36:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-07 15:36:02,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:36:02,933 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:36:02,952 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-07 15:36:03,143 WARN L460 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-07 15:36:03,144 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:36:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:36:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 4 times [2022-04-07 15:36:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:36:03,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830570581] [2022-04-07 15:36:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:36:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:36:03,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:36:03,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096939374] [2022-04-07 15:36:03,154 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 15:36:03,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:36:03,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:36:03,155 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-07 15:36:03,156 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-07 15:36:03,196 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 15:36:03,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:36:03,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-07 15:36:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:36:03,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:36:03,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {3596#true} call ULTIMATE.init(); {3596#true} is VALID [2022-04-07 15:36:03,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {3596#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; {3596#true} is VALID [2022-04-07 15:36:03,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {3596#true} assume true; {3596#true} is VALID [2022-04-07 15:36:03,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3596#true} {3596#true} #61#return; {3596#true} is VALID [2022-04-07 15:36:03,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {3596#true} call #t~ret6 := main(); {3596#true} is VALID [2022-04-07 15:36:03,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {3596#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; {3596#true} is VALID [2022-04-07 15:36:03,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {3596#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3596#true} is VALID [2022-04-07 15:36:03,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {3596#true} ~cond := #in~cond; {3596#true} is VALID [2022-04-07 15:36:03,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {3596#true} assume !(0 == ~cond); {3596#true} is VALID [2022-04-07 15:36:03,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {3596#true} assume true; {3596#true} is VALID [2022-04-07 15:36:03,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3596#true} {3596#true} #53#return; {3596#true} is VALID [2022-04-07 15:36:03,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3634#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:36:03,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {3634#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3634#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:36:03,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {3634#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {3634#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:36:03,565 INFO L272 TraceCheckUtils]: 14: Hoare triple {3634#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3596#true} is VALID [2022-04-07 15:36:03,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {3596#true} ~cond := #in~cond; {3596#true} is VALID [2022-04-07 15:36:03,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {3596#true} assume !(0 == ~cond); {3596#true} is VALID [2022-04-07 15:36:03,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {3596#true} assume true; {3596#true} is VALID [2022-04-07 15:36:03,565 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3596#true} {3634#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3634#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:36:03,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {3634#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3659#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:36:03,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {3659#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3659#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:36:03,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {3659#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3659#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:36:03,566 INFO L272 TraceCheckUtils]: 22: Hoare triple {3659#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3596#true} is VALID [2022-04-07 15:36:03,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {3596#true} ~cond := #in~cond; {3596#true} is VALID [2022-04-07 15:36:03,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {3596#true} assume !(0 == ~cond); {3596#true} is VALID [2022-04-07 15:36:03,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {3596#true} assume true; {3596#true} is VALID [2022-04-07 15:36:03,567 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3596#true} {3659#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {3659#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:36:03,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {3659#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3684#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-07 15:36:03,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {3684#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3684#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-07 15:36:03,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {3684#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3684#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-07 15:36:03,568 INFO L272 TraceCheckUtils]: 30: Hoare triple {3684#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3596#true} is VALID [2022-04-07 15:36:03,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {3596#true} ~cond := #in~cond; {3596#true} is VALID [2022-04-07 15:36:03,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {3596#true} assume !(0 == ~cond); {3596#true} is VALID [2022-04-07 15:36:03,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {3596#true} assume true; {3596#true} is VALID [2022-04-07 15:36:03,568 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3596#true} {3684#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {3684#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-07 15:36:03,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {3684#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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 * ~y~0 * ~y~0 + ~x~0; {3709#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-07 15:36:03,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {3709#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3709#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-07 15:36:03,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {3709#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3709#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-07 15:36:03,570 INFO L272 TraceCheckUtils]: 38: Hoare triple {3709#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3596#true} is VALID [2022-04-07 15:36:03,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {3596#true} ~cond := #in~cond; {3596#true} is VALID [2022-04-07 15:36:03,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {3596#true} assume !(0 == ~cond); {3596#true} is VALID [2022-04-07 15:36:03,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {3596#true} assume true; {3596#true} is VALID [2022-04-07 15:36:03,570 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3596#true} {3709#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #55#return; {3709#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-07 15:36:03,571 INFO L290 TraceCheckUtils]: 43: Hoare triple {3709#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3734#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-07 15:36:03,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {3734#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3734#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-07 15:36:03,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {3734#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 5);havoc #t~post5; {3734#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-07 15:36:03,571 INFO L272 TraceCheckUtils]: 46: Hoare triple {3734#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3596#true} is VALID [2022-04-07 15:36:03,572 INFO L290 TraceCheckUtils]: 47: Hoare triple {3596#true} ~cond := #in~cond; {3596#true} is VALID [2022-04-07 15:36:03,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {3596#true} assume !(0 == ~cond); {3596#true} is VALID [2022-04-07 15:36:03,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {3596#true} assume true; {3596#true} is VALID [2022-04-07 15:36:03,572 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3596#true} {3734#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {3734#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-07 15:36:03,572 INFO L290 TraceCheckUtils]: 51: Hoare triple {3734#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {3759#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-07 15:36:03,573 INFO L272 TraceCheckUtils]: 52: Hoare triple {3759#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3596#true} is VALID [2022-04-07 15:36:03,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {3596#true} ~cond := #in~cond; {3596#true} is VALID [2022-04-07 15:36:03,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {3596#true} assume !(0 == ~cond); {3596#true} is VALID [2022-04-07 15:36:03,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {3596#true} assume true; {3596#true} is VALID [2022-04-07 15:36:03,573 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3596#true} {3759#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {3759#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-07 15:36:03,574 INFO L272 TraceCheckUtils]: 57: Hoare triple {3759#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:36:03,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {3778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:36:03,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {3782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3597#false} is VALID [2022-04-07 15:36:03,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {3597#false} assume !false; {3597#false} is VALID [2022-04-07 15:36:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 15:36:03,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:36:03,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:36:03,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830570581] [2022-04-07 15:36:03,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:36:03,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096939374] [2022-04-07 15:36:03,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096939374] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:36:03,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:36:03,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-07 15:36:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50735436] [2022-04-07 15:36:03,836 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:36:03,837 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-07 15:36:03,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:36:03,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-07 15:36:03,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:36:03,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 15:36:03,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:36:03,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 15:36:03,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-07 15:36:03,868 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-07 15:36:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:04,316 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-07 15:36:04,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 15:36:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-07 15:36:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:36:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-07 15:36:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-07 15:36:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-07 15:36:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-07 15:36:04,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-07 15:36:04,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:36:04,380 INFO L225 Difference]: With dead ends: 68 [2022-04-07 15:36:04,380 INFO L226 Difference]: Without dead ends: 62 [2022-04-07 15:36:04,380 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-07 15:36:04,381 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 15:36:04,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 267 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 15:36:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-07 15:36:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-07 15:36:04,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:36:04,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:36:04,408 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:36:04,409 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:36:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:04,410 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-07 15:36:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-07 15:36:04,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:36:04,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:36:04,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-07 15:36:04,410 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-07 15:36:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:36:04,414 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-07 15:36:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-07 15:36:04,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:36:04,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:36:04,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:36:04,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:36:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 15:36:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-07 15:36:04,415 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-07 15:36:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:36:04,416 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-07 15:36:04,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-07 15:36:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-07 15:36:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-07 15:36:04,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:36:04,416 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:36:04,433 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-07 15:36:04,627 WARN L460 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-07 15:36:04,627 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:36:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:36:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 2 times [2022-04-07 15:36:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:36:04,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880169772] [2022-04-07 15:36:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:36:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:36:04,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:36:04,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849192646] [2022-04-07 15:36:04,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:36:04,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:36:04,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:36:04,644 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-07 15:36:04,645 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-07 15:36:05,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:36:05,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-07 15:36:05,030 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 15:36:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 15:36:05,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 15:36:05,106 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 15:36:05,107 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 15:36:05,113 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-07 15:36:05,308 WARN L460 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-07 15:36:05,311 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-04-07 15:36:05,313 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 15:36:05,338 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 15:36:05,339 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 15:36:05,339 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-07 15:36:05,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 03:36:05 BoogieIcfgContainer [2022-04-07 15:36:05,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 15:36:05,341 INFO L158 Benchmark]: Toolchain (without parser) took 11760.00ms. Allocated memory was 173.0MB in the beginning and 253.8MB in the end (delta: 80.7MB). Free memory was 114.6MB in the beginning and 111.0MB in the end (delta: 3.6MB). Peak memory consumption was 85.3MB. Max. memory is 8.0GB. [2022-04-07 15:36:05,341 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 173.0MB. Free memory was 131.5MB in the beginning and 131.3MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 15:36:05,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.64ms. Allocated memory was 173.0MB in the beginning and 210.8MB in the end (delta: 37.7MB). Free memory was 114.5MB in the beginning and 181.0MB in the end (delta: -66.5MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-04-07 15:36:05,341 INFO L158 Benchmark]: Boogie Preprocessor took 19.83ms. Allocated memory is still 210.8MB. Free memory was 181.0MB in the beginning and 179.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 15:36:05,341 INFO L158 Benchmark]: RCFGBuilder took 211.50ms. Allocated memory is still 210.8MB. Free memory was 179.4MB in the beginning and 167.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 15:36:05,341 INFO L158 Benchmark]: TraceAbstraction took 11333.12ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 167.3MB in the beginning and 111.0MB in the end (delta: 56.3MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. [2022-04-07 15:36:05,342 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.15ms. Allocated memory is still 173.0MB. Free memory was 131.5MB in the beginning and 131.3MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.64ms. Allocated memory was 173.0MB in the beginning and 210.8MB in the end (delta: 37.7MB). Free memory was 114.5MB in the beginning and 181.0MB in the end (delta: -66.5MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.83ms. Allocated memory is still 210.8MB. Free memory was 181.0MB in the beginning and 179.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 211.50ms. Allocated memory is still 210.8MB. Free memory was 179.4MB in the beginning and 167.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11333.12ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 167.3MB in the beginning and 111.0MB in the end (delta: 56.3MB). Peak memory consumption was 100.4MB. 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)=8, counter=0] [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L22] CALL assume_abort_if_not(k <= 256) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L7] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L22] RET assume_abort_if_not(k <= 256) VAL [\old(counter)=0, counter=0, k=6] [L24] y = 0 [L25] x = 0 [L26] c = 0 VAL [\old(counter)=0, c=0, counter=0, k=6, x=0, y=0] [L28] EXPR counter++ VAL [\old(counter)=0, c=0, counter=1, counter++=0, k=6, x=0, y=0] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 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] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=0, counter=1, k=6, x=0, y=0] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [\old(counter)=0, c=1, counter=1, k=6, x=1, y=1] [L28] EXPR counter++ VAL [\old(counter)=0, c=1, counter=2, counter++=1, k=6, x=1, y=1] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 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] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=1, counter=2, k=6, x=1, y=1] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [\old(counter)=0, c=2, counter=2, k=6, x=33, y=2] [L28] EXPR counter++ VAL [\old(counter)=0, c=2, counter=3, counter++=2, k=6, x=33, y=2] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 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] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=2, counter=3, k=6, x=33, y=2] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [\old(counter)=0, c=3, counter=3, k=6, x=276, y=3] [L28] EXPR counter++ VAL [\old(counter)=0, c=3, counter=4, counter++=3, k=6, x=276, y=3] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 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] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=3, counter=4, k=6, x=276, y=3] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [\old(counter)=0, c=4, counter=4, k=6, x=1300, y=4] [L28] EXPR counter++ VAL [\old(counter)=0, c=4, counter=5, counter++=4, k=6, x=1300, y=4] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 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] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=4, counter=5, k=6, x=1300, y=4] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [\old(counter)=0, c=5, counter=5, k=6, x=4425, y=5] [L28] EXPR counter++ VAL [\old(counter)=0, c=5, counter=6, counter++=5, k=6, x=4425, y=5] [L28] COND FALSE !(counter++<5) [L39] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L39] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=5, counter=6, k=6, x=4425, y=5] [L40] CALL __VERIFIER_assert(k*y == y*y) 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 1265 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 956 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 547 IncrementalHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 309 mSDtfsCounter, 547 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 452 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=10, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 419 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 1589 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1084 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 259/434 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-07 15:36:05,357 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...