/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-6c470ae [2022-02-14 21:33:47,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 21:33:47,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 21:33:47,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 21:33:47,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 21:33:47,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 21:33:47,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 21:33:47,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 21:33:47,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 21:33:47,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 21:33:47,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 21:33:47,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 21:33:47,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 21:33:47,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 21:33:47,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 21:33:47,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 21:33:47,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 21:33:47,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 21:33:47,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 21:33:47,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 21:33:47,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 21:33:47,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 21:33:47,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 21:33:47,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 21:33:47,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 21:33:47,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 21:33:47,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 21:33:47,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 21:33:47,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 21:33:47,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 21:33:47,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 21:33:47,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 21:33:47,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 21:33:47,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 21:33:47,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 21:33:47,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 21:33:47,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 21:33:47,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 21:33:47,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 21:33:47,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 21:33:47,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 21:33:47,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 21:33:47,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 21:33:47,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 21:33:47,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 21:33:47,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 21:33:47,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 21:33:47,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 21:33:47,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 21:33:47,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 21:33:47,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 21:33:47,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 21:33:47,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 21:33:47,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 21:33:47,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 21:33:47,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 21:33:47,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 21:33:47,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 21:33:47,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 21:33:47,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 21:33:47,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:33:47,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 21:33:47,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 21:33:47,137 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 21:33:47,137 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-02-14 21:33:47,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 21:33:47,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 21:33:47,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 21:33:47,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 21:33:47,379 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 21:33:47,380 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-02-14 21:33:47,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1b28abf/8c003ba7b8be421bb2d4a817f5b5eda5/FLAG27036a3aa [2022-02-14 21:33:47,800 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 21:33:47,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-02-14 21:33:47,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1b28abf/8c003ba7b8be421bb2d4a817f5b5eda5/FLAG27036a3aa [2022-02-14 21:33:48,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1b28abf/8c003ba7b8be421bb2d4a817f5b5eda5 [2022-02-14 21:33:48,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 21:33:48,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 21:33:48,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 21:33:48,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 21:33:48,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 21:33:48,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535376ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48, skipping insertion in model container [2022-02-14 21:33:48,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 21:33:48,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 21:33:48,377 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-02-14 21:33:48,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:33:48,400 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 21:33:48,409 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-02-14 21:33:48,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:33:48,427 INFO L208 MainTranslator]: Completed translation [2022-02-14 21:33:48,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48 WrapperNode [2022-02-14 21:33:48,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 21:33:48,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 21:33:48,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 21:33:48,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 21:33:48,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 21:33:48,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 21:33:48,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 21:33:48,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 21:33:48,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:33:48,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:33:48,496 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-02-14 21:33:48,519 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-02-14 21:33:48,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 21:33:48,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 21:33:48,543 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 21:33:48,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 21:33:48,544 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-02-14 21:33:48,544 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-02-14 21:33:48,545 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 21:33:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 21:33:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 21:33:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 21:33:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 21:33:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-14 21:33:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 21:33:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-02-14 21:33:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-02-14 21:33:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 21:33:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 21:33:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 21:33:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 21:33:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 21:33:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 21:33:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 21:33:48,622 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 21:33:48,623 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 21:33:48,728 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 21:33:48,733 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 21:33:48,734 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-14 21:33:48,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:33:48 BoogieIcfgContainer [2022-02-14 21:33:48,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 21:33:48,736 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 21:33:48,736 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 21:33:48,737 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 21:33:48,740 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:33:48" (1/1) ... [2022-02-14 21:33:48,989 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-14 21:33:48,990 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-02-14 21:33:49,073 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-14 21:33:49,074 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-02-14 21:33:49,131 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-14 21:33:49,131 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-02-14 21:33:49,179 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-14 21:33:49,180 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-02-14 21:33:49,275 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-14 21:33:49,276 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-02-14 21:33:49,354 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-14 21:33:49,356 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-02-14 21:33:49,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:33:49 BasicIcfg [2022-02-14 21:33:49,360 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 21:33:49,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 21:33:49,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 21:33:49,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 21:33:49,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 09:33:48" (1/4) ... [2022-02-14 21:33:49,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c6fe54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:33:49, skipping insertion in model container [2022-02-14 21:33:49,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:33:48" (2/4) ... [2022-02-14 21:33:49,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c6fe54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:33:49, skipping insertion in model container [2022-02-14 21:33:49,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:33:48" (3/4) ... [2022-02-14 21:33:49,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c6fe54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:33:49, skipping insertion in model container [2022-02-14 21:33:49,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:33:49" (4/4) ... [2022-02-14 21:33:49,373 INFO L111 eAbstractionObserver]: Analyzing ICFG theatreSquare.cJordan [2022-02-14 21:33:49,377 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 21:33:49,378 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 21:33:49,413 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 21:33:49,418 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 21:33:49,419 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 21:33:49,428 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-02-14 21:33:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-14 21:33:49,433 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:33:49,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:33:49,433 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:33:49,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:33:49,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1121522138, now seen corresponding path program 1 times [2022-02-14 21:33:49,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:33:49,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840562637] [2022-02-14 21:33:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:49,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:33:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:33:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:33:49,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:33:49,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840562637] [2022-02-14 21:33:49,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840562637] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:33:49,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:33:49,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 21:33:49,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823222911] [2022-02-14 21:33:49,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:33:49,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 21:33:49,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:33:49,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 21:33:49,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 21:33:49,677 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-02-14 21:33:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:33:49,854 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-02-14 21:33:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 21:33:49,858 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-02-14 21:33:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:33:49,865 INFO L225 Difference]: With dead ends: 47 [2022-02-14 21:33:49,865 INFO L226 Difference]: Without dead ends: 32 [2022-02-14 21:33:49,867 INFO L932 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-02-14 21:33:49,873 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:33:49,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 61 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-02-14 21:33:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-14 21:33:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-14 21:33:49,907 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-02-14 21:33:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-02-14 21:33:49,910 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-02-14 21:33:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:33:49,911 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-02-14 21:33:49,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:33:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-14 21:33:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-14 21:33:49,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:33:49,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:33:49,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 21:33:49,914 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:33:49,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:33:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1342094697, now seen corresponding path program 1 times [2022-02-14 21:33:49,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:33:49,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337698058] [2022-02-14 21:33:49,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:33:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:50,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:33:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:50,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-14 21:33:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:50,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-14 21:33:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:33:50,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:33:50,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337698058] [2022-02-14 21:33:50,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337698058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:33:50,217 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:33:50,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-14 21:33:50,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578451555] [2022-02-14 21:33:50,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:33:50,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-14 21:33:50,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:33:50,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-14 21:33:50,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-02-14 21:33:50,226 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-02-14 21:33:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:33:50,550 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-02-14 21:33:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-14 21:33:50,554 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-02-14 21:33:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:33:50,562 INFO L225 Difference]: With dead ends: 48 [2022-02-14 21:33:50,562 INFO L226 Difference]: Without dead ends: 44 [2022-02-14 21:33:50,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-02-14 21:33:50,564 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:33:50,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-02-14 21:33:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-14 21:33:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-02-14 21:33:50,572 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-02-14 21:33:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-02-14 21:33:50,573 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 31 [2022-02-14 21:33:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:33:50,574 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-02-14 21:33:50,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-14 21:33:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-02-14 21:33:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-14 21:33:50,575 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:33:50,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:33:50,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 21:33:50,576 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:33:50,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:33:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1260090278, now seen corresponding path program 1 times [2022-02-14 21:33:50,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:33:50,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353649244] [2022-02-14 21:33:50,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:33:50,598 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:33:50,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [290435214] [2022-02-14 21:33:50,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:50,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:33:50,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:33:50,608 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-02-14 21:33:50,612 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-02-14 21:33:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:50,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-14 21:33:50,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:33:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:33:50,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:33:50,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:33:50,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353649244] [2022-02-14 21:33:50,747 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 21:33:50,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290435214] [2022-02-14 21:33:50,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290435214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:33:50,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:33:50,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 21:33:50,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033389734] [2022-02-14 21:33:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:33:50,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 21:33:50,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:33:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 21:33:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 21:33:50,749 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-02-14 21:33:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:33:50,763 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-14 21:33:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-14 21:33:50,764 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-02-14 21:33:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:33:50,765 INFO L225 Difference]: With dead ends: 53 [2022-02-14 21:33:50,765 INFO L226 Difference]: Without dead ends: 43 [2022-02-14 21:33:50,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-14 21:33:50,766 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:33:50,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-14 21:33:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-14 21:33:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-14 21:33:50,772 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-02-14 21:33:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-02-14 21:33:50,773 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 32 [2022-02-14 21:33:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:33:50,773 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-02-14 21:33:50,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:33:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-02-14 21:33:50,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-14 21:33:50,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:33:50,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:33:50,821 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-02-14 21:33:51,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:33:51,012 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:33:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:33:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1007047745, now seen corresponding path program 1 times [2022-02-14 21:33:51,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:33:51,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421763006] [2022-02-14 21:33:51,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:33:51,023 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:33:51,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208186692] [2022-02-14 21:33:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:33:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:33:51,024 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-02-14 21:33:51,047 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-02-14 21:33:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:51,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-14 21:33:51,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:33:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:33:51,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:33:51,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:33:51,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421763006] [2022-02-14 21:33:51,200 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 21:33:51,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208186692] [2022-02-14 21:33:51,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208186692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:33:51,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:33:51,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 21:33:51,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278384134] [2022-02-14 21:33:51,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:33:51,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 21:33:51,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:33:51,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 21:33:51,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 21:33:51,206 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-02-14 21:33:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:33:51,226 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-02-14 21:33:51,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-14 21:33:51,226 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-02-14 21:33:51,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:33:51,230 INFO L225 Difference]: With dead ends: 53 [2022-02-14 21:33:51,230 INFO L226 Difference]: Without dead ends: 44 [2022-02-14 21:33:51,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-14 21:33:51,233 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:33:51,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-14 21:33:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-14 21:33:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-14 21:33:51,245 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-02-14 21:33:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-02-14 21:33:51,246 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-02-14 21:33:51,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:33:51,246 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-02-14 21:33:51,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:33:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-02-14 21:33:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-14 21:33:51,248 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:33:51,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:33:51,279 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-02-14 21:33:51,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-14 21:33:51,472 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:33:51,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:33:51,472 INFO L85 PathProgramCache]: Analyzing trace with hash 111102768, now seen corresponding path program 1 times [2022-02-14 21:33:51,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:33:51,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351101015] [2022-02-14 21:33:51,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:51,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:33:51,488 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:33:51,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605313058] [2022-02-14 21:33:51,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:51,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:33:51,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:33:51,491 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-02-14 21:33:51,492 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-02-14 21:33:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:51,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-14 21:33:51,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:33:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-14 21:33:51,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:33:51,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:33:51,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351101015] [2022-02-14 21:33:51,641 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 21:33:51,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605313058] [2022-02-14 21:33:51,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605313058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:33:51,641 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:33:51,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 21:33:51,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977375491] [2022-02-14 21:33:51,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:33:51,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 21:33:51,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:33:51,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 21:33:51,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 21:33:51,643 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-02-14 21:33:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:33:51,665 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-02-14 21:33:51,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-14 21:33:51,666 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-02-14 21:33:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:33:51,668 INFO L225 Difference]: With dead ends: 55 [2022-02-14 21:33:51,668 INFO L226 Difference]: Without dead ends: 45 [2022-02-14 21:33:51,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-14 21:33:51,669 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:33:51,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-14 21:33:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-14 21:33:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-14 21:33:51,686 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-02-14 21:33:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-02-14 21:33:51,690 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 34 [2022-02-14 21:33:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:33:51,690 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-02-14 21:33:51,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-14 21:33:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-02-14 21:33:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-14 21:33:51,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:33:51,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:33:51,718 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-02-14 21:33:51,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:33:51,892 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:33:51,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:33:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1980049385, now seen corresponding path program 1 times [2022-02-14 21:33:51,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:33:51,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102594320] [2022-02-14 21:33:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:33:51,902 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:33:51,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056659107] [2022-02-14 21:33:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:51,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:33:51,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:33:51,915 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-02-14 21:33:51,916 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-02-14 21:33:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:51,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-14 21:33:51,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:33:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-14 21:33:52,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:33:52,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:33:52,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102594320] [2022-02-14 21:33:52,054 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 21:33:52,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056659107] [2022-02-14 21:33:52,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056659107] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:33:52,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:33:52,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 21:33:52,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136054655] [2022-02-14 21:33:52,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:33:52,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 21:33:52,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:33:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 21:33:52,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 21:33:52,056 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-02-14 21:33:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:33:52,074 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-02-14 21:33:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-14 21:33:52,074 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-02-14 21:33:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:33:52,075 INFO L225 Difference]: With dead ends: 55 [2022-02-14 21:33:52,075 INFO L226 Difference]: Without dead ends: 46 [2022-02-14 21:33:52,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-14 21:33:52,076 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:33:52,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-14 21:33:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-14 21:33:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-14 21:33:52,082 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-02-14 21:33:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-02-14 21:33:52,083 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 35 [2022-02-14 21:33:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:33:52,084 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-02-14 21:33:52,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-14 21:33:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-14 21:33:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-14 21:33:52,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:33:52,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:33:52,106 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-02-14 21:33:52,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:33:52,296 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:33:52,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:33:52,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1173604042, now seen corresponding path program 1 times [2022-02-14 21:33:52,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:33:52,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747513630] [2022-02-14 21:33:52,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:52,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:33:52,307 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:33:52,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181493822] [2022-02-14 21:33:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:33:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:33:52,312 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-02-14 21:33:52,314 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-02-14 21:33:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:52,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-14 21:33:52,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:33:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-14 21:33:54,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:33:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-14 21:33:54,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:33:54,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747513630] [2022-02-14 21:33:54,797 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 21:33:54,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181493822] [2022-02-14 21:33:54,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181493822] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-14 21:33:54,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:33:54,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-02-14 21:33:54,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727243051] [2022-02-14 21:33:54,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:33:54,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:33:54,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:33:54,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:33:54,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 21:33:54,799 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-02-14 21:33:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:33:54,831 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-14 21:33:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 21:33:54,831 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-02-14 21:33:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:33:54,833 INFO L225 Difference]: With dead ends: 44 [2022-02-14 21:33:54,833 INFO L226 Difference]: Without dead ends: 41 [2022-02-14 21:33:54,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-14 21:33:54,834 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:33:54,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 154 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-02-14 21:33:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-14 21:33:54,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-02-14 21:33:54,845 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-02-14 21:33:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-02-14 21:33:54,847 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2022-02-14 21:33:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:33:54,850 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-02-14 21:33:54,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:33:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-14 21:33:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-14 21:33:54,851 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:33:54,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:33:54,877 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-02-14 21:33:55,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:33:55,052 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:33:55,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:33:55,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1887612187, now seen corresponding path program 1 times [2022-02-14 21:33:55,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:33:55,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536382936] [2022-02-14 21:33:55,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:55,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:33:55,062 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:33:55,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094067839] [2022-02-14 21:33:55,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:33:55,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:33:55,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:33:55,064 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-02-14 21:33:55,086 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-02-14 21:33:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:33:55,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-14 21:33:55,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:34:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-14 21:34:00,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:34:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-14 21:34:01,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:34:01,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536382936] [2022-02-14 21:34:01,499 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 21:34:01,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094067839] [2022-02-14 21:34:01,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094067839] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-14 21:34:01,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:34:01,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-02-14 21:34:01,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027984840] [2022-02-14 21:34:01,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:34:01,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:34:01,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:34:01,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:34:01,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 21:34:01,517 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-02-14 21:34:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:34:01,564 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-14 21:34:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 21:34:01,564 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-02-14 21:34:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:34:01,567 INFO L225 Difference]: With dead ends: 41 [2022-02-14 21:34:01,567 INFO L226 Difference]: Without dead ends: 38 [2022-02-14 21:34:01,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-14 21:34:01,568 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:34:01,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 3 Unchecked, 0.0s Time] [2022-02-14 21:34:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-14 21:34:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-14 21:34:01,570 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-02-14 21:34:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-02-14 21:34:01,571 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 36 [2022-02-14 21:34:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:34:01,571 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-02-14 21:34:01,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-14 21:34:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-14 21:34:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-14 21:34:01,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:34:01,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:34:01,599 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-02-14 21:34:01,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:34:01,778 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:34:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:34:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1698211422, now seen corresponding path program 1 times [2022-02-14 21:34:01,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:34:01,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093426176] [2022-02-14 21:34:01,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:34:01,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:34:01,786 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:34:01,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369990163] [2022-02-14 21:34:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:34:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:34:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:34:01,796 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-02-14 21:34:01,813 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-02-14 21:34:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:34:02,255 WARN L261 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-14 21:34:02,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:34:03,389 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:34:03,803 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:34:04,123 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:34:25,203 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:34:25,553 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:35:19,572 WARN L838 $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-02-14 21:35:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:35:26,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:35:34,263 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:35:35,782 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:35:47,553 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:35:47,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093426176] [2022-02-14 21:35:47,554 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 21:35:47,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369990163] [2022-02-14 21:35:47,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369990163] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:35:47,554 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:35:47,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-02-14 21:35:47,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360810226] [2022-02-14 21:35:47,554 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-14 21:35:47,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-14 21:35:47,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:35:47,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-14 21:35:47,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=788, Unknown=22, NotChecked=56, Total=930 [2022-02-14 21:35:47,556 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:35:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:35:47,570 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-02-14 21:35:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-14 21:35:47,570 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-02-14 21:35:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:35:47,571 INFO L225 Difference]: With dead ends: 62 [2022-02-14 21:35:47,571 INFO L226 Difference]: Without dead ends: 58 [2022-02-14 21:35:47,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=64, Invalid=788, Unknown=22, NotChecked=56, Total=930 [2022-02-14 21:35:47,572 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:35:47,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 398 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 82 Unchecked, 0.0s Time] [2022-02-14 21:35:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-14 21:35:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-14 21:35:47,575 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-02-14 21:35:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2022-02-14 21:35:47,576 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 37 [2022-02-14 21:35:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:35:47,576 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2022-02-14 21:35:47,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:35:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-02-14 21:35:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-14 21:35:47,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:35:47,577 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:35:47,604 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-02-14 21:35:47,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:35:47,795 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:35:47,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:35:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1189593605, now seen corresponding path program 2 times [2022-02-14 21:35:47,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:35:47,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57237974] [2022-02-14 21:35:47,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:35:47,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:35:47,804 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:35:47,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1111102186] [2022-02-14 21:35:47,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:35:47,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:35:47,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:35:47,806 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-02-14 21:35:47,819 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-02-14 21:35:48,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:35:48,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:35:48,414 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-02-14 21:35:48,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:35:49,640 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:35:50,172 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:35:50,560 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:36:10,248 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:36:10,667 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:36:11,520 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:36:11,613 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:37:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:37:14,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:37:20,952 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:37:21,419 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:37:24,800 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:37:30,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:37:30,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57237974] [2022-02-14 21:37:30,346 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 21:37:30,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111102186] [2022-02-14 21:37:30,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111102186] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:37:30,346 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:37:30,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-02-14 21:37:30,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087011475] [2022-02-14 21:37:30,347 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-14 21:37:30,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-14 21:37:30,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:37:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-14 21:37:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=844, Unknown=21, NotChecked=0, Total=930 [2022-02-14 21:37:30,348 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-02-14 21:37:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:37:33,236 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-02-14 21:37:33,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-14 21:37:33,237 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-02-14 21:37:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:37:33,237 INFO L225 Difference]: With dead ends: 66 [2022-02-14 21:37:33,237 INFO L226 Difference]: Without dead ends: 62 [2022-02-14 21:37:33,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 57.8s TimeCoverageRelationStatistics Valid=73, Invalid=962, Unknown=21, NotChecked=0, Total=1056 [2022-02-14 21:37:33,238 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:37:33,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 505 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 158 Unchecked, 0.0s Time] [2022-02-14 21:37:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-14 21:37:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2022-02-14 21:37:33,242 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-02-14 21:37:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-02-14 21:37:33,242 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 38 [2022-02-14 21:37:33,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:37:33,242 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-02-14 21:37:33,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:37:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-02-14 21:37:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-14 21:37:33,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:37:33,243 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:37:33,251 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-02-14 21:37:33,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-14 21:37:33,450 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:37:33,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:37:33,450 INFO L85 PathProgramCache]: Analyzing trace with hash 764427933, now seen corresponding path program 3 times [2022-02-14 21:37:33,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:37:33,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775956864] [2022-02-14 21:37:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:37:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:37:33,457 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:37:33,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352438312] [2022-02-14 21:37:33,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 21:37:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:37:33,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:37:33,464 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-02-14 21:37:33,464 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-02-14 21:37:34,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-14 21:37:34,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:37:34,951 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-02-14 21:37:34,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:37:36,274 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:37:36,701 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:37:37,051 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:38:01,312 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:38:01,999 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:38:03,929 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:40:32,121 WARN L838 $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-02-14 21:42:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:42:00,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:42:19,074 WARN L228 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 116 DAG size of output: 91 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-02-14 21:42:50,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:42:50,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775956864] [2022-02-14 21:42:50,706 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 21:42:50,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352438312] [2022-02-14 21:42:50,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352438312] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:42:50,706 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:42:50,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-02-14 21:42:50,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479546069] [2022-02-14 21:42:50,706 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-14 21:42:50,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-14 21:42:50,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:42:50,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-14 21:42:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=884, Unknown=44, NotChecked=60, Total=1056 [2022-02-14 21:42:50,708 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:42:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:42:50,730 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-02-14 21:42:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-14 21:42:50,731 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-02-14 21:42:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:42:50,733 INFO L225 Difference]: With dead ends: 70 [2022-02-14 21:42:50,733 INFO L226 Difference]: Without dead ends: 66 [2022-02-14 21:42:50,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 120.4s TimeCoverageRelationStatistics Valid=68, Invalid=884, Unknown=44, NotChecked=60, Total=1056 [2022-02-14 21:42:50,734 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:42:50,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 543 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 219 Unchecked, 0.0s Time] [2022-02-14 21:42:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-14 21:42:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-02-14 21:42:50,738 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-02-14 21:42:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-02-14 21:42:50,739 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 38 [2022-02-14 21:42:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:42:50,739 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2022-02-14 21:42:50,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:42:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-02-14 21:42:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-14 21:42:50,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:42:50,740 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:42:50,748 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-02-14 21:42:50,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:42:50,948 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:42:50,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:42:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash 504805571, now seen corresponding path program 4 times [2022-02-14 21:42:50,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:42:50,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246948738] [2022-02-14 21:42:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:42:50,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:42:50,955 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:42:50,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378760857] [2022-02-14 21:42:50,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-14 21:42:50,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:42:50,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:42:50,957 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-02-14 21:42:50,959 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-02-14 21:42:58,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-14 21:42:58,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:42:58,239 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 81 conjunts are in the unsatisfiable core [2022-02-14 21:42:58,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:43:00,099 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:43:00,921 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:43:01,392 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:43:43,772 WARN L228 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 48 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:43:49,739 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:43:50,835 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:45:07,241 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~n_stones2~0_BEFORE_CALL_4 Int) (v_main_~n_stones1~0_BEFORE_CALL_8 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 ((.cse0 (div v_main_~n_stones2~0_BEFORE_CALL_4 student_version_~j~1)) (.cse1 (div v_main_~n_stones1~0_BEFORE_CALL_8 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< .cse0 (+ student_version_~i~1 1)) (<= 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 (< .cse0 student_version_~i~1)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= correct_version_~i~0 .cse1) (<= 1 main_~m~0) (< .cse1 (+ correct_version_~i~0 1)) (= (mod v_main_~n_stones1~0_BEFORE_CALL_8 correct_version_~j~0) 0) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod v_main_~n_stones2~0_BEFORE_CALL_4 student_version_~j~1) 0) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (<= main_~m~0 (* main_~a~0 student_version_~j~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)))))) (or (and (not (= v_main_~n_stones1~0_BEFORE_CALL_8 v_main_~n_stones2~0_BEFORE_CALL_4)) (<= 0 |c___VERIFIER_assert_#in~cond|)) (<= 1 |c___VERIFIER_assert_#in~cond|)))) is different from false [2022-02-14 21:45:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:45:19,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:45:33,603 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:45:34,665 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:45:38,004 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:45:41,372 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:45:42,069 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:45:44,883 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:45:53,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:45:53,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246948738] [2022-02-14 21:45:53,574 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 21:45:53,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378760857] [2022-02-14 21:45:53,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378760857] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:45:53,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:45:53,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-02-14 21:45:53,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030614591] [2022-02-14 21:45:53,575 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-14 21:45:53,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-14 21:45:53,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:45:53,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-14 21:45:53,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=902, Unknown=27, NotChecked=60, Total=1056 [2022-02-14 21:45:53,576 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-02-14 21:46:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:46:01,105 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-02-14 21:46:01,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-14 21:46:01,106 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-02-14 21:46:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:46:01,107 INFO L225 Difference]: With dead ends: 75 [2022-02-14 21:46:01,107 INFO L226 Difference]: Without dead ends: 71 [2022-02-14 21:46:01,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 93.8s TimeCoverageRelationStatistics Valid=89, Invalid=1218, Unknown=29, NotChecked=70, Total=1406 [2022-02-14 21:46:01,108 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:46:01,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 569 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 229 Unchecked, 0.0s Time] [2022-02-14 21:46:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-14 21:46:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-02-14 21:46:01,111 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-02-14 21:46:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2022-02-14 21:46:01,112 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 38 [2022-02-14 21:46:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:46:01,112 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2022-02-14 21:46:01,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:46:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-02-14 21:46:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-14 21:46:01,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:46:01,113 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:46:01,129 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-02-14 21:46:01,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-14 21:46:01,314 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:46:01,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:46:01,314 INFO L85 PathProgramCache]: Analyzing trace with hash -781171018, now seen corresponding path program 5 times [2022-02-14 21:46:01,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:46:01,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131234341] [2022-02-14 21:46:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:46:01,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:46:01,321 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 21:46:01,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846490518] [2022-02-14 21:46:01,322 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-14 21:46:01,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:46:01,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:46:01,323 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-02-14 21:46:01,324 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-02-14 21:46:02,536 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:46:02,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:46:02,539 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-14 21:46:02,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:46:05,849 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:46:06,797 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:46:08,282 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:46:08,553 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:46:09,353 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:46:49,065 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-14 21:46:50,100 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful