/usr/bin/java -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/theatreSquare.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 13:11:50,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 13:11:50,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 13:11:50,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 13:11:50,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 13:11:50,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 13:11:50,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 13:11:50,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 13:11:50,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 13:11:50,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 13:11:50,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 13:11:50,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 13:11:50,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 13:11:50,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 13:11:50,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 13:11:50,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 13:11:50,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 13:11:50,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 13:11:50,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 13:11:50,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 13:11:50,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 13:11:50,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 13:11:50,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 13:11:50,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 13:11:50,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 13:11:50,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 13:11:50,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 13:11:50,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 13:11:50,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 13:11:50,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 13:11:50,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 13:11:50,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 13:11:50,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 13:11:50,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 13:11:50,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 13:11:50,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 13:11:50,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 13:11:50,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 13:11:50,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 13:11:50,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 13:11:50,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 13:11:50,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 13:11:50,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 13:11:50,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 13:11:50,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 13:11:50,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 13:11:50,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 13:11:50,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 13:11:50,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 13:11:50,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 13:11:50,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 13:11:50,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 13:11:50,941 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 13:11:50,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 13:11:50,941 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 13:11:50,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 13:11:50,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 13:11:50,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 13:11:50,942 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 13:11:50,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 13:11:50,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 13:11:50,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 13:11:50,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 13:11:50,943 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 13:11:50,943 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-01-31 13:11:51,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 13:11:51,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 13:11:51,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 13:11:51,209 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 13:11:51,210 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 13:11:51,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-01-31 13:11:51,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf36b7b1/a115bc9852154681904ae12a0859a0cb/FLAGa2f0a9062 [2022-01-31 13:11:51,674 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 13:11:51,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-01-31 13:11:51,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf36b7b1/a115bc9852154681904ae12a0859a0cb/FLAGa2f0a9062 [2022-01-31 13:11:51,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf36b7b1/a115bc9852154681904ae12a0859a0cb [2022-01-31 13:11:51,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 13:11:51,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 13:11:51,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 13:11:51,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 13:11:51,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 13:11:51,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:11:51" (1/1) ... [2022-01-31 13:11:51,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a9d0116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51, skipping insertion in model container [2022-01-31 13:11:51,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:11:51" (1/1) ... [2022-01-31 13:11:51,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 13:11:51,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 13:11:51,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c[370,383] [2022-01-31 13:11:51,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 13:11:51,868 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 13:11:51,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c[370,383] [2022-01-31 13:11:51,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 13:11:51,925 INFO L208 MainTranslator]: Completed translation [2022-01-31 13:11:51,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51 WrapperNode [2022-01-31 13:11:51,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 13:11:51,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 13:11:51,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 13:11:51,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 13:11:51,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51" (1/1) ... [2022-01-31 13:11:51,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51" (1/1) ... [2022-01-31 13:11:51,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51" (1/1) ... [2022-01-31 13:11:51,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51" (1/1) ... [2022-01-31 13:11:51,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51" (1/1) ... [2022-01-31 13:11:51,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51" (1/1) ... [2022-01-31 13:11:51,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51" (1/1) ... [2022-01-31 13:11:51,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 13:11:51,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 13:11:51,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 13:11:51,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 13:11:51,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51" (1/1) ... [2022-01-31 13:11:51,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 13:11:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:11:51,993 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-01-31 13:11:52,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 13:11:52,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 13:11:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 13:11:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 13:11:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-01-31 13:11:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-01-31 13:11:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 13:11:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 13:11:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 13:11:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 13:11:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 13:11:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 13:11:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 13:11:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-01-31 13:11:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-01-31 13:11:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 13:11:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 13:11:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 13:11:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 13:11:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 13:11:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 13:11:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 13:11:52,021 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-01-31 13:11:52,118 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 13:11:52,119 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 13:11:52,236 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 13:11:52,241 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 13:11:52,242 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-31 13:11:52,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:11:52 BoogieIcfgContainer [2022-01-31 13:11:52,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 13:11:52,244 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 13:11:52,244 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 13:11:52,245 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 13:11:52,248 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:11:52" (1/1) ... [2022-01-31 13:11:52,497 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 13:11:52,497 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_correct_version_~i~0_5 1) v_correct_version_~i~0_4) (= (+ v_correct_version_~b~0_4 v_correct_version_~a_2) v_correct_version_~b~0_3) (< v_correct_version_~b~0_4 v_correct_version_~n_3)) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~b~0=v_correct_version_~b~0_4, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~b~0=v_correct_version_~b~0_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] to Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] [2022-01-31 13:11:52,589 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 13:11:52,590 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_correct_version_~l~0_4 v_correct_version_~m_3) (= (+ v_correct_version_~l~0_4 v_correct_version_~a_3) v_correct_version_~l~0_3) (= (+ v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] to Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] [2022-01-31 13:11:52,647 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 13:11:52,648 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_student_version_~b~1_2 v_student_version_~n_1) (= (+ v_student_version_~i~1_2 1) v_student_version_~i~1_1) (= v_student_version_~b~1_1 (+ v_student_version_~a_1 v_student_version_~b~1_2))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] to Formula: (or (and (<= v_student_version_~n_1 v_student_version_~b~1_2) (= v_student_version_~b~1_2 v_student_version_~b~1_1) (= v_student_version_~i~1_2 v_student_version_~i~1_1)) (and (< v_student_version_~i~1_2 v_student_version_~i~1_1) (= (+ v_student_version_~b~1_2 (* (+ v_student_version_~i~1_1 (* (- 1) v_student_version_~i~1_2)) v_student_version_~a_1)) v_student_version_~b~1_1) (< v_student_version_~b~1_2 v_student_version_~n_1) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 v_student_version_~i~1_2 1) v_student_version_~i~1_1)) (< (+ v_student_version_~b~1_2 (* v_student_version_~a_1 v_it_3)) v_student_version_~n_1))))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] [2022-01-31 13:11:52,706 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 13:11:52,706 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_student_version_~j~1_2 1) v_student_version_~j~1_1) (< v_student_version_~l~1_3 v_student_version_~m_2) (= (+ v_student_version_~a_2 v_student_version_~l~1_3) v_student_version_~l~1_2)) InVars {student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~l~1=v_student_version_~l~1_3, student_version_~m=v_student_version_~m_2} OutVars{student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~l~1=v_student_version_~l~1_2, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] to Formula: (or (and (= v_student_version_~l~1_3 v_student_version_~l~1_2) (<= v_student_version_~m_2 v_student_version_~l~1_3) (= v_student_version_~j~1_2 v_student_version_~j~1_1)) (and (= (+ v_student_version_~l~1_3 (* (+ v_student_version_~j~1_1 (* (- 1) v_student_version_~j~1_2)) v_student_version_~a_2)) v_student_version_~l~1_2) (< v_student_version_~j~1_2 v_student_version_~j~1_1) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 v_student_version_~j~1_2 1) v_student_version_~j~1_1)) (not (<= 1 v_it_4)) (< (+ (* v_student_version_~a_2 v_it_4) v_student_version_~l~1_3) v_student_version_~m_2))) (< v_student_version_~l~1_3 v_student_version_~m_2))) InVars {student_version_~l~1=v_student_version_~l~1_3, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~m=v_student_version_~m_2} OutVars{student_version_~l~1=v_student_version_~l~1_2, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] [2022-01-31 13:11:52,799 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 13:11:52,799 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_correct_version_~x~0_3 v_correct_version_~i~0_3) (= (+ v_correct_version_~j~0_2 v_correct_version_~y~0_2) v_correct_version_~y~0_1) (= (+ v_correct_version_~x~0_3 1) v_correct_version_~x~0_2)) InVars {correct_version_~y~0=v_correct_version_~y~0_2, correct_version_~x~0=v_correct_version_~x~0_3, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} OutVars{correct_version_~y~0=v_correct_version_~y~0_1, correct_version_~x~0=v_correct_version_~x~0_2, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] to Formula: (or (and (< v_correct_version_~x~0_3 v_correct_version_~x~0_2) (= (+ (* v_correct_version_~j~0_2 v_correct_version_~x~0_2) v_correct_version_~y~0_2) (+ v_correct_version_~y~0_1 (* v_correct_version_~j~0_2 v_correct_version_~x~0_3))) (< v_correct_version_~x~0_2 (+ v_correct_version_~i~0_3 1))) (and (= v_correct_version_~y~0_2 v_correct_version_~y~0_1) (= v_correct_version_~x~0_3 v_correct_version_~x~0_2) (<= v_correct_version_~i~0_3 v_correct_version_~x~0_3))) InVars {correct_version_~y~0=v_correct_version_~y~0_2, correct_version_~x~0=v_correct_version_~x~0_3, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} OutVars{correct_version_~y~0=v_correct_version_~y~0_1, correct_version_~x~0=v_correct_version_~x~0_2, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] [2022-01-31 13:11:52,855 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 13:11:52,855 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_student_version_~x~1_3 (+ v_student_version_~x~1_4 1)) (= v_student_version_~y~1_2 (+ v_student_version_~j~1_4 v_student_version_~y~1_3)) (< v_student_version_~x~1_4 v_student_version_~i~1_5)) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] to Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] [2022-01-31 13:11:52,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 01:11:52 BasicIcfg [2022-01-31 13:11:52,859 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 13:11:52,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 13:11:52,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 13:11:52,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 13:11:52,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 01:11:51" (1/4) ... [2022-01-31 13:11:52,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7937cb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:11:52, skipping insertion in model container [2022-01-31 13:11:52,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:51" (2/4) ... [2022-01-31 13:11:52,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7937cb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:11:52, skipping insertion in model container [2022-01-31 13:11:52,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:11:52" (3/4) ... [2022-01-31 13:11:52,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7937cb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 01:11:52, skipping insertion in model container [2022-01-31 13:11:52,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 01:11:52" (4/4) ... [2022-01-31 13:11:52,866 INFO L111 eAbstractionObserver]: Analyzing ICFG theatreSquare.cJordan [2022-01-31 13:11:52,870 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 13:11:52,871 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 13:11:52,905 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 13:11:52,911 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 13:11:52,911 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 13:11:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 13:11:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 13:11:52,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:11:52,929 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:11:52,929 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:11:52,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:11:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1121522138, now seen corresponding path program 1 times [2022-01-31 13:11:52,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:11:52,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026764617] [2022-01-31 13:11:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:52,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:11:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:53,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 13:11:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 13:11:53,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:11:53,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026764617] [2022-01-31 13:11:53,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026764617] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 13:11:53,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 13:11:53,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 13:11:53,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604032468] [2022-01-31 13:11:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 13:11:53,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 13:11:53,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:11:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 13:11:53,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 13:11:53,206 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:11:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:11:53,411 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-01-31 13:11:53,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 13:11:53,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-01-31 13:11:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:11:53,423 INFO L225 Difference]: With dead ends: 47 [2022-01-31 13:11:53,423 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 13:11:53,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 13:11:53,429 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 13:11:53,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 61 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-01-31 13:11:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 13:11:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-31 13:11:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:11:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-01-31 13:11:53,462 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-01-31 13:11:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:11:53,462 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-01-31 13:11:53,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:11:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-01-31 13:11:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 13:11:53,463 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:11:53,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:11:53,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 13:11:53,464 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:11:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:11:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1342094697, now seen corresponding path program 1 times [2022-01-31 13:11:53,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:11:53,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348589968] [2022-01-31 13:11:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:53,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:11:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 13:11:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:53,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 13:11:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:53,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 13:11:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 13:11:53,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:11:53,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348589968] [2022-01-31 13:11:53,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348589968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 13:11:53,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 13:11:53,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 13:11:53,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840798975] [2022-01-31 13:11:53,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 13:11:53,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 13:11:53,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:11:53,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 13:11:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-01-31 13:11:53,698 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 13:11:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:11:54,039 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-01-31 13:11:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 13:11:54,041 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-01-31 13:11:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:11:54,044 INFO L225 Difference]: With dead ends: 48 [2022-01-31 13:11:54,044 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 13:11:54,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-01-31 13:11:54,045 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 13:11:54,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-01-31 13:11:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 13:11:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-01-31 13:11:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-31 13:11:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-01-31 13:11:54,055 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 31 [2022-01-31 13:11:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:11:54,056 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-01-31 13:11:54,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 13:11:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-01-31 13:11:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 13:11:54,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:11:54,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:11:54,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 13:11:54,058 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:11:54,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:11:54,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1260090278, now seen corresponding path program 1 times [2022-01-31 13:11:54,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:11:54,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388373050] [2022-01-31 13:11:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:54,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:11:54,073 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:11:54,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133356450] [2022-01-31 13:11:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:54,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:11:54,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:11:54,076 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-01-31 13:11:54,108 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-01-31 13:11:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:54,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 13:11:54,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:11:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 13:11:54,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 13:11:54,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:11:54,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388373050] [2022-01-31 13:11:54,290 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:11:54,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133356450] [2022-01-31 13:11:54,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133356450] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 13:11:54,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 13:11:54,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 13:11:54,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155698038] [2022-01-31 13:11:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 13:11:54,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 13:11:54,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:11:54,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 13:11:54,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 13:11:54,312 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:11:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:11:54,347 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-01-31 13:11:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 13:11:54,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-01-31 13:11:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:11:54,348 INFO L225 Difference]: With dead ends: 53 [2022-01-31 13:11:54,348 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 13:11:54,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-01-31 13:11:54,350 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:11:54,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-01-31 13:11:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 13:11:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-31 13:11:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-31 13:11:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-01-31 13:11:54,356 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 32 [2022-01-31 13:11:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:11:54,357 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-01-31 13:11:54,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:11:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-01-31 13:11:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 13:11:54,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:11:54,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:11:54,388 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-01-31 13:11:54,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:11:54,582 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:11:54,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:11:54,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1007047745, now seen corresponding path program 1 times [2022-01-31 13:11:54,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:11:54,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667883030] [2022-01-31 13:11:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:54,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:11:54,594 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:11:54,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301105831] [2022-01-31 13:11:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:54,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:11:54,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:11:54,596 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-01-31 13:11:54,627 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-01-31 13:11:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:54,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 13:11:54,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:11:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 13:11:54,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 13:11:54,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:11:54,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667883030] [2022-01-31 13:11:54,774 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:11:54,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301105831] [2022-01-31 13:11:54,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301105831] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 13:11:54,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 13:11:54,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 13:11:54,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279414903] [2022-01-31 13:11:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 13:11:54,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 13:11:54,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:11:54,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 13:11:54,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 13:11:54,776 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:11:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:11:54,798 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-01-31 13:11:54,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 13:11:54,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-01-31 13:11:54,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:11:54,802 INFO L225 Difference]: With dead ends: 53 [2022-01-31 13:11:54,802 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 13:11:54,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-01-31 13:11:54,805 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:11:54,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-01-31 13:11:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 13:11:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-01-31 13:11:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-31 13:11:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-01-31 13:11:54,821 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-01-31 13:11:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:11:54,822 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-01-31 13:11:54,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:11:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-01-31 13:11:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 13:11:54,823 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:11:54,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:11:54,847 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-01-31 13:11:55,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 13:11:55,024 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:11:55,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:11:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 111102768, now seen corresponding path program 1 times [2022-01-31 13:11:55,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:11:55,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360928532] [2022-01-31 13:11:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:55,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:11:55,035 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:11:55,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216065329] [2022-01-31 13:11:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:55,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:11:55,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:11:55,037 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-01-31 13:11:55,054 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-01-31 13:11:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:55,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 13:11:55,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:11:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 13:11:55,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 13:11:55,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:11:55,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360928532] [2022-01-31 13:11:55,166 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:11:55,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216065329] [2022-01-31 13:11:55,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216065329] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 13:11:55,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 13:11:55,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 13:11:55,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688971169] [2022-01-31 13:11:55,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 13:11:55,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 13:11:55,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:11:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 13:11:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 13:11:55,168 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 13:11:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:11:55,182 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-01-31 13:11:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 13:11:55,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-01-31 13:11:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:11:55,184 INFO L225 Difference]: With dead ends: 55 [2022-01-31 13:11:55,184 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 13:11:55,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-01-31 13:11:55,185 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:11:55,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-01-31 13:11:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 13:11:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-01-31 13:11:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-31 13:11:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-01-31 13:11:55,190 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 34 [2022-01-31 13:11:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:11:55,190 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-01-31 13:11:55,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 13:11:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-01-31 13:11:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 13:11:55,192 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:11:55,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:11:55,218 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-01-31 13:11:55,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:11:55,408 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:11:55,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:11:55,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1980049385, now seen corresponding path program 1 times [2022-01-31 13:11:55,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:11:55,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149087156] [2022-01-31 13:11:55,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:55,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:11:55,418 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:11:55,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82008240] [2022-01-31 13:11:55,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:55,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:11:55,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:11:55,420 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-01-31 13:11:55,429 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-01-31 13:11:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:55,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 13:11:55,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:11:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 13:11:55,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 13:11:55,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:11:55,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149087156] [2022-01-31 13:11:55,547 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:11:55,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82008240] [2022-01-31 13:11:55,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82008240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 13:11:55,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 13:11:55,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 13:11:55,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809624539] [2022-01-31 13:11:55,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 13:11:55,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 13:11:55,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:11:55,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 13:11:55,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 13:11:55,549 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 13:11:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:11:55,563 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-01-31 13:11:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 13:11:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-01-31 13:11:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:11:55,564 INFO L225 Difference]: With dead ends: 55 [2022-01-31 13:11:55,564 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 13:11:55,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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-01-31 13:11:55,565 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:11:55,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-01-31 13:11:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 13:11:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-31 13:11:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-31 13:11:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-01-31 13:11:55,570 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 35 [2022-01-31 13:11:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:11:55,570 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-01-31 13:11:55,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 13:11:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-01-31 13:11:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 13:11:55,571 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:11:55,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:11:55,599 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-01-31 13:11:55,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:11:55,796 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:11:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:11:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1173604042, now seen corresponding path program 1 times [2022-01-31 13:11:55,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:11:55,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012833364] [2022-01-31 13:11:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:55,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:11:55,811 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:11:55,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501857384] [2022-01-31 13:11:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:55,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:11:55,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:11:55,816 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-01-31 13:11:55,819 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-01-31 13:11:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:55,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 13:11:55,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:11:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 13:11:58,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:11:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 13:11:58,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:11:58,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012833364] [2022-01-31 13:11:58,445 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:11:58,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501857384] [2022-01-31 13:11:58,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501857384] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 13:11:58,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 13:11:58,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-01-31 13:11:58,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631284337] [2022-01-31 13:11:58,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 13:11:58,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 13:11:58,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:11:58,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 13:11:58,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 13:11:58,447 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:11:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:11:58,484 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-01-31 13:11:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 13:11:58,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-01-31 13:11:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:11:58,486 INFO L225 Difference]: With dead ends: 44 [2022-01-31 13:11:58,486 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 13:11:58,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-31 13:11:58,488 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:11:58,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 154 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-01-31 13:11:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 13:11:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-01-31 13:11:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:11:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-01-31 13:11:58,504 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2022-01-31 13:11:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:11:58,505 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-01-31 13:11:58,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:11:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-01-31 13:11:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 13:11:58,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:11:58,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:11:58,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 13:11:58,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:11:58,728 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:11:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:11:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1887612187, now seen corresponding path program 1 times [2022-01-31 13:11:58,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:11:58,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330003453] [2022-01-31 13:11:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:58,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:11:58,737 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:11:58,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593173086] [2022-01-31 13:11:58,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:11:58,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:11:58,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:11:58,743 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-01-31 13:11:58,745 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-01-31 13:11:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:11:58,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 13:11:58,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:12:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 13:12:04,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:12:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 13:12:05,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:12:05,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330003453] [2022-01-31 13:12:05,526 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:12:05,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593173086] [2022-01-31 13:12:05,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593173086] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 13:12:05,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 13:12:05,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-01-31 13:12:05,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130323568] [2022-01-31 13:12:05,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 13:12:05,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 13:12:05,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:12:05,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 13:12:05,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 13:12:05,528 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 13:12:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:12:05,564 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-01-31 13:12:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 13:12:05,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-01-31 13:12:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:12:05,565 INFO L225 Difference]: With dead ends: 41 [2022-01-31 13:12:05,565 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 13:12:05,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-31 13:12:05,566 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:12:05,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 3 Unchecked, 0.0s Time] [2022-01-31 13:12:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 13:12:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-31 13:12:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:12:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-01-31 13:12:05,569 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 36 [2022-01-31 13:12:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:12:05,569 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-01-31 13:12:05,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 13:12:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-01-31 13:12:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 13:12:05,570 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:12:05,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:12:05,593 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-01-31 13:12:05,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:12:05,788 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:12:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:12:05,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1698211422, now seen corresponding path program 1 times [2022-01-31 13:12:05,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:12:05,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029737268] [2022-01-31 13:12:05,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:12:05,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:12:05,806 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:12:05,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180022814] [2022-01-31 13:12:05,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:12:05,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:12:05,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:12:05,815 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-01-31 13:12:05,816 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-01-31 13:12:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:12:06,297 WARN L261 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-31 13:12:06,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:12:07,492 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:12:08,000 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:12:08,304 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:12:30,751 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:12:31,207 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:13:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 13:13:44,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:13:47,965 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:13:49,708 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:13:57,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:13:57,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029737268] [2022-01-31 13:13:57,952 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:13:57,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180022814] [2022-01-31 13:13:57,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180022814] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:13:57,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 13:13:57,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-01-31 13:13:57,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293114300] [2022-01-31 13:13:57,953 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 13:13:57,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 13:13:57,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:13:57,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 13:13:57,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=789, Unknown=18, NotChecked=0, Total=870 [2022-01-31 13:13:57,954 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:13:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:13:58,289 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-01-31 13:13:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 13:13:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-01-31 13:13:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:13:58,290 INFO L225 Difference]: With dead ends: 62 [2022-01-31 13:13:58,290 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 13:13:58,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 74.5s TimeCoverageRelationStatistics Valid=67, Invalid=845, Unknown=18, NotChecked=0, Total=930 [2022-01-31 13:13:58,291 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:13:58,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 418 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 96 Unchecked, 0.0s Time] [2022-01-31 13:13:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 13:13:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-01-31 13:13:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-31 13:13:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2022-01-31 13:13:58,295 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 37 [2022-01-31 13:13:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:13:58,295 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2022-01-31 13:13:58,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:13:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-01-31 13:13:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 13:13:58,297 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:13:58,297 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:13:58,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-31 13:13:58,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:13:58,508 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:13:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:13:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1189593605, now seen corresponding path program 2 times [2022-01-31 13:13:58,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:13:58,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442230775] [2022-01-31 13:13:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:13:58,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:13:58,520 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:13:58,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2021454654] [2022-01-31 13:13:58,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 13:13:58,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:13:58,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:13:58,525 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-01-31 13:13:58,526 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-01-31 13:13:59,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 13:13:59,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 13:13:59,149 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-01-31 13:13:59,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:14:00,394 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:14:00,882 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:14:01,207 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:14:26,084 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:14:26,361 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:14:27,113 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:14:27,209 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:14:50,186 WARN L838 $PredicateComparison]: unable to prove that (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (let ((.cse0 (div c_main_~n_stones1~0 correct_version_~j~0)) (.cse1 (div c_main_~n_stones2~0 student_version_~j~1))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (= (mod c_main_~n_stones2~0 student_version_~j~1) 0) (<= 1 main_~n~0) (<= correct_version_~i~0 .cse0) (not (< .cse1 student_version_~i~1)) (= (mod c_main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< .cse0 (+ correct_version_~i~0 1)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1) (< .cse1 (+ student_version_~i~1 1)) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))) is different from false [2022-01-31 13:14:52,231 WARN L860 $PredicateComparison]: unable to prove that (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (let ((.cse0 (div c_main_~n_stones1~0 correct_version_~j~0)) (.cse1 (div c_main_~n_stones2~0 student_version_~j~1))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (= (mod c_main_~n_stones2~0 student_version_~j~1) 0) (<= 1 main_~n~0) (<= correct_version_~i~0 .cse0) (not (< .cse1 student_version_~i~1)) (= (mod c_main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< .cse0 (+ correct_version_~i~0 1)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1) (< .cse1 (+ student_version_~i~1 1)) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))) is different from true [2022-01-31 13:14:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 13:14:54,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:15:02,270 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:15:02,795 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:15:06,281 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:15:09,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:15:09,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442230775] [2022-01-31 13:15:09,874 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:15:09,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021454654] [2022-01-31 13:15:09,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021454654] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:15:09,874 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 13:15:09,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-01-31 13:15:09,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245393591] [2022-01-31 13:15:09,874 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 13:15:09,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 13:15:09,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:15:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 13:15:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=804, Unknown=5, NotChecked=56, Total=930 [2022-01-31 13:15:09,876 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:15:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:15:10,116 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-01-31 13:15:10,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 13:15:10,117 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2022-01-31 13:15:10,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:15:10,118 INFO L225 Difference]: With dead ends: 66 [2022-01-31 13:15:10,118 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 13:15:10,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=69, Invalid=860, Unknown=5, NotChecked=58, Total=992 [2022-01-31 13:15:10,119 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:15:10,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 462 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 175 Unchecked, 0.0s Time] [2022-01-31 13:15:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 13:15:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2022-01-31 13:15:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 49 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-31 13:15:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-01-31 13:15:10,125 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 38 [2022-01-31 13:15:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:15:10,127 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-01-31 13:15:10,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:15:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-01-31 13:15:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 13:15:10,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:15:10,130 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:15:10,141 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-01-31 13:15:10,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 13:15:10,338 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:15:10,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:15:10,338 INFO L85 PathProgramCache]: Analyzing trace with hash 764427933, now seen corresponding path program 3 times [2022-01-31 13:15:10,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:15:10,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936189730] [2022-01-31 13:15:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:15:10,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:15:10,348 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:15:10,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214246433] [2022-01-31 13:15:10,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 13:15:10,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:15:10,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:15:10,352 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-01-31 13:15:10,352 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-01-31 13:15:11,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-31 13:15:11,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 13:15:11,825 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-01-31 13:15:11,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:15:13,079 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:15:13,538 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:15:13,883 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:15:39,444 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:15:40,274 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:15:42,363 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:16:45,006 WARN L838 $PredicateComparison]: unable to prove that (exists ((main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int)) (and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (exists ((v_student_version_~j~1_26 Int)) (and (let ((.cse0 (* main_~a~0 v_student_version_~j~1_26))) (or (and (not (< (* main_~a~0 student_version_~j~1) main_~m~0)) (forall ((v_it_4 Int)) (or (< (+ (* v_it_4 main_~a~0) (* main_~a~0 v_student_version_~j~1_26)) main_~m~0) (not (<= (+ v_it_4 v_student_version_~j~1_26 1) student_version_~j~1)))) (< .cse0 main_~m~0)) (and (<= main_~m~0 .cse0) (= student_version_~j~1 v_student_version_~j~1_26)))) (< 0 v_student_version_~j~1_26) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) v_student_version_~j~1_26)) (< (* v_it_4 main_~a~0) main_~m~0))))) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (let ((.cse1 (= student_version_~j~1 0))) (or (and (= |c_main_#t~ret9| 0) .cse1) (let ((.cse2 (div |c_main_#t~ret9| student_version_~j~1))) (and (< .cse2 (+ student_version_~i~1 1)) (not .cse1) (= (mod |c_main_#t~ret9| student_version_~j~1) 0) (not (< .cse2 student_version_~i~1)))))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< 0 student_version_~i~1))) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (let ((.cse3 (div c_main_~n_stones1~0 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= correct_version_~i~0 .cse3) (= (mod c_main_~n_stones1~0 correct_version_~j~0) 0) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (< .cse3 (+ correct_version_~i~0 1)) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))))) is different from false [2022-01-31 13:16:57,101 WARN L860 $PredicateComparison]: unable to prove that (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (let ((.cse0 (div c_main_~n_stones1~0 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~0) (<= correct_version_~i~0 .cse0) (exists ((v_student_version_~j~1_26 Int)) (and (let ((.cse1 (* main_~a~0 v_student_version_~j~1_26))) (or (and (not (< (* main_~a~0 student_version_~j~1) main_~m~0)) (forall ((v_it_4 Int)) (or (< (+ (* v_it_4 main_~a~0) (* main_~a~0 v_student_version_~j~1_26)) main_~m~0) (not (<= (+ v_it_4 v_student_version_~j~1_26 1) student_version_~j~1)))) (< .cse1 main_~m~0)) (and (<= main_~m~0 .cse1) (= student_version_~j~1 v_student_version_~j~1_26)))) (< 0 v_student_version_~j~1_26) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) v_student_version_~j~1_26)) (< (* v_it_4 main_~a~0) main_~m~0))))) (= (mod c_main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (let ((.cse3 (= student_version_~j~1 0))) (or (let ((.cse2 (div c_main_~n_stones2~0 student_version_~j~1))) (and (= (mod c_main_~n_stones2~0 student_version_~j~1) 0) (not (< .cse2 student_version_~i~1)) (not .cse3) (< .cse2 (+ student_version_~i~1 1)))) (and (= c_main_~n_stones2~0 0) .cse3))) (< .cse0 (+ correct_version_~i~0 1)) (< 0 student_version_~i~1) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))) is different from true [2022-01-31 13:19:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 13:19:21,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:20:19,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:20:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936189730] [2022-01-31 13:20:19,809 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:20:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214246433] [2022-01-31 13:20:19,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214246433] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:20:19,809 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 13:20:19,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-01-31 13:20:19,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643899719] [2022-01-31 13:20:19,810 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 13:20:19,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 13:20:19,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:20:19,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 13:20:19,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=835, Unknown=35, NotChecked=118, Total=1056 [2022-01-31 13:20:19,811 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:20:26,059 WARN L228 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:20:32,966 WARN L228 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:20:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:20:32,969 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-01-31 13:20:32,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 13:20:32,970 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2022-01-31 13:20:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:20:32,971 INFO L225 Difference]: With dead ends: 70 [2022-01-31 13:20:32,971 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 13:20:32,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 116.9s TimeCoverageRelationStatistics Valid=78, Invalid=951, Unknown=35, NotChecked=126, Total=1190 [2022-01-31 13:20:32,972 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:20:32,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 480 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 239 Unchecked, 0.0s Time] [2022-01-31 13:20:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 13:20:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-01-31 13:20:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.28) internal successors, (64), 52 states have internal predecessors, (64), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-31 13:20:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-01-31 13:20:32,977 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 38 [2022-01-31 13:20:32,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:20:32,977 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2022-01-31 13:20:32,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:20:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-01-31 13:20:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 13:20:32,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:20:32,978 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:20:32,991 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-01-31 13:20:33,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:20:33,187 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:20:33,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:20:33,187 INFO L85 PathProgramCache]: Analyzing trace with hash 504805571, now seen corresponding path program 4 times [2022-01-31 13:20:33,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:20:33,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299032488] [2022-01-31 13:20:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:20:33,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:20:33,194 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:20:33,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126330306] [2022-01-31 13:20:33,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 13:20:33,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:20:33,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:20:33,195 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-01-31 13:20:33,199 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-01-31 13:20:41,037 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 13:20:41,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 13:20:41,042 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-31 13:20:41,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:20:43,858 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:20:44,759 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:20:45,237 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:21:29,743 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:21:30,944 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:10,199 WARN L860 $PredicateComparison]: unable to prove that (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (let ((.cse0 (div c_main_~n_stones1~0 correct_version_~j~0)) (.cse1 (div c_main_~n_stones2~0 student_version_~j~1))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (= (mod c_main_~n_stones2~0 student_version_~j~1) 0) (<= 1 main_~n~0) (<= correct_version_~i~0 .cse0) (not (< .cse1 student_version_~i~1)) (= (mod c_main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< .cse0 (+ correct_version_~i~0 1)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1) (< .cse1 (+ student_version_~i~1 1)) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))) is different from true [2022-01-31 13:22:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 13:22:16,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:22:24,560 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:25,760 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:29,263 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:33,069 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:33,912 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:37,078 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:44,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:22:44,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299032488] [2022-01-31 13:22:44,172 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:22:44,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126330306] [2022-01-31 13:22:44,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126330306] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:22:44,172 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 13:22:44,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-01-31 13:22:44,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548192214] [2022-01-31 13:22:44,172 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 13:22:44,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 13:22:44,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:22:44,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 13:22:44,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=860, Unknown=8, NotChecked=58, Total=992 [2022-01-31 13:22:44,173 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 29 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:22:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:22:45,924 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-01-31 13:22:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 13:22:45,924 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2022-01-31 13:22:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:22:45,925 INFO L225 Difference]: With dead ends: 75 [2022-01-31 13:22:45,925 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 13:22:45,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=82, Invalid=1104, Unknown=8, NotChecked=66, Total=1260 [2022-01-31 13:22:45,926 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 13:22:45,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 553 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 243 Unchecked, 0.1s Time] [2022-01-31 13:22:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 13:22:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-01-31 13:22:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-31 13:22:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2022-01-31 13:22:45,930 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 38 [2022-01-31 13:22:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:22:45,931 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2022-01-31 13:22:45,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:22:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-01-31 13:22:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 13:22:45,931 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:22:45,931 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:22:45,942 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-01-31 13:22:46,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 13:22:46,136 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:22:46,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:22:46,136 INFO L85 PathProgramCache]: Analyzing trace with hash -781171018, now seen corresponding path program 5 times [2022-01-31 13:22:46,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:22:46,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043935152] [2022-01-31 13:22:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:22:46,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:22:46,147 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:22:46,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028379166] [2022-01-31 13:22:46,147 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 13:22:46,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:22:46,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:22:46,149 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 13:22:46,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 13:22:47,390 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 13:22:47,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 13:22:47,392 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-31 13:22:47,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:22:51,119 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:52,032 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:53,376 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:53,642 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:22:54,441 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:23:27,967 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:23:29,064 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:24:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 13:24:59,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:25:20,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:25:20,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043935152] [2022-01-31 13:25:20,460 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 13:25:20,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028379166] [2022-01-31 13:25:20,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028379166] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:25:20,461 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 13:25:20,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-01-31 13:25:20,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004763506] [2022-01-31 13:25:20,461 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 13:25:20,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 13:25:20,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:25:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 13:25:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=853, Unknown=13, NotChecked=0, Total=930 [2022-01-31 13:25:20,462 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:25:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:25:24,832 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-01-31 13:25:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 13:25:24,832 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2022-01-31 13:25:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:25:24,833 INFO L225 Difference]: With dead ends: 77 [2022-01-31 13:25:24,833 INFO L226 Difference]: Without dead ends: 73 [2022-01-31 13:25:24,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 54.3s TimeCoverageRelationStatistics Valid=68, Invalid=909, Unknown=15, NotChecked=0, Total=992 [2022-01-31 13:25:24,834 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:25:24,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 574 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 101 Unchecked, 0.0s Time] [2022-01-31 13:25:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-31 13:25:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-01-31 13:25:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 62 states have internal predecessors, (74), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-31 13:25:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2022-01-31 13:25:24,838 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 38 [2022-01-31 13:25:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:25:24,838 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2022-01-31 13:25:24,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 13:25:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2022-01-31 13:25:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 13:25:24,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:25:24,839 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:25:24,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 13:25:25,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 13:25:25,048 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:25:25,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:25:25,048 INFO L85 PathProgramCache]: Analyzing trace with hash -910305133, now seen corresponding path program 6 times [2022-01-31 13:25:25,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:25:25,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274118728] [2022-01-31 13:25:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:25:25,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:25:25,055 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 13:25:25,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775667154] [2022-01-31 13:25:25,055 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 13:25:25,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:25:25,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:25:25,058 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 13:25:25,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 13:25:25,905 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-31 13:25:25,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 13:25:25,908 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-31 13:25:25,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:25:41,377 WARN L228 SmtUtils]: Spent 12.47s on a formula simplification. DAG size of input: 57 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:25:48,170 WARN L228 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:25:48,249 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 13:25:49,818 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful