/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-invariants/eq2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:02:47,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:02:47,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:02:48,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:02:48,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:02:48,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:02:48,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:02:48,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:02:48,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:02:48,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:02:48,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:02:48,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:02:48,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:02:48,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:02:48,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:02:48,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:02:48,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:02:48,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:02:48,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:02:48,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:02:48,026 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:02:48,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:02:48,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:02:48,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:02:48,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:02:48,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:02:48,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:02:48,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:02:48,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:02:48,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:02:48,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:02:48,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:02:48,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:02:48,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:02:48,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:02:48,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:02:48,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:02:48,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:02:48,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:02:48,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:02:48,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:02:48,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:02:48,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:02:48,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:02:48,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:02:48,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:02:48,060 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:02:48,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:02:48,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:02:48,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:02:48,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:02:48,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:02:48,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:02:48,061 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:02:48,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:02:48,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:02:48,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:02:48,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:02:48,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:02:48,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:02:48,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:02:48,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:02:48,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:02:48,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:02:48,063 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:02:48,063 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 17:02:48,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:02:48,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:02:48,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:02:48,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:02:48,275 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:02:48,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/eq2.c [2022-04-27 17:02:48,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea347ea0/d828e59427584a53baf2941815ea481b/FLAG41e6ae333 [2022-04-27 17:02:48,664 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:02:48,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/eq2.c [2022-04-27 17:02:48,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea347ea0/d828e59427584a53baf2941815ea481b/FLAG41e6ae333 [2022-04-27 17:02:49,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea347ea0/d828e59427584a53baf2941815ea481b [2022-04-27 17:02:49,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:02:49,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:02:49,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:02:49,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:02:49,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:02:49,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a21e3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49, skipping insertion in model container [2022-04-27 17:02:49,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:02:49,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:02:49,249 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-invariants/eq2.c[364,377] [2022-04-27 17:02:49,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:02:49,278 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:02:49,298 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-invariants/eq2.c[364,377] [2022-04-27 17:02:49,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:02:49,322 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:02:49,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49 WrapperNode [2022-04-27 17:02:49,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:02:49,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:02:49,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:02:49,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:02:49,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:02:49,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:02:49,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:02:49,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:02:49,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:02:49,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:02:49,375 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 17:02:49,395 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 17:02:49,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:02:49,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:02:49,428 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:02:49,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:02:49,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:02:49,428 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:02:49,428 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:02:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:02:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:02:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 17:02:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:02:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:02:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:02:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:02:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:02:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:02:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:02:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:02:49,484 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:02:49,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:02:49,615 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:02:49,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:02:49,632 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 17:02:49,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:02:49 BoogieIcfgContainer [2022-04-27 17:02:49,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:02:49,634 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:02:49,634 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:02:49,647 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:02:49,649 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:02:49" (1/1) ... [2022-04-27 17:02:49,651 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:02:50,108 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 17:02:50,108 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_2 (+ v_main_~y~0_3 1)) (not (= (mod |v_main_#t~nondet5_4| 4294967296) 0))) InVars {main_#t~nondet5=|v_main_#t~nondet5_4|, main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_3} OutVars{main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_2, main_#t~post6=|v_main_#t~post6_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_#t~nondet5, main_~z~0, main_~y~0, main_#t~post6, main_#t~post7] to Formula: (let ((.cse0 (= (mod |v_main_#t~nondet5_4| 4294967296) 0))) (or (and (= v_main_~z~0_3 v_main_~z~0_2) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~y~0_3 v_main_~y~0_2) .cse0 (= |v_main_#t~post7_3| |v_main_#t~post7_1|)) (and (= v_main_~y~0_2 (+ (* (- 1) v_main_~z~0_3) v_main_~y~0_3 v_main_~z~0_2)) (< v_main_~z~0_3 v_main_~z~0_2) (not .cse0)))) InVars {main_#t~nondet5=|v_main_#t~nondet5_4|, main_~y~0=v_main_~y~0_3, main_~z~0=v_main_~z~0_3, main_#t~post6=|v_main_#t~post6_3|, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~y~0=v_main_~y~0_2, main_~z~0=v_main_~z~0_2, main_#t~post6=|v_main_#t~post6_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_#t~nondet5, main_~z~0, main_~y~0, main_#t~post6, main_#t~post7] [2022-04-27 17:02:50,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:02:50 BasicIcfg [2022-04-27 17:02:50,112 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:02:50,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:02:50,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:02:50,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:02:50,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:02:49" (1/4) ... [2022-04-27 17:02:50,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c801a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:02:50, skipping insertion in model container [2022-04-27 17:02:50,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:02:49" (2/4) ... [2022-04-27 17:02:50,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c801a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:02:50, skipping insertion in model container [2022-04-27 17:02:50,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:02:49" (3/4) ... [2022-04-27 17:02:50,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c801a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:02:50, skipping insertion in model container [2022-04-27 17:02:50,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:02:50" (4/4) ... [2022-04-27 17:02:50,121 INFO L111 eAbstractionObserver]: Analyzing ICFG eq2.cJordan [2022-04-27 17:02:50,131 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:02:50,131 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:02:50,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:02:50,170 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@6e41c075, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72158c85 [2022-04-27 17:02:50,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:02:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 17:02:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 17:02:50,180 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:02:50,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:02:50,181 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:02:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:02:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1088827777, now seen corresponding path program 1 times [2022-04-27 17:02:50,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:02:50,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092176996] [2022-04-27 17:02:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:02:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:50,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:02:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:50,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [42] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select .cse1 1) 113) (= (select |v_#length_1| 3) 12) (= 101 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 2) 50))) 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] {22#true} is VALID [2022-04-27 17:02:50,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [45] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 17:02:50,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 17:02:50,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [40] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:02:50,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [42] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select .cse1 1) 113) (= (select |v_#length_1| 3) 12) (= 101 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 2) 50))) 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] {22#true} is VALID [2022-04-27 17:02:50,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [45] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 17:02:50,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 17:02:50,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [41] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 17:02:50,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [44] mainENTRY-->L16-2: Formula: (and (= (+ v_main_~x~0_1 1) v_main_~z~0_1) (= v_main_~y~0_1 (+ v_main_~w~0_1 1)) (= v_main_~w~0_1 |v_main_#t~nondet4_2|) (= v_main_~w~0_1 v_main_~x~0_1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~w~0=v_main_~w~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {22#true} is VALID [2022-04-27 17:02:50,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} [46] L16-2-->L16-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 17:02:50,302 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} [49] L16-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~y~0_5 4294967296) (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {23#false} is VALID [2022-04-27 17:02:50,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [51] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23#false} is VALID [2022-04-27 17:02:50,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [53] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 17:02:50,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [55] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 17:02:50,303 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 17:02:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:02:50,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092176996] [2022-04-27 17:02:50,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092176996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:02:50,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:02:50,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:02:50,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600042835] [2022-04-27 17:02:50,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:02:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 17:02:50,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:02:50,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:02:50,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:50,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:02:50,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:02:50,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:02:50,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:02:50,345 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:02:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:50,387 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 17:02:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:02:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 17:02:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:02:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:02:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-27 17:02:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:02:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-27 17:02:50,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-04-27 17:02:50,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:50,420 INFO L225 Difference]: With dead ends: 19 [2022-04-27 17:02:50,420 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 17:02:50,421 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 17:02:50,423 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 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 17:02:50,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 21 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:02:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 17:02:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 17:02:50,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:02:50,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 17:02:50,439 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 17:02:50,439 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 17:02:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:50,441 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 17:02:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 17:02:50,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:50,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:50,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 12 states. [2022-04-27 17:02:50,442 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 12 states. [2022-04-27 17:02:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:50,443 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 17:02:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 17:02:50,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:50,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:50,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:02:50,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:02:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 17:02:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 17:02:50,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 17:02:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:02:50,445 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 17:02:50,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:02:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 17:02:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 17:02:50,445 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:02:50,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:02:50,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:02:50,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:02:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:02:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1087904256, now seen corresponding path program 1 times [2022-04-27 17:02:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:02:50,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481800992] [2022-04-27 17:02:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:50,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:02:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:50,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:02:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:50,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {93#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [42] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select .cse1 1) 113) (= (select |v_#length_1| 3) 12) (= 101 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 2) 50))) 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] {85#true} is VALID [2022-04-27 17:02:50,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {85#true} [45] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#true} is VALID [2022-04-27 17:02:50,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85#true} {85#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#true} is VALID [2022-04-27 17:02:50,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {85#true} [40] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:02:50,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {93#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [42] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select .cse1 1) 113) (= (select |v_#length_1| 3) 12) (= 101 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 2) 50))) 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] {85#true} is VALID [2022-04-27 17:02:50,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {85#true} [45] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#true} is VALID [2022-04-27 17:02:50,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85#true} {85#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#true} is VALID [2022-04-27 17:02:50,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {85#true} [41] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#true} is VALID [2022-04-27 17:02:50,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {85#true} [44] mainENTRY-->L16-2: Formula: (and (= (+ v_main_~x~0_1 1) v_main_~z~0_1) (= v_main_~y~0_1 (+ v_main_~w~0_1 1)) (= v_main_~w~0_1 |v_main_#t~nondet4_2|) (= v_main_~w~0_1 v_main_~x~0_1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~w~0=v_main_~w~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {90#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-27 17:02:50,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0)))} [47] L16-2-->L16-3: Formula: (= (mod |v_main_#t~nondet5_2| 4294967296) 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {90#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-27 17:02:50,619 INFO L272 TraceCheckUtils]: 7: Hoare triple {90#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) 1)) (<= main_~y~0 main_~z~0) (<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0)))} [49] L16-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~y~0_5 4294967296) (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {91#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:02:50,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {91#(not (= |__VERIFIER_assert_#in~cond| 0))} [51] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {92#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:02:50,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {92#(not (= __VERIFIER_assert_~cond 0))} [53] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {86#false} is VALID [2022-04-27 17:02:50,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {86#false} [55] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#false} is VALID [2022-04-27 17:02:50,621 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 17:02:50,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:02:50,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481800992] [2022-04-27 17:02:50,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481800992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:02:50,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:02:50,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 17:02:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36702156] [2022-04-27 17:02:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:02:50,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 17:02:50,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:02:50,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:02:50,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:50,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 17:02:50,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:02:50,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 17:02:50,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:02:50,632 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:02:50,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:50,723 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-04-27 17:02:50,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 17:02:50,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 17:02:50,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:02:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:02:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-04-27 17:02:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:02:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-04-27 17:02:50,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2022-04-27 17:02:50,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:50,746 INFO L225 Difference]: With dead ends: 10 [2022-04-27 17:02:50,746 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 17:02:50,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 17:02:50,747 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:02:50,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:02:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 17:02:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 17:02:50,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:02:50,748 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 17:02:50,749 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 17:02:50,749 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 17:02:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:50,749 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:02:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:02:50,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:50,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:50,749 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 17:02:50,749 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 17:02:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:50,749 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:02:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:02:50,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:50,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:50,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:02:50,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:02:50,750 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 17:02:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 17:02:50,750 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-04-27 17:02:50,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:02:50,750 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 17:02:50,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:02:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:02:50,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:50,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 17:02:50,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 17:02:50,754 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 17:02:50,755 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 17:02:50,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:02:50 BasicIcfg [2022-04-27 17:02:50,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 17:02:50,757 INFO L158 Benchmark]: Toolchain (without parser) took 1653.11ms. Allocated memory was 192.9MB in the beginning and 244.3MB in the end (delta: 51.4MB). Free memory was 139.2MB in the beginning and 190.5MB in the end (delta: -51.2MB). Peak memory consumption was 674.4kB. Max. memory is 8.0GB. [2022-04-27 17:02:50,758 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 17:02:50,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.37ms. Allocated memory was 192.9MB in the beginning and 244.3MB in the end (delta: 51.4MB). Free memory was 139.0MB in the beginning and 214.8MB in the end (delta: -75.9MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-04-27 17:02:50,758 INFO L158 Benchmark]: Boogie Preprocessor took 28.89ms. Allocated memory is still 244.3MB. Free memory was 214.8MB in the beginning and 213.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 17:02:50,758 INFO L158 Benchmark]: RCFGBuilder took 281.32ms. Allocated memory is still 244.3MB. Free memory was 213.2MB in the beginning and 202.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 17:02:50,759 INFO L158 Benchmark]: IcfgTransformer took 478.02ms. Allocated memory is still 244.3MB. Free memory was 202.7MB in the beginning and 184.4MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-04-27 17:02:50,759 INFO L158 Benchmark]: TraceAbstraction took 643.25ms. Allocated memory is still 244.3MB. Free memory was 183.9MB in the beginning and 190.5MB in the end (delta: -6.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 17:02:50,760 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 3 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 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.10ms. Allocated memory is still 192.9MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.37ms. Allocated memory was 192.9MB in the beginning and 244.3MB in the end (delta: 51.4MB). Free memory was 139.0MB in the beginning and 214.8MB in the end (delta: -75.9MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.89ms. Allocated memory is still 244.3MB. Free memory was 214.8MB in the beginning and 213.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 281.32ms. Allocated memory is still 244.3MB. Free memory was 213.2MB in the beginning and 202.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 478.02ms. Allocated memory is still 244.3MB. Free memory was 202.7MB in the beginning and 184.4MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 643.25ms. Allocated memory is still 244.3MB. Free memory was 183.9MB in the beginning and 190.5MB in the end (delta: -6.6MB). There was no memory consumed. 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: 7]: 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 26 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 17:02:50,775 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...