/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-7968f31 [2022-03-17 15:43:23,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 15:43:23,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 15:43:23,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 15:43:23,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 15:43:23,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 15:43:23,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 15:43:23,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 15:43:23,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 15:43:23,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 15:43:23,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 15:43:23,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 15:43:23,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 15:43:23,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 15:43:23,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 15:43:23,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 15:43:23,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 15:43:23,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 15:43:23,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 15:43:23,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 15:43:23,695 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 15:43:23,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 15:43:23,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 15:43:23,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 15:43:23,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 15:43:23,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 15:43:23,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 15:43:23,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 15:43:23,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 15:43:23,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 15:43:23,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 15:43:23,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 15:43:23,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 15:43:23,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 15:43:23,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 15:43:23,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 15:43:23,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 15:43:23,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 15:43:23,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 15:43:23,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 15:43:23,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 15:43:23,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 15:43:23,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 15:43:23,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 15:43:23,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 15:43:23,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 15:43:23,732 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 15:43:23,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 15:43:23,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 15:43:23,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 15:43:23,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 15:43:23,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 15:43:23,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 15:43:23,734 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 15:43:23,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 15:43:23,734 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 15:43:23,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 15:43:23,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 15:43:23,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 15:43:23,734 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 15:43:23,734 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 15:43:23,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:43:23,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 15:43:23,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 15:43:23,736 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 15:43:23,736 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-03-17 15:43:23,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 15:43:23,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 15:43:23,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 15:43:23,928 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 15:43:23,929 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 15:43:23,930 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-03-17 15:43:23,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a97535b/bb07124a464b4a3e960cee86b172ed71/FLAGb0703c9c1 [2022-03-17 15:43:24,304 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 15:43:24,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-03-17 15:43:24,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a97535b/bb07124a464b4a3e960cee86b172ed71/FLAGb0703c9c1 [2022-03-17 15:43:24,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a97535b/bb07124a464b4a3e960cee86b172ed71 [2022-03-17 15:43:24,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 15:43:24,320 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 15:43:24,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 15:43:24,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 15:43:24,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 15:43:24,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:24,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ddce782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24, skipping insertion in model container [2022-03-17 15:43:24,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:24,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 15:43:24,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 15:43:24,485 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-03-17 15:43:24,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:43:24,521 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 15:43:24,533 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-03-17 15:43:24,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:43:24,561 INFO L208 MainTranslator]: Completed translation [2022-03-17 15:43:24,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24 WrapperNode [2022-03-17 15:43:24,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 15:43:24,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 15:43:24,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 15:43:24,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 15:43:24,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:24,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:24,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:24,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:24,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:24,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:24,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:24,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 15:43:24,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 15:43:24,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 15:43:24,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 15:43:24,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:24,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:43:24,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:43:24,626 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-03-17 15:43:24,644 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-03-17 15:43:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 15:43:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 15:43:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 15:43:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 15:43:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-03-17 15:43:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-03-17 15:43:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 15:43:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 15:43:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 15:43:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 15:43:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 15:43:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-17 15:43:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 15:43:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-03-17 15:43:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-03-17 15:43:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 15:43:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 15:43:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 15:43:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 15:43:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 15:43:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 15:43:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 15:43:24,734 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 15:43:24,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 15:43:24,847 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 15:43:24,851 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 15:43:24,851 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-17 15:43:24,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:43:24 BoogieIcfgContainer [2022-03-17 15:43:24,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 15:43:24,853 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 15:43:24,853 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 15:43:24,854 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 15:43:24,856 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:43:24" (1/1) ... [2022-03-17 15:43:25,026 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:43:25,026 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-03-17 15:43:25,117 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:43:25,117 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-03-17 15:43:25,167 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:43:25,168 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-03-17 15:43:25,210 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:43:25,210 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-03-17 15:43:25,287 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-03-17 15:43:25,287 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-03-17 15:43:25,337 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-03-17 15:43:25,337 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-03-17 15:43:25,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:43:25 BasicIcfg [2022-03-17 15:43:25,340 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 15:43:25,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 15:43:25,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 15:43:25,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 15:43:25,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:43:24" (1/4) ... [2022-03-17 15:43:25,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f65bbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:43:25, skipping insertion in model container [2022-03-17 15:43:25,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:24" (2/4) ... [2022-03-17 15:43:25,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f65bbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:43:25, skipping insertion in model container [2022-03-17 15:43:25,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:43:24" (3/4) ... [2022-03-17 15:43:25,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f65bbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:43:25, skipping insertion in model container [2022-03-17 15:43:25,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:43:25" (4/4) ... [2022-03-17 15:43:25,346 INFO L111 eAbstractionObserver]: Analyzing ICFG theatreSquare.cJordan [2022-03-17 15:43:25,349 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 15:43:25,349 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 15:43:25,375 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 15:43:25,380 INFO L340 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 [2022-03-17 15:43:25,380 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 15:43:25,389 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-03-17 15:43:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-17 15:43:25,393 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:43:25,394 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:43:25,394 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:43:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:43:25,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1121522138, now seen corresponding path program 1 times [2022-03-17 15:43:25,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:43:25,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442793747] [2022-03-17 15:43:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:43:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:25,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:43:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:43:25,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:43:25,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442793747] [2022-03-17 15:43:25,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442793747] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:43:25,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:43:25,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 15:43:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22068023] [2022-03-17 15:43:25,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:43:25,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 15:43:25,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:43:25,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 15:43:25,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 15:43:25,630 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-03-17 15:43:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:43:25,781 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-03-17 15:43:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 15:43:25,784 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-03-17 15:43:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:43:25,789 INFO L225 Difference]: With dead ends: 47 [2022-03-17 15:43:25,789 INFO L226 Difference]: Without dead ends: 32 [2022-03-17 15:43:25,791 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-17 15:43:25,794 INFO L912 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-03-17 15:43:25,795 INFO L913 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-03-17 15:43:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-17 15:43:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-17 15:43:25,819 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-03-17 15:43:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-03-17 15:43:25,821 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-03-17 15:43:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:43:25,822 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-03-17 15:43:25,822 INFO L479 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-03-17 15:43:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-03-17 15:43:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-17 15:43:25,823 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:43:25,823 INFO L500 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-03-17 15:43:25,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 15:43:25,824 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:43:25,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:43:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1342094697, now seen corresponding path program 1 times [2022-03-17 15:43:25,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:43:25,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958410007] [2022-03-17 15:43:25,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:43:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:25,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:43:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:25,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-17 15:43:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 15:43:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:43:26,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:43:26,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958410007] [2022-03-17 15:43:26,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958410007] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:43:26,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:43:26,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-17 15:43:26,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752515688] [2022-03-17 15:43:26,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:43:26,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-17 15:43:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:43:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-17 15:43:26,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-03-17 15:43:26,060 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-03-17 15:43:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:43:26,338 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-03-17 15:43:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-17 15:43:26,343 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-03-17 15:43:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:43:26,346 INFO L225 Difference]: With dead ends: 48 [2022-03-17 15:43:26,346 INFO L226 Difference]: Without dead ends: 44 [2022-03-17 15:43:26,346 INFO L911 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-03-17 15:43:26,347 INFO L912 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.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:43:26,349 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-03-17 15:43:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-17 15:43:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-03-17 15:43:26,359 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-03-17 15:43:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-03-17 15:43:26,360 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 31 [2022-03-17 15:43:26,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:43:26,360 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-03-17 15:43:26,360 INFO L479 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-03-17 15:43:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-03-17 15:43:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-17 15:43:26,361 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:43:26,361 INFO L500 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-03-17 15:43:26,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 15:43:26,362 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:43:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:43:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1260090278, now seen corresponding path program 1 times [2022-03-17 15:43:26,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:43:26,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584689929] [2022-03-17 15:43:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:26,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:43:26,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:43:26,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927193549] [2022-03-17 15:43:26,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:26,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:43:26,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:43:26,373 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-03-17 15:43:26,374 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-03-17 15:43:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:26,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-17 15:43:26,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:43:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:43:26,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:43:26,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:43:26,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584689929] [2022-03-17 15:43:26,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 15:43:26,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927193549] [2022-03-17 15:43:26,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927193549] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:43:26,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:43:26,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 15:43:26,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843848078] [2022-03-17 15:43:26,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:43:26,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 15:43:26,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:43:26,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 15:43:26,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 15:43:26,476 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-03-17 15:43:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:43:26,493 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-03-17 15:43:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 15:43:26,493 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-03-17 15:43:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:43:26,495 INFO L225 Difference]: With dead ends: 53 [2022-03-17 15:43:26,495 INFO L226 Difference]: Without dead ends: 43 [2022-03-17 15:43:26,496 INFO L911 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-03-17 15:43:26,498 INFO L912 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-03-17 15:43:26,498 INFO L913 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-03-17 15:43:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-17 15:43:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-03-17 15:43:26,503 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-03-17 15:43:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-03-17 15:43:26,507 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 32 [2022-03-17 15:43:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:43:26,507 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-03-17 15:43:26,507 INFO L479 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-03-17 15:43:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-03-17 15:43:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-17 15:43:26,509 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:43:26,509 INFO L500 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-03-17 15:43:26,528 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-03-17 15:43:26,719 WARN L460 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-03-17 15:43:26,720 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:43:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:43:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1007047745, now seen corresponding path program 1 times [2022-03-17 15:43:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:43:26,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518967047] [2022-03-17 15:43:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:43:26,727 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:43:26,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098420481] [2022-03-17 15:43:26,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:26,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:43:26,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:43:26,729 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-03-17 15:43:26,730 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-03-17 15:43:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:26,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-17 15:43:26,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:43:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:43:26,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:43:26,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:43:26,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518967047] [2022-03-17 15:43:26,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 15:43:26,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098420481] [2022-03-17 15:43:26,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098420481] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:43:26,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:43:26,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 15:43:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730513] [2022-03-17 15:43:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:43:26,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 15:43:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:43:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 15:43:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 15:43:26,843 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-03-17 15:43:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:43:26,857 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-03-17 15:43:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 15:43:26,858 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-03-17 15:43:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:43:26,859 INFO L225 Difference]: With dead ends: 53 [2022-03-17 15:43:26,859 INFO L226 Difference]: Without dead ends: 44 [2022-03-17 15:43:26,859 INFO L911 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-03-17 15:43:26,860 INFO L912 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-03-17 15:43:26,861 INFO L913 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-03-17 15:43:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-17 15:43:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-03-17 15:43:26,873 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-03-17 15:43:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-03-17 15:43:26,875 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-03-17 15:43:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:43:26,877 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-03-17 15:43:26,878 INFO L479 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-03-17 15:43:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-03-17 15:43:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-17 15:43:26,880 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:43:26,881 INFO L500 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-03-17 15:43:26,901 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-03-17 15:43:27,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-17 15:43:27,096 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:43:27,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:43:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash 111102768, now seen corresponding path program 1 times [2022-03-17 15:43:27,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:43:27,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435915364] [2022-03-17 15:43:27,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:27,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:43:27,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:43:27,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485361408] [2022-03-17 15:43:27,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:27,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:43:27,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:43:27,105 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-03-17 15:43:27,106 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-03-17 15:43:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:27,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-17 15:43:27,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:43:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 15:43:27,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:43:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:43:27,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435915364] [2022-03-17 15:43:27,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 15:43:27,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485361408] [2022-03-17 15:43:27,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485361408] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:43:27,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:43:27,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 15:43:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357934441] [2022-03-17 15:43:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:43:27,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 15:43:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:43:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 15:43:27,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 15:43:27,205 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-03-17 15:43:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:43:27,217 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-03-17 15:43:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 15:43:27,218 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-03-17 15:43:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:43:27,219 INFO L225 Difference]: With dead ends: 55 [2022-03-17 15:43:27,219 INFO L226 Difference]: Without dead ends: 45 [2022-03-17 15:43:27,219 INFO L911 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-03-17 15:43:27,219 INFO L912 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-03-17 15:43:27,220 INFO L913 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-03-17 15:43:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-17 15:43:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-03-17 15:43:27,222 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-03-17 15:43:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-03-17 15:43:27,223 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 34 [2022-03-17 15:43:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:43:27,223 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-03-17 15:43:27,223 INFO L479 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-03-17 15:43:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-03-17 15:43:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-17 15:43:27,223 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:43:27,224 INFO L500 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-03-17 15:43:27,242 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-03-17 15:43:27,439 WARN L460 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-03-17 15:43:27,440 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:43:27,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:43:27,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1980049385, now seen corresponding path program 1 times [2022-03-17 15:43:27,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:43:27,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052182510] [2022-03-17 15:43:27,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:27,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:43:27,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:43:27,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919900604] [2022-03-17 15:43:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:27,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:43:27,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:43:27,452 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-03-17 15:43:27,453 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-03-17 15:43:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:27,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-17 15:43:27,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:43:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-17 15:43:27,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:43:27,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:43:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052182510] [2022-03-17 15:43:27,562 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 15:43:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919900604] [2022-03-17 15:43:27,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919900604] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:43:27,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:43:27,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 15:43:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863509058] [2022-03-17 15:43:27,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:43:27,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 15:43:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:43:27,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 15:43:27,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 15:43:27,563 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-03-17 15:43:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:43:27,577 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-03-17 15:43:27,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 15:43:27,578 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-03-17 15:43:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:43:27,581 INFO L225 Difference]: With dead ends: 55 [2022-03-17 15:43:27,581 INFO L226 Difference]: Without dead ends: 46 [2022-03-17 15:43:27,581 INFO L911 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-03-17 15:43:27,582 INFO L912 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-03-17 15:43:27,583 INFO L913 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-03-17 15:43:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-17 15:43:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-03-17 15:43:27,589 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-03-17 15:43:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-03-17 15:43:27,590 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 35 [2022-03-17 15:43:27,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:43:27,590 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-03-17 15:43:27,590 INFO L479 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-03-17 15:43:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-03-17 15:43:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-17 15:43:27,592 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:43:27,593 INFO L500 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-03-17 15:43:27,621 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-03-17 15:43:27,807 WARN L460 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-03-17 15:43:27,807 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:43:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:43:27,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1173604042, now seen corresponding path program 1 times [2022-03-17 15:43:27,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:43:27,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051280678] [2022-03-17 15:43:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:27,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:43:27,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:43:27,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [337330355] [2022-03-17 15:43:27,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:27,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:43:27,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:43:27,818 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-03-17 15:43:27,818 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-03-17 15:43:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:27,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 15:43:27,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:43:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-17 15:43:29,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:43:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-17 15:43:29,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:43:29,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051280678] [2022-03-17 15:43:29,971 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 15:43:29,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337330355] [2022-03-17 15:43:29,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337330355] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 15:43:29,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:43:29,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-03-17 15:43:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393515727] [2022-03-17 15:43:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:43:29,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:43:29,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:43:29,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:43:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-17 15:43:29,975 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-03-17 15:43:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:43:29,999 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-03-17 15:43:29,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 15:43:30,000 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-03-17 15:43:30,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:43:30,000 INFO L225 Difference]: With dead ends: 44 [2022-03-17 15:43:30,000 INFO L226 Difference]: Without dead ends: 41 [2022-03-17 15:43:30,000 INFO L911 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-03-17 15:43:30,001 INFO L912 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-03-17 15:43:30,001 INFO L913 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-03-17 15:43:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-17 15:43:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-03-17 15:43:30,003 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-03-17 15:43:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-03-17 15:43:30,003 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2022-03-17 15:43:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:43:30,003 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-03-17 15:43:30,003 INFO L479 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-03-17 15:43:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-03-17 15:43:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-17 15:43:30,004 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:43:30,004 INFO L500 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-03-17 15:43:30,023 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-03-17 15:43:30,219 WARN L460 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-03-17 15:43:30,219 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:43:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:43:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1887612187, now seen corresponding path program 1 times [2022-03-17 15:43:30,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:43:30,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638013476] [2022-03-17 15:43:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:43:30,226 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:43:30,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101091508] [2022-03-17 15:43:30,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:30,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:43:30,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:43:30,228 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-03-17 15:43:30,229 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-03-17 15:43:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:30,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 15:43:30,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:43:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-17 15:43:35,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:43:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-17 15:43:36,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:43:36,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638013476] [2022-03-17 15:43:36,326 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 15:43:36,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101091508] [2022-03-17 15:43:36,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101091508] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 15:43:36,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:43:36,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-03-17 15:43:36,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218846016] [2022-03-17 15:43:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:43:36,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:43:36,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:43:36,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:43:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-17 15:43:36,328 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-03-17 15:43:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:43:36,368 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-03-17 15:43:36,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 15:43:36,370 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-03-17 15:43:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:43:36,370 INFO L225 Difference]: With dead ends: 41 [2022-03-17 15:43:36,371 INFO L226 Difference]: Without dead ends: 38 [2022-03-17 15:43:36,371 INFO L911 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-03-17 15:43:36,371 INFO L912 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-03-17 15:43:36,371 INFO L913 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-03-17 15:43:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-03-17 15:43:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-03-17 15:43:36,373 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-03-17 15:43:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-03-17 15:43:36,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 36 [2022-03-17 15:43:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:43:36,373 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-03-17 15:43:36,373 INFO L479 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-03-17 15:43:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-03-17 15:43:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-17 15:43:36,374 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:43:36,374 INFO L500 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-03-17 15:43:36,392 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-03-17 15:43:36,579 WARN L460 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-03-17 15:43:36,580 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:43:36,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:43:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1698211422, now seen corresponding path program 1 times [2022-03-17 15:43:36,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:43:36,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881813500] [2022-03-17 15:43:36,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:36,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:43:36,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:43:36,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736659961] [2022-03-17 15:43:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:43:36,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:43:36,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:43:36,601 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-03-17 15:43:36,602 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-03-17 15:43:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:43:37,075 WARN L261 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-17 15:43:37,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:43:38,161 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:43:38,551 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:43:38,859 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:44:00,536 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:44:01,043 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:44:52,827 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_main_~n_stones1~0_BEFORE_CALL_2 Int) (v_main_~n_stones2~0_BEFORE_CALL_1 Int)) (and (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 ((.cse1 (div v_main_~n_stones1~0_BEFORE_CALL_2 correct_version_~j~0)) (.cse0 (div v_main_~n_stones2~0_BEFORE_CALL_1 student_version_~j~1))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~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) (= (mod v_main_~n_stones2~0_BEFORE_CALL_1 student_version_~j~1) 0) (not (< .cse0 student_version_~i~1)) (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))) (<= correct_version_~i~0 .cse1) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< .cse1 (+ correct_version_~i~0 1)) (< .cse0 (+ student_version_~i~1 1)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (= (mod v_main_~n_stones1~0_BEFORE_CALL_2 correct_version_~j~0) 0) (< 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)))))) (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (not (= v_main_~n_stones1~0_BEFORE_CALL_2 v_main_~n_stones2~0_BEFORE_CALL_1)) (<= 0 |c___VERIFIER_assert_#in~cond|))))) is different from false [2022-03-17 15:45:22,826 WARN L833 $PredicateComparison]: unable to prove that (exists ((correct_version_~j~0 Int) (v_main_~n_stones1~0_BEFORE_CALL_2 Int) (main_~m~0 Int) (correct_version_~i~0 Int) (main_~n~0 Int) (main_~a~0 Int) (v_main_~n_stones2~0_BEFORE_CALL_1 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (let ((.cse1 (div v_main_~n_stones1~0_BEFORE_CALL_2 correct_version_~j~0)) (.cse0 (div v_main_~n_stones2~0_BEFORE_CALL_1 student_version_~j~1))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~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 (= v_main_~n_stones1~0_BEFORE_CALL_2 v_main_~n_stones2~0_BEFORE_CALL_1)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (= (mod v_main_~n_stones2~0_BEFORE_CALL_1 student_version_~j~1) 0) (not (< .cse0 student_version_~i~1)) (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))) (<= correct_version_~i~0 .cse1) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< .cse1 (+ correct_version_~i~0 1)) (< .cse0 (+ student_version_~i~1 1)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (= (mod v_main_~n_stones1~0_BEFORE_CALL_2 correct_version_~j~0) 0) (< 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 false [2022-03-17 15:45:24,830 WARN L855 $PredicateComparison]: unable to prove that (exists ((correct_version_~j~0 Int) (v_main_~n_stones1~0_BEFORE_CALL_2 Int) (main_~m~0 Int) (correct_version_~i~0 Int) (main_~n~0 Int) (main_~a~0 Int) (v_main_~n_stones2~0_BEFORE_CALL_1 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (let ((.cse1 (div v_main_~n_stones1~0_BEFORE_CALL_2 correct_version_~j~0)) (.cse0 (div v_main_~n_stones2~0_BEFORE_CALL_1 student_version_~j~1))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~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 (= v_main_~n_stones1~0_BEFORE_CALL_2 v_main_~n_stones2~0_BEFORE_CALL_1)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (= (mod v_main_~n_stones2~0_BEFORE_CALL_1 student_version_~j~1) 0) (not (< .cse0 student_version_~i~1)) (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))) (<= correct_version_~i~0 .cse1) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< .cse1 (+ correct_version_~i~0 1)) (< .cse0 (+ student_version_~i~1 1)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (= (mod v_main_~n_stones1~0_BEFORE_CALL_2 correct_version_~j~0) 0) (< 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-03-17 15:45:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:45:24,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:45:33,783 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:45:35,463 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:45:46,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:45:46,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881813500] [2022-03-17 15:45:46,220 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 15:45:46,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736659961] [2022-03-17 15:45:46,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736659961] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:45:46,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:45:46,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-03-17 15:45:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104332781] [2022-03-17 15:45:46,221 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 15:45:46,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-17 15:45:46,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:45:46,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-17 15:45:46,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=843, Unknown=25, NotChecked=118, Total=1056 [2022-03-17 15:45:46,222 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 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-03-17 15:45:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:45:46,231 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-03-17 15:45:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-17 15:45:46,243 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 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-03-17 15:45:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:45:46,244 INFO L225 Difference]: With dead ends: 63 [2022-03-17 15:45:46,244 INFO L226 Difference]: Without dead ends: 58 [2022-03-17 15:45:46,245 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 77.4s TimeCoverageRelationStatistics Valid=70, Invalid=843, Unknown=25, NotChecked=118, Total=1056 [2022-03-17 15:45:46,245 INFO L912 BasicCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:45:46,245 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 374 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 110 Unchecked, 0.0s Time] [2022-03-17 15:45:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-17 15:45:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-03-17 15:45:46,248 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-03-17 15:45:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2022-03-17 15:45:46,248 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 37 [2022-03-17 15:45:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:45:46,248 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2022-03-17 15:45:46,249 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 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-03-17 15:45:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-03-17 15:45:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-17 15:45:46,249 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:45:46,249 INFO L500 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-03-17 15:45:46,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-17 15:45:46,466 WARN L460 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-03-17 15:45:46,466 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:45:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:45:46,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1189593605, now seen corresponding path program 2 times [2022-03-17 15:45:46,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:45:46,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731180833] [2022-03-17 15:45:46,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:45:46,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:45:46,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:45:46,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750831088] [2022-03-17 15:45:46,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:45:46,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:45:46,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:45:46,481 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-03-17 15:45:46,482 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-03-17 15:45:47,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:45:47,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:45:47,099 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-17 15:45:47,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:45:48,266 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:45:48,659 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:45:48,992 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:46:18,368 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:46:18,630 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:46:19,529 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:46:19,607 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:47:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:47:02,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:47:13,082 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:47:13,629 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:47:17,336 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:47:27,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:47:27,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731180833] [2022-03-17 15:47:27,337 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 15:47:27,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750831088] [2022-03-17 15:47:27,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750831088] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:47:27,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:47:27,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-03-17 15:47:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198500791] [2022-03-17 15:47:27,337 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 15:47:27,338 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-17 15:47:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:47:27,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-17 15:47:27,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=849, Unknown=15, NotChecked=0, Total=930 [2022-03-17 15:47:27,339 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-03-17 15:47:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:47:33,100 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-03-17 15:47:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-17 15:47:33,100 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-03-17 15:47:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:47:33,101 INFO L225 Difference]: With dead ends: 66 [2022-03-17 15:47:33,101 INFO L226 Difference]: Without dead ends: 62 [2022-03-17 15:47:33,101 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=74, Invalid=967, Unknown=15, NotChecked=0, Total=1056 [2022-03-17 15:47:33,102 INFO L912 BasicCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:47:33,102 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 467 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 151 Unchecked, 0.0s Time] [2022-03-17 15:47:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-03-17 15:47:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2022-03-17 15:47:33,104 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-03-17 15:47:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-03-17 15:47:33,105 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 38 [2022-03-17 15:47:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:47:33,105 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-03-17 15:47:33,105 INFO L479 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-03-17 15:47:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-03-17 15:47:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-17 15:47:33,106 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:47:33,106 INFO L500 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-03-17 15:47:33,115 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-03-17 15:47:33,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-17 15:47:33,308 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:47:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:47:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash 764427933, now seen corresponding path program 3 times [2022-03-17 15:47:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:47:33,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065974503] [2022-03-17 15:47:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:47:33,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:47:33,314 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:47:33,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915913446] [2022-03-17 15:47:33,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 15:47:33,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:47:33,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:47:33,315 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-03-17 15:47:33,316 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-03-17 15:47:34,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-17 15:47:34,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:47:34,820 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-17 15:47:34,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:47:36,229 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:47:36,700 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:47:37,054 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:48:12,939 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:48:13,771 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:48:16,298 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:50:45,531 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_main_~n_stones1~0_BEFORE_CALL_6 Int) (v_main_~n_stones2~0_BEFORE_CALL_3 Int)) (and (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (not (= v_main_~n_stones1~0_BEFORE_CALL_6 v_main_~n_stones2~0_BEFORE_CALL_3)) (<= 0 |c___VERIFIER_assert_#in~cond|))) (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 ((.cse1 (div v_main_~n_stones1~0_BEFORE_CALL_6 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~0) (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))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (= (mod v_main_~n_stones1~0_BEFORE_CALL_6 correct_version_~j~0) 0) (<= correct_version_~i~0 .cse1) (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)) (< .cse1 (+ correct_version_~i~0 1)) (let ((.cse2 (= student_version_~j~1 0))) (or (and (= v_main_~n_stones2~0_BEFORE_CALL_3 0) .cse2) (let ((.cse3 (div v_main_~n_stones2~0_BEFORE_CALL_3 student_version_~j~1))) (and (= (mod v_main_~n_stones2~0_BEFORE_CALL_3 student_version_~j~1) 0) (not (< .cse3 student_version_~i~1)) (< .cse3 (+ student_version_~i~1 1)) (not .cse2))))) (< 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 false [2022-03-17 15:52:39,466 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_student_version_~j~1_26 Int) (correct_version_~j~0 Int) (main_~m~0 Int) (correct_version_~i~0 Int) (main_~n~0 Int) (v_main_~n_stones1~0_BEFORE_CALL_6 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int) (v_main_~n_stones2~0_BEFORE_CALL_3 Int)) (let ((.cse0 (div v_main_~n_stones2~0_BEFORE_CALL_3 student_version_~j~1)) (.cse2 (div v_main_~n_stones1~0_BEFORE_CALL_6 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (= (mod v_main_~n_stones2~0_BEFORE_CALL_3 student_version_~j~1) 0) (not (< .cse0 student_version_~i~1)) (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)))) (<= 1 main_~n~0) (< 0 v_student_version_~j~1_26) (< .cse0 (+ student_version_~i~1 1)) (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 (= v_main_~n_stones1~0_BEFORE_CALL_6 v_main_~n_stones2~0_BEFORE_CALL_3)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (= (mod v_main_~n_stones1~0_BEFORE_CALL_6 correct_version_~j~0) 0) (<= correct_version_~i~0 .cse2) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (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))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< .cse2 (+ 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 false [2022-03-17 15:52:41,512 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_student_version_~j~1_26 Int) (correct_version_~j~0 Int) (main_~m~0 Int) (correct_version_~i~0 Int) (main_~n~0 Int) (v_main_~n_stones1~0_BEFORE_CALL_6 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int) (v_main_~n_stones2~0_BEFORE_CALL_3 Int)) (let ((.cse0 (div v_main_~n_stones2~0_BEFORE_CALL_3 student_version_~j~1)) (.cse2 (div v_main_~n_stones1~0_BEFORE_CALL_6 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (= (mod v_main_~n_stones2~0_BEFORE_CALL_3 student_version_~j~1) 0) (not (< .cse0 student_version_~i~1)) (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)))) (<= 1 main_~n~0) (< 0 v_student_version_~j~1_26) (< .cse0 (+ student_version_~i~1 1)) (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 (= v_main_~n_stones1~0_BEFORE_CALL_6 v_main_~n_stones2~0_BEFORE_CALL_3)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (= (mod v_main_~n_stones1~0_BEFORE_CALL_6 correct_version_~j~0) 0) (<= correct_version_~i~0 .cse2) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (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))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< .cse2 (+ 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-03-17 15:52:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:52:41,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:53:46,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:53:46,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065974503] [2022-03-17 15:53:46,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 15:53:46,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915913446] [2022-03-17 15:53:46,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915913446] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:53:46,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:53:46,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-03-17 15:53:46,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360528512] [2022-03-17 15:53:46,840 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 15:53:46,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-17 15:53:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:53:46,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-17 15:53:46,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=883, Unknown=46, NotChecked=122, Total=1122 [2022-03-17 15:53:46,841 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 29 states, 25 states have (on average 1.2) 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-03-17 15:53:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:53:46,861 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-03-17 15:53:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-17 15:53:46,862 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.2) 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-03-17 15:53:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:53:46,863 INFO L225 Difference]: With dead ends: 71 [2022-03-17 15:53:46,863 INFO L226 Difference]: Without dead ends: 66 [2022-03-17 15:53:46,864 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 141.9s TimeCoverageRelationStatistics Valid=71, Invalid=883, Unknown=46, NotChecked=122, Total=1122 [2022-03-17 15:53:46,864 INFO L912 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:53:46,864 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 494 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 123 Unchecked, 0.0s Time] [2022-03-17 15:53:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-17 15:53:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-03-17 15:53:46,867 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-03-17 15:53:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-03-17 15:53:46,867 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 38 [2022-03-17 15:53:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:53:46,868 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2022-03-17 15:53:46,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.2) 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-03-17 15:53:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-03-17 15:53:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-17 15:53:46,868 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:53:46,868 INFO L500 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-03-17 15:53:46,878 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-03-17 15:53:47,069 WARN L460 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-03-17 15:53:47,069 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:53:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:53:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash 504805571, now seen corresponding path program 4 times [2022-03-17 15:53:47,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:53:47,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649813091] [2022-03-17 15:53:47,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:53:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:53:47,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:53:47,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [648783653] [2022-03-17 15:53:47,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-17 15:53:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:53:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:53:47,076 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-03-17 15:53:47,077 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-03-17 15:53:54,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-17 15:53:54,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:53:54,805 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 81 conjunts are in the unsatisfiable core [2022-03-17 15:53:54,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:53:56,715 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:53:57,429 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:53:57,884 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:54:47,383 WARN L232 SmtUtils]: Spent 10.29s on a formula simplification. DAG size of input: 48 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:54:49,670 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:54:50,627 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:55:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:55:57,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:56:06,893 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:56:07,933 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:56:11,194 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:56:15,005 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:56:15,625 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:56:18,236 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:56:24,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:56:24,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649813091] [2022-03-17 15:56:24,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 15:56:24,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648783653] [2022-03-17 15:56:24,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648783653] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:56:24,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:56:24,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-03-17 15:56:24,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456441806] [2022-03-17 15:56:24,898 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 15:56:24,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-17 15:56:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:56:24,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-17 15:56:24,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=907, Unknown=19, NotChecked=0, Total=992 [2022-03-17 15:56:24,899 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-03-17 15:56:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:56:30,163 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-03-17 15:56:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-17 15:56:30,164 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-03-17 15:56:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:56:30,164 INFO L225 Difference]: With dead ends: 75 [2022-03-17 15:56:30,164 INFO L226 Difference]: Without dead ends: 71 [2022-03-17 15:56:30,165 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 83.4s TimeCoverageRelationStatistics Valid=92, Invalid=1294, Unknown=20, NotChecked=0, Total=1406 [2022-03-17 15:56:30,165 INFO L912 BasicCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:56:30,165 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 597 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 304 Unchecked, 0.1s Time] [2022-03-17 15:56:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-17 15:56:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-03-17 15:56:30,170 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-03-17 15:56:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2022-03-17 15:56:30,170 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 38 [2022-03-17 15:56:30,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:56:30,170 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2022-03-17 15:56:30,170 INFO L479 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-03-17 15:56:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-03-17 15:56:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-17 15:56:30,171 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:56:30,171 INFO L500 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-03-17 15:56:30,180 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-03-17 15:56:30,381 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-17 15:56:30,381 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:56:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:56:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash -781171018, now seen corresponding path program 5 times [2022-03-17 15:56:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:56:30,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072536794] [2022-03-17 15:56:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:56:30,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:56:30,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 15:56:30,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381988489] [2022-03-17 15:56:30,387 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-17 15:56:30,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:56:30,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:56:30,388 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-03-17 15:56:30,389 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-03-17 15:56:31,569 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:56:31,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:56:31,572 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-17 15:56:31,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:56:34,843 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:56:35,822 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:56:37,361 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:56:37,660 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:56:38,426 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:57:16,448 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 15:57:17,580 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful