/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:21:28,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:21:28,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:21:28,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:21:28,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:21:28,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:21:28,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:21:28,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:21:28,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:21:28,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:21:28,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:21:28,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:21:28,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:21:28,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:21:28,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:21:28,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:21:28,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:21:28,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:21:28,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:21:28,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:21:28,458 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:21:28,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:21:28,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:21:28,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:21:28,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:21:28,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:21:28,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:21:28,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:21:28,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:21:28,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:21:28,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:21:28,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:21:28,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:21:28,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:21:28,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:21:28,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:21:28,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:21:28,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:21:28,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:21:28,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:21:28,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:21:28,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:21:28,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:21:28,500 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:21:28,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:21:28,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:21:28,501 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:21:28,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:21:28,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:21:28,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:21:28,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:21:28,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:21:28,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:21:28,502 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:21:28,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:21:28,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:21:28,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:21:28,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:21:28,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:21:28,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:21:28,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:21:28,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:21:28,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:21:28,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:21:28,503 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:21:28,503 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-04-27 16:21:28,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:21:28,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:21:28,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:21:28,686 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:21:28,688 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:21:28,689 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.i [2022-04-27 16:21:28,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d34d45eb/fd0a265cecef4c1aa85593a16e83f215/FLAG15468bc25 [2022-04-27 16:21:29,083 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:21:29,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i [2022-04-27 16:21:29,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d34d45eb/fd0a265cecef4c1aa85593a16e83f215/FLAG15468bc25 [2022-04-27 16:21:29,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d34d45eb/fd0a265cecef4c1aa85593a16e83f215 [2022-04-27 16:21:29,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:21:29,099 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:21:29,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:21:29,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:21:29,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:21:29,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600cf6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29, skipping insertion in model container [2022-04-27 16:21:29,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:21:29,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:21:29,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i[895,908] [2022-04-27 16:21:29,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:21:29,251 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:21:29,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i[895,908] [2022-04-27 16:21:29,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:21:29,277 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:21:29,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29 WrapperNode [2022-04-27 16:21:29,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:21:29,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:21:29,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:21:29,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:21:29,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:21:29,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:21:29,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:21:29,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:21:29,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:21:29,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:21:29,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:21:29,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:21:29,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:21:29,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:21:29,356 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:21:29,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:21:29,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:21:29,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:21:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:21:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:21:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:21:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:21:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:21:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:21:29,398 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:21:29,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:21:29,495 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:21:29,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:21:29,504 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:21:29,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:29 BoogieIcfgContainer [2022-04-27 16:21:29,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:21:29,506 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:21:29,506 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:21:29,509 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:21:29,511 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:29" (1/1) ... [2022-04-27 16:21:29,512 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:21:32,590 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 16:21:32,591 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_main_~x~0_3 0) (= (+ v_main_~x~0_3 v_main_~y~0_5) v_main_~x~0_2) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] to Formula: (let ((.cse0 (< v_main_~x~0_3 0)) (.cse2 (* (- 1) v_main_~y~0_4))) (or (let ((.cse1 (div (+ v_main_~y~0_5 .cse2) (- 2)))) (and (forall ((v_itHalf_1 Int)) (or (< (+ v_main_~x~0_3 v_main_~y~0_5 v_itHalf_1 (* 2 (* v_itHalf_1 v_itHalf_1)) (* 2 (* v_main_~y~0_5 v_itHalf_1))) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ v_main_~y~0_5 (* (- 1) v_main_~y~0_4)) (- 2)))))) .cse0 (= (mod (+ v_main_~y~0_4 v_main_~y~0_5) 2) 0) (= (+ v_main_~x~0_3 (* (* v_main_~y~0_5 .cse1) 2) (* (* .cse1 .cse1) 2)) (+ v_main_~x~0_2 .cse1)) (< 0 .cse1))) (let ((.cse3 (div (+ v_main_~y~0_5 .cse2 1) (- 2)))) (and (<= 0 .cse3) (forall ((v_itHalf_1 Int)) (or (< (+ v_main_~x~0_3 (* 2 (* v_itHalf_1 v_itHalf_1)) (* 2 (* v_main_~y~0_5 v_itHalf_1))) v_itHalf_1) (not (<= 1 v_itHalf_1)) (not (<= v_itHalf_1 (div (+ v_main_~y~0_5 (* (- 1) v_main_~y~0_4) 1) (- 2)))))) .cse0 (= (+ v_main_~x~0_3 v_main_~y~0_5 (* (* v_main_~y~0_5 .cse3) 2) .cse3 (* (* .cse3 .cse3) 2)) v_main_~x~0_2) (= (mod (+ v_main_~y~0_4 v_main_~y~0_5 1) 2) 0))) (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 0 v_main_~x~0_3) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~x~0_3 v_main_~x~0_2)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~x~0=v_main_~x~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] [2022-04-27 16:21:32,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:21:32 BasicIcfg [2022-04-27 16:21:32,596 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:21:32,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:21:32,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:21:32,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:21:32,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:21:29" (1/4) ... [2022-04-27 16:21:32,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567b6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:21:32, skipping insertion in model container [2022-04-27 16:21:32,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:29" (2/4) ... [2022-04-27 16:21:32,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567b6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:21:32, skipping insertion in model container [2022-04-27 16:21:32,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:29" (3/4) ... [2022-04-27 16:21:32,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567b6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:21:32, skipping insertion in model container [2022-04-27 16:21:32,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:21:32" (4/4) ... [2022-04-27 16:21:32,605 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.iJordan [2022-04-27 16:21:32,614 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:21:32,614 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:21:32,648 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:21:32,654 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e69f6bb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70a3deea [2022-04-27 16:21:32,654 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:21:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:21:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:21:32,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:32,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:32,668 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1291699483, now seen corresponding path program 1 times [2022-04-27 16:21:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:32,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548806459] [2022-04-27 16:21:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:32,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:21:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:32,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 16:21:32,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:21:32,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:21:32,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:21:32,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 16:21:32,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:21:32,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:21:32,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:21:32,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [61] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 (- 50)) (= v_main_~y~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_~y~0] {23#true} is VALID [2022-04-27 16:21:32,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [64] L28-->L29-2: Formula: (and (< 0 (+ v_main_~y~0_3 1000)) (< v_main_~y~0_3 1000000)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 16:21:32,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [66] L29-2-->L29-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 16:21:32,791 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [69] L29-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< 0 v_main_~y~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {24#false} is VALID [2022-04-27 16:21:32,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-27 16:21:32,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 16:21:32,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 16:21:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:32,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:21:32,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548806459] [2022-04-27 16:21:32,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548806459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:21:32,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:21:32,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:21:32,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551802392] [2022-04-27 16:21:32,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:21:32,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-27 16:21:32,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:21:32,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:32,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:21:32,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:21:32,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:21:32,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:21:32,844 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:32,884 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 16:21:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:21:32,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-27 16:21:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:21:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-27 16:21:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-27 16:21:32,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-27 16:21:32,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:32,917 INFO L225 Difference]: With dead ends: 20 [2022-04-27 16:21:32,917 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 16:21:32,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:21:32,921 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:21:32,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:21:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 16:21:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 16:21:32,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:21:32,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,939 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,939 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:32,941 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:21:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:21:32,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:32,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:32,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 16:21:32,942 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 16:21:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:32,943 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:21:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:21:32,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:32,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:32,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:21:32,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:21:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 16:21:32,946 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-27 16:21:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:21:32,946 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 16:21:32,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:21:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:21:32,947 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:32,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:32,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:21:32,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1292623004, now seen corresponding path program 1 times [2022-04-27 16:21:32,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:32,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289595622] [2022-04-27 16:21:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:21:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:32,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {90#true} is VALID [2022-04-27 16:21:32,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:21:32,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:21:32,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:21:32,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {90#true} is VALID [2022-04-27 16:21:32,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:21:32,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:21:32,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:21:32,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [61] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 (- 50)) (= v_main_~y~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_~y~0] {95#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 16:21:32,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {95#(<= (+ main_~x~0 50) 0)} [64] L28-->L29-2: Formula: (and (< 0 (+ v_main_~y~0_3 1000)) (< v_main_~y~0_3 1000000)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {95#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 16:21:32,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#(<= (+ main_~x~0 50) 0)} [67] L29-2-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-27 16:21:32,993 INFO L272 TraceCheckUtils]: 8: Hoare triple {91#false} [69] L29-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< 0 v_main_~y~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {91#false} is VALID [2022-04-27 16:21:32,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {91#false} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {91#false} is VALID [2022-04-27 16:21:32,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {91#false} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-27 16:21:32,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {91#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-27 16:21:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:32,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:21:32,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289595622] [2022-04-27 16:21:32,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289595622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:21:32,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:21:32,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:21:32,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084329802] [2022-04-27 16:21:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:21:32,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-27 16:21:32,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:21:32,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:33,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:21:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:21:33,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:21:33,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:21:33,006 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:33,054 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:21:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:21:33,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-27 16:21:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:21:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-27 16:21:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-27 16:21:33,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2022-04-27 16:21:33,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:33,074 INFO L225 Difference]: With dead ends: 14 [2022-04-27 16:21:33,075 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:21:33,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:21:33,077 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:21:33,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-27 16:21:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:21:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:21:33,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:21:33,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,083 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,083 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:33,085 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:21:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:33,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:33,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:33,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:21:33,087 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:21:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:33,093 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:21:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:33,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:33,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:33,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:21:33,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:21:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 16:21:33,096 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 16:21:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:21:33,096 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 16:21:33,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:21:33,097 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:33,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:33,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:21:33,097 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:33,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1443329038, now seen corresponding path program 1 times [2022-04-27 16:21:33,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:33,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946284403] [2022-04-27 16:21:33,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:33,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:33,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:21:33,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893953600] [2022-04-27 16:21:33,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:33,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:21:33,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:21:33,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:21:33,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:21:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:33,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 16:21:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:33,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:22:37,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 16:22:37,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {157#true} is VALID [2022-04-27 16:22:37,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 16:22:37,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 16:22:37,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 16:22:37,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [61] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 (- 50)) (= v_main_~y~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_~y~0] {177#(= (+ main_~x~0 50) 0)} is VALID [2022-04-27 16:22:37,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {177#(= (+ main_~x~0 50) 0)} [64] L28-->L29-2: Formula: (and (< 0 (+ v_main_~y~0_3 1000)) (< v_main_~y~0_3 1000000)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {181#(and (< 0 (+ main_~y~0 1000)) (= (+ main_~x~0 50) 0))} is VALID [2022-04-27 16:22:39,667 WARN L290 TraceCheckUtils]: 7: Hoare triple {181#(and (< 0 (+ main_~y~0 1000)) (= (+ main_~x~0 50) 0))} [68] L29-2-->L29-2: Formula: (let ((.cse0 (< v_main_~x~0_3 0)) (.cse2 (* (- 1) v_main_~y~0_4))) (or (let ((.cse1 (div (+ v_main_~y~0_5 .cse2) (- 2)))) (and (forall ((v_itHalf_1 Int)) (or (< (+ v_main_~x~0_3 v_main_~y~0_5 v_itHalf_1 (* 2 (* v_itHalf_1 v_itHalf_1)) (* 2 (* v_main_~y~0_5 v_itHalf_1))) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ v_main_~y~0_5 (* (- 1) v_main_~y~0_4)) (- 2)))))) .cse0 (= (mod (+ v_main_~y~0_4 v_main_~y~0_5) 2) 0) (= (+ v_main_~x~0_3 (* (* v_main_~y~0_5 .cse1) 2) (* (* .cse1 .cse1) 2)) (+ v_main_~x~0_2 .cse1)) (< 0 .cse1))) (let ((.cse3 (div (+ v_main_~y~0_5 .cse2 1) (- 2)))) (and (<= 0 .cse3) (forall ((v_itHalf_1 Int)) (or (< (+ v_main_~x~0_3 (* 2 (* v_itHalf_1 v_itHalf_1)) (* 2 (* v_main_~y~0_5 v_itHalf_1))) v_itHalf_1) (not (<= 1 v_itHalf_1)) (not (<= v_itHalf_1 (div (+ v_main_~y~0_5 (* (- 1) v_main_~y~0_4) 1) (- 2)))))) .cse0 (= (+ v_main_~x~0_3 v_main_~y~0_5 (* (* v_main_~y~0_5 .cse3) 2) .cse3 (* (* .cse3 .cse3) 2)) v_main_~x~0_2) (= (mod (+ v_main_~y~0_4 v_main_~y~0_5 1) 2) 0))) (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 0 v_main_~x~0_3) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~x~0_3 v_main_~x~0_2)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~x~0=v_main_~x~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] {185#(or (exists ((aux_div_v_main_~y~0_10_38 Int)) (and (< main_~y~0 (+ 999 (* aux_div_v_main_~y~0_10_38 2))) (<= aux_div_v_main_~y~0_10_38 main_~y~0) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~y~0_10_38) main_~y~0)) (not (<= 1 v_itHalf_1)) (< (+ (* (* v_itHalf_1 aux_div_v_main_~y~0_10_38) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* v_itHalf_1 main_~y~0)) (* v_itHalf_1 3) 50)))) (= (+ 51 main_~y~0 main_~x~0 (div (+ (* aux_div_v_main_~y~0_10_38 2) (* (- 2) main_~y~0)) (- 2)) (* 2 (* main_~y~0 (div (+ (* aux_div_v_main_~y~0_10_38 2) (* (- 2) main_~y~0)) (- 2))))) (+ (* (* aux_div_v_main_~y~0_10_38 (div (+ (* aux_div_v_main_~y~0_10_38 2) (* (- 2) main_~y~0)) (- 2))) 4) (* 2 (* (div (+ (* aux_div_v_main_~y~0_10_38 2) (* (- 2) main_~y~0)) (- 2)) (div (+ (* aux_div_v_main_~y~0_10_38 2) (* (- 2) main_~y~0)) (- 2)))) (* aux_div_v_main_~y~0_10_38 2))))) (exists ((aux_div_aux_mod_v_main_~y~0_10_50_77 Int) (aux_div_v_main_~y~0_10_50 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 Int)) (and (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) v_itHalf_1 main_~y~0 (* (* v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44) 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) 50 (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_10_50_77) 4))) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 1) aux_div_aux_mod_v_main_~y~0_10_50_77)))) (< 0 aux_div_aux_mod_v_main_~y~0_10_50_77) (<= (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) (+ (* aux_div_v_main_~y~0_10_50 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2))) (< (+ (* aux_div_v_main_~y~0_10_50 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2)) (+ 2 (* aux_div_aux_mod_v_main_~y~0_10_50_77 2))) (= (+ (* (* aux_div_v_main_~y~0_10_50 aux_div_aux_mod_v_main_~y~0_10_50_77) 4) aux_div_v_main_~y~0_10_50 main_~x~0 50) (+ (* (* aux_div_v_main_~y~0_10_50 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44) 4) (* (* aux_div_v_main_~y~0_10_50 aux_div_v_main_~y~0_10_50) 2) (* 2 (* aux_div_v_main_~y~0_10_50 main_~y~0)))) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2)) (< (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2) 2) (< (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) (+ main_~y~0 1000 (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2))))))} is UNKNOWN [2022-04-27 16:22:41,674 WARN L290 TraceCheckUtils]: 8: Hoare triple {185#(or (exists ((aux_div_v_main_~y~0_10_38 Int)) (and (< main_~y~0 (+ 999 (* aux_div_v_main_~y~0_10_38 2))) (<= aux_div_v_main_~y~0_10_38 main_~y~0) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~y~0_10_38) main_~y~0)) (not (<= 1 v_itHalf_1)) (< (+ (* (* v_itHalf_1 aux_div_v_main_~y~0_10_38) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* v_itHalf_1 main_~y~0)) (* v_itHalf_1 3) 50)))) (= (+ 51 main_~y~0 main_~x~0 (div (+ (* aux_div_v_main_~y~0_10_38 2) (* (- 2) main_~y~0)) (- 2)) (* 2 (* main_~y~0 (div (+ (* aux_div_v_main_~y~0_10_38 2) (* (- 2) main_~y~0)) (- 2))))) (+ (* (* aux_div_v_main_~y~0_10_38 (div (+ (* aux_div_v_main_~y~0_10_38 2) (* (- 2) main_~y~0)) (- 2))) 4) (* 2 (* (div (+ (* aux_div_v_main_~y~0_10_38 2) (* (- 2) main_~y~0)) (- 2)) (div (+ (* aux_div_v_main_~y~0_10_38 2) (* (- 2) main_~y~0)) (- 2)))) (* aux_div_v_main_~y~0_10_38 2))))) (exists ((aux_div_aux_mod_v_main_~y~0_10_50_77 Int) (aux_div_v_main_~y~0_10_50 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 Int)) (and (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) v_itHalf_1 main_~y~0 (* (* v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44) 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) 50 (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_10_50_77) 4))) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 1) aux_div_aux_mod_v_main_~y~0_10_50_77)))) (< 0 aux_div_aux_mod_v_main_~y~0_10_50_77) (<= (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) (+ (* aux_div_v_main_~y~0_10_50 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2))) (< (+ (* aux_div_v_main_~y~0_10_50 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2)) (+ 2 (* aux_div_aux_mod_v_main_~y~0_10_50_77 2))) (= (+ (* (* aux_div_v_main_~y~0_10_50 aux_div_aux_mod_v_main_~y~0_10_50_77) 4) aux_div_v_main_~y~0_10_50 main_~x~0 50) (+ (* (* aux_div_v_main_~y~0_10_50 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44) 4) (* (* aux_div_v_main_~y~0_10_50 aux_div_v_main_~y~0_10_50) 2) (* 2 (* aux_div_v_main_~y~0_10_50 main_~y~0)))) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2)) (< (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2) 2) (< (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) (+ main_~y~0 1000 (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2))))))} [67] L29-2-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {189#(or (exists ((aux_div_aux_mod_v_main_~y~0_10_50_77 Int) (aux_div_v_main_~y~0_10_50 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 Int)) (and (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) v_itHalf_1 main_~y~0 (* (* v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44) 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) 50 (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_10_50_77) 4))) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 1) aux_div_aux_mod_v_main_~y~0_10_50_77)))) (< 0 aux_div_aux_mod_v_main_~y~0_10_50_77) (<= (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) (+ (* aux_div_v_main_~y~0_10_50 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2))) (< (+ (* aux_div_v_main_~y~0_10_50 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2)) (+ 2 (* aux_div_aux_mod_v_main_~y~0_10_50_77 2))) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2)) (< (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2) 2) (not (< (+ (* (* aux_div_v_main_~y~0_10_50 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44) 4) (* (* aux_div_v_main_~y~0_10_50 aux_div_v_main_~y~0_10_50) 2) (* 2 (* aux_div_v_main_~y~0_10_50 main_~y~0))) (+ (* (* aux_div_v_main_~y~0_10_50 aux_div_aux_mod_v_main_~y~0_10_50_77) 4) aux_div_v_main_~y~0_10_50 50))) (< (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) (+ main_~y~0 1000 (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2))))) (exists ((aux_div_v_main_~y~0_10_38 Int)) (and (< main_~y~0 (+ 999 (* aux_div_v_main_~y~0_10_38 2))) (<= aux_div_v_main_~y~0_10_38 main_~y~0) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~y~0_10_38) main_~y~0)) (not (<= 1 v_itHalf_1)) (< (+ (* (* v_itHalf_1 aux_div_v_main_~y~0_10_38) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* v_itHalf_1 main_~y~0)) (* v_itHalf_1 3) 50)))) (not (< (+ (* aux_div_v_main_~y~0_10_38 3) (* 2 (* aux_div_v_main_~y~0_10_38 main_~y~0))) (+ 51 (* main_~y~0 2) (* 2 (* aux_div_v_main_~y~0_10_38 aux_div_v_main_~y~0_10_38))))))))} is UNKNOWN [2022-04-27 16:22:41,680 INFO L272 TraceCheckUtils]: 9: Hoare triple {189#(or (exists ((aux_div_aux_mod_v_main_~y~0_10_50_77 Int) (aux_div_v_main_~y~0_10_50 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 Int)) (and (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) v_itHalf_1 main_~y~0 (* (* v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44) 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) 50 (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_10_50_77) 4))) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 1) aux_div_aux_mod_v_main_~y~0_10_50_77)))) (< 0 aux_div_aux_mod_v_main_~y~0_10_50_77) (<= (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) (+ (* aux_div_v_main_~y~0_10_50 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2))) (< (+ (* aux_div_v_main_~y~0_10_50 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2)) (+ 2 (* aux_div_aux_mod_v_main_~y~0_10_50_77 2))) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2)) (< (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2) 2) (not (< (+ (* (* aux_div_v_main_~y~0_10_50 aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44) 4) (* (* aux_div_v_main_~y~0_10_50 aux_div_v_main_~y~0_10_50) 2) (* 2 (* aux_div_v_main_~y~0_10_50 main_~y~0))) (+ (* (* aux_div_v_main_~y~0_10_50 aux_div_aux_mod_v_main_~y~0_10_50_77) 4) aux_div_v_main_~y~0_10_50 50))) (< (* aux_div_aux_mod_v_main_~y~0_10_50_77 2) (+ main_~y~0 1000 (* aux_div_aux_mod_aux_mod_v_main_~y~0_10_50_77_44 2))))) (exists ((aux_div_v_main_~y~0_10_38 Int)) (and (< main_~y~0 (+ 999 (* aux_div_v_main_~y~0_10_38 2))) (<= aux_div_v_main_~y~0_10_38 main_~y~0) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 aux_div_v_main_~y~0_10_38) main_~y~0)) (not (<= 1 v_itHalf_1)) (< (+ (* (* v_itHalf_1 aux_div_v_main_~y~0_10_38) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 (* v_itHalf_1 main_~y~0)) (* v_itHalf_1 3) 50)))) (not (< (+ (* aux_div_v_main_~y~0_10_38 3) (* 2 (* aux_div_v_main_~y~0_10_38 main_~y~0))) (+ 51 (* main_~y~0 2) (* 2 (* aux_div_v_main_~y~0_10_38 aux_div_v_main_~y~0_10_38))))))))} [69] L29-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< 0 v_main_~y~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:22:41,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {193#(<= 1 |__VERIFIER_assert_#in~cond|)} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:22:41,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#(<= 1 __VERIFIER_assert_~cond)} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-27 16:22:41,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-27 16:22:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:22:41,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:22:42,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-27 16:22:42,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#(<= 1 __VERIFIER_assert_~cond)} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-27 16:22:42,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {193#(<= 1 |__VERIFIER_assert_#in~cond|)} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:22:42,101 INFO L272 TraceCheckUtils]: 9: Hoare triple {213#(< 0 main_~y~0)} [69] L29-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< 0 v_main_~y~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:22:42,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(or (< main_~x~0 0) (< 0 main_~y~0))} [67] L29-2-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {213#(< 0 main_~y~0)} is VALID [2022-04-27 16:22:42,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(or (< main_~x~0 0) (< 0 main_~y~0))} [68] L29-2-->L29-2: Formula: (let ((.cse0 (< v_main_~x~0_3 0)) (.cse2 (* (- 1) v_main_~y~0_4))) (or (let ((.cse1 (div (+ v_main_~y~0_5 .cse2) (- 2)))) (and (forall ((v_itHalf_1 Int)) (or (< (+ v_main_~x~0_3 v_main_~y~0_5 v_itHalf_1 (* 2 (* v_itHalf_1 v_itHalf_1)) (* 2 (* v_main_~y~0_5 v_itHalf_1))) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ v_main_~y~0_5 (* (- 1) v_main_~y~0_4)) (- 2)))))) .cse0 (= (mod (+ v_main_~y~0_4 v_main_~y~0_5) 2) 0) (= (+ v_main_~x~0_3 (* (* v_main_~y~0_5 .cse1) 2) (* (* .cse1 .cse1) 2)) (+ v_main_~x~0_2 .cse1)) (< 0 .cse1))) (let ((.cse3 (div (+ v_main_~y~0_5 .cse2 1) (- 2)))) (and (<= 0 .cse3) (forall ((v_itHalf_1 Int)) (or (< (+ v_main_~x~0_3 (* 2 (* v_itHalf_1 v_itHalf_1)) (* 2 (* v_main_~y~0_5 v_itHalf_1))) v_itHalf_1) (not (<= 1 v_itHalf_1)) (not (<= v_itHalf_1 (div (+ v_main_~y~0_5 (* (- 1) v_main_~y~0_4) 1) (- 2)))))) .cse0 (= (+ v_main_~x~0_3 v_main_~y~0_5 (* (* v_main_~y~0_5 .cse3) 2) .cse3 (* (* .cse3 .cse3) 2)) v_main_~x~0_2) (= (mod (+ v_main_~y~0_4 v_main_~y~0_5 1) 2) 0))) (and (= v_main_~y~0_4 v_main_~y~0_5) (<= 0 v_main_~x~0_3) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~x~0_3 v_main_~x~0_2)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~x~0=v_main_~x~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] {217#(or (< main_~x~0 0) (< 0 main_~y~0))} is VALID [2022-04-27 16:22:42,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(or (< main_~x~0 0) (not (< 0 (+ main_~y~0 1000))) (< 0 main_~y~0))} [64] L28-->L29-2: Formula: (and (< 0 (+ v_main_~y~0_3 1000)) (< v_main_~y~0_3 1000000)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {217#(or (< main_~x~0 0) (< 0 main_~y~0))} is VALID [2022-04-27 16:22:42,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [61] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 (- 50)) (= v_main_~y~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_~y~0] {224#(or (< main_~x~0 0) (not (< 0 (+ main_~y~0 1000))) (< 0 main_~y~0))} is VALID [2022-04-27 16:22:42,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 16:22:42,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 16:22:42,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 16:22:42,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {157#true} is VALID [2022-04-27 16:22:42,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 16:22:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:22:42,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:22:42,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946284403] [2022-04-27 16:22:42,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:22:42,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893953600] [2022-04-27 16:22:42,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893953600] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 16:22:42,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 16:22:42,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2022-04-27 16:22:42,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273294413] [2022-04-27 16:22:42,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:22:42,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 16:22:42,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:22:42,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:22:42,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:22:42,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:22:42,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:22:42,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:22:42,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=77, Unknown=1, NotChecked=0, Total=110 [2022-04-27 16:22:42,121 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:22:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:22:42,160 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 16:22:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:22:42,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 16:22:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:22:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:22:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-27 16:22:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:22:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-27 16:22:42,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 12 transitions. [2022-04-27 16:22:42,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:22:42,172 INFO L225 Difference]: With dead ends: 12 [2022-04-27 16:22:42,172 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:22:42,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=36, Invalid=95, Unknown=1, NotChecked=0, Total=132 [2022-04-27 16:22:42,173 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:22:42,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 24 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-27 16:22:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:22:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:22:42,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:22:42,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:22:42,175 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:22:42,175 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:22:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:22:42,175 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:22:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:22:42,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:22:42,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:22:42,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:22:42,175 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:22:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:22:42,175 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:22:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:22:42,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:22:42,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:22:42,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:22:42,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:22:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:22:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:22:42,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-27 16:22:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:22:42,176 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:22:42,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:22:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:22:42,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:22:42,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:22:42,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:22:42,379 WARN L477 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-04-27 16:22:42,381 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 16:22:42,382 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:22:42,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:22:42 BasicIcfg [2022-04-27 16:22:42,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:22:42,385 INFO L158 Benchmark]: Toolchain (without parser) took 73286.23ms. Allocated memory was 192.9MB in the beginning and 269.5MB in the end (delta: 76.5MB). Free memory was 138.5MB in the beginning and 135.7MB in the end (delta: 2.8MB). Peak memory consumption was 79.6MB. Max. memory is 8.0GB. [2022-04-27 16:22:42,385 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:22:42,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.93ms. Allocated memory is still 192.9MB. Free memory was 138.3MB in the beginning and 162.8MB in the end (delta: -24.5MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-27 16:22:42,386 INFO L158 Benchmark]: Boogie Preprocessor took 25.54ms. Allocated memory is still 192.9MB. Free memory was 162.8MB in the beginning and 161.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:22:42,386 INFO L158 Benchmark]: RCFGBuilder took 201.42ms. Allocated memory is still 192.9MB. Free memory was 161.3MB in the beginning and 150.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:22:42,386 INFO L158 Benchmark]: IcfgTransformer took 3089.34ms. Allocated memory is still 192.9MB. Free memory was 150.4MB in the beginning and 113.7MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-04-27 16:22:42,386 INFO L158 Benchmark]: TraceAbstraction took 69786.08ms. Allocated memory was 192.9MB in the beginning and 269.5MB in the end (delta: 76.5MB). Free memory was 113.5MB in the beginning and 135.7MB in the end (delta: -22.2MB). Peak memory consumption was 55.8MB. Max. memory is 8.0GB. [2022-04-27 16:22:42,388 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.93ms. Allocated memory is still 192.9MB. Free memory was 138.3MB in the beginning and 162.8MB in the end (delta: -24.5MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.54ms. Allocated memory is still 192.9MB. Free memory was 162.8MB in the beginning and 161.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 201.42ms. Allocated memory is still 192.9MB. Free memory was 161.3MB in the beginning and 150.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 3089.34ms. Allocated memory is still 192.9MB. Free memory was 150.4MB in the beginning and 113.7MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 69786.08ms. Allocated memory was 192.9MB in the beginning and 269.5MB in the end (delta: 76.5MB). Free memory was 113.5MB in the beginning and 135.7MB in the end (delta: -22.2MB). Peak memory consumption was 55.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 39 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 68.8s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 46 ConstructedInterpolants, 2 QuantifiedInterpolants, 532 SizeOfPredicates, 3 NumberOfNonLiveVariables, 54 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:22:42,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...