/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 18:27:00,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 18:27:00,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 18:27:00,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 18:27:00,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 18:27:00,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 18:27:00,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 18:27:00,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 18:27:00,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 18:27:00,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 18:27:00,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 18:27:00,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 18:27:00,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 18:27:00,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 18:27:00,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 18:27:00,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 18:27:00,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 18:27:00,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 18:27:00,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 18:27:00,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 18:27:00,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 18:27:00,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 18:27:00,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 18:27:00,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 18:27:00,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 18:27:00,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 18:27:00,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 18:27:00,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 18:27:00,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 18:27:00,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 18:27:00,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 18:27:00,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 18:27:00,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 18:27:00,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 18:27:00,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 18:27:00,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 18:27:00,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 18:27:00,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 18:27:00,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 18:27:00,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 18:27:00,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 18:27:00,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 18:27:00,343 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 18:27:00,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 18:27:00,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 18:27:00,344 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 18:27:00,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 18:27:00,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 18:27:00,345 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 18:27:00,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 18:27:00,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 18:27:00,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 18:27:00,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 18:27:00,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 18:27:00,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 18:27:00,347 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 18:27:00,347 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 18:27:00,347 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 18:27:00,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 18:27:00,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 18:27:00,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 18:27:00,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 18:27:00,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 18:27:00,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:27:00,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 18:27:00,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 18:27:00,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 18:27:00,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 18:27:00,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 18:27:00,349 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 18:27:00,350 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 18:27:00,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 18:27:00,350 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 18:27:00,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 18:27:00,351 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 18:27:00,351 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 18:27:00,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 18:27:00,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 18:27:00,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 18:27:00,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 18:27:00,607 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 18:27:00,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2022-01-10 18:27:00,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3bff6eba/7e1845ce7bca4128b49803c794cdffd7/FLAG21194bb71 [2022-01-10 18:27:01,040 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 18:27:01,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2022-01-10 18:27:01,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3bff6eba/7e1845ce7bca4128b49803c794cdffd7/FLAG21194bb71 [2022-01-10 18:27:01,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3bff6eba/7e1845ce7bca4128b49803c794cdffd7 [2022-01-10 18:27:01,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 18:27:01,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 18:27:01,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 18:27:01,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 18:27:01,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 18:27:01,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249f35fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01, skipping insertion in model container [2022-01-10 18:27:01,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 18:27:01,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 18:27:01,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c[640,653] [2022-01-10 18:27:01,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:27:01,395 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 18:27:01,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c[640,653] [2022-01-10 18:27:01,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:27:01,469 INFO L208 MainTranslator]: Completed translation [2022-01-10 18:27:01,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01 WrapperNode [2022-01-10 18:27:01,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 18:27:01,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 18:27:01,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 18:27:01,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 18:27:01,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,525 INFO L137 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 30, calls inlined = 33, statements flattened = 406 [2022-01-10 18:27:01,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 18:27:01,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 18:27:01,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 18:27:01,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 18:27:01,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 18:27:01,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 18:27:01,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 18:27:01,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 18:27:01,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (1/1) ... [2022-01-10 18:27:01,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:27:01,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:27:01,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 18:27:01,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 18:27:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 18:27:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 18:27:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 18:27:01,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 18:27:01,746 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 18:27:01,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 18:27:02,160 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume 1bv32 == ~q_free~0;~c_dr_st~0 := 2bv32;~c_dr_pc~0 := 2bv32;~a_t~0 := do_read_c_~a~0#1; [2022-01-10 18:27:02,161 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(1bv32 == ~q_free~0); [2022-01-10 18:27:02,161 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 18:27:02,172 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 18:27:02,172 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 18:27:02,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:27:02 BoogieIcfgContainer [2022-01-10 18:27:02,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 18:27:02,175 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 18:27:02,175 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 18:27:02,177 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 18:27:02,179 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:27:02" (1/1) ... [2022-01-10 18:27:02,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:27:02 BasicIcfg [2022-01-10 18:27:02,303 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 18:27:02,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 18:27:02,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 18:27:02,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 18:27:02,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:27:01" (1/4) ... [2022-01-10 18:27:02,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff32b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:27:02, skipping insertion in model container [2022-01-10 18:27:02,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:01" (2/4) ... [2022-01-10 18:27:02,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff32b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:27:02, skipping insertion in model container [2022-01-10 18:27:02,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:27:02" (3/4) ... [2022-01-10 18:27:02,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff32b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:27:02, skipping insertion in model container [2022-01-10 18:27:02,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:27:02" (4/4) ... [2022-01-10 18:27:02,315 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.cTransformedIcfg [2022-01-10 18:27:02,319 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 18:27:02,319 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 18:27:02,350 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 18:27:02,355 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 18:27:02,356 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 18:27:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 141 states have (on average 1.574468085106383) internal successors, (222), 143 states have internal predecessors, (222), 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-01-10 18:27:02,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 18:27:02,375 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:02,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:02,376 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:02,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1070961291, now seen corresponding path program 1 times [2022-01-10 18:27:02,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:02,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652127758] [2022-01-10 18:27:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:02,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:27:02,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:02,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652127758] [2022-01-10 18:27:02,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652127758] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:02,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:02,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:02,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655957055] [2022-01-10 18:27:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:02,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:02,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:02,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:02,695 INFO L87 Difference]: Start difference. First operand has 144 states, 141 states have (on average 1.574468085106383) internal successors, (222), 143 states have internal predecessors, (222), 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 has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-10 18:27:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:02,837 INFO L93 Difference]: Finished difference Result 409 states and 634 transitions. [2022-01-10 18:27:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:02,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2022-01-10 18:27:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:02,853 INFO L225 Difference]: With dead ends: 409 [2022-01-10 18:27:02,854 INFO L226 Difference]: Without dead ends: 271 [2022-01-10 18:27:02,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:27:02,862 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 192 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:02,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 399 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 18:27:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-01-10 18:27:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 267. [2022-01-10 18:27:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 265 states have (on average 1.4943396226415093) internal successors, (396), 266 states have internal predecessors, (396), 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-01-10 18:27:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 396 transitions. [2022-01-10 18:27:02,922 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 396 transitions. Word has length 43 [2022-01-10 18:27:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:02,922 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 396 transitions. [2022-01-10 18:27:02,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-10 18:27:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 396 transitions. [2022-01-10 18:27:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 18:27:02,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:02,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:02,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 18:27:02,925 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:02,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:02,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1251981419, now seen corresponding path program 1 times [2022-01-10 18:27:02,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:02,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338683258] [2022-01-10 18:27:02,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:02,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:27:02,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:03,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338683258] [2022-01-10 18:27:03,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338683258] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:03,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:03,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:03,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568552102] [2022-01-10 18:27:03,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:03,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:03,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:03,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:03,003 INFO L87 Difference]: Start difference. First operand 267 states and 396 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-10 18:27:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:03,062 INFO L93 Difference]: Finished difference Result 685 states and 1008 transitions. [2022-01-10 18:27:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:03,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2022-01-10 18:27:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:03,065 INFO L225 Difference]: With dead ends: 685 [2022-01-10 18:27:03,065 INFO L226 Difference]: Without dead ends: 445 [2022-01-10 18:27:03,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:27:03,068 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 167 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:03,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 328 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-01-10 18:27:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 437. [2022-01-10 18:27:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 435 states have (on average 1.452873563218391) internal successors, (632), 436 states have internal predecessors, (632), 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-01-10 18:27:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 632 transitions. [2022-01-10 18:27:03,101 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 632 transitions. Word has length 43 [2022-01-10 18:27:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:03,102 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 632 transitions. [2022-01-10 18:27:03,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-10 18:27:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 632 transitions. [2022-01-10 18:27:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 18:27:03,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:03,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:03,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 18:27:03,109 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:03,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:03,109 INFO L85 PathProgramCache]: Analyzing trace with hash 535379124, now seen corresponding path program 1 times [2022-01-10 18:27:03,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:03,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173699033] [2022-01-10 18:27:03,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:03,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:27:03,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:03,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173699033] [2022-01-10 18:27:03,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173699033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:03,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:03,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:03,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788151898] [2022-01-10 18:27:03,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:03,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:03,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:03,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:03,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:03,187 INFO L87 Difference]: Start difference. First operand 437 states and 632 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-01-10 18:27:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:03,250 INFO L93 Difference]: Finished difference Result 1159 states and 1679 transitions. [2022-01-10 18:27:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:03,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) Word has length 44 [2022-01-10 18:27:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:03,254 INFO L225 Difference]: With dead ends: 1159 [2022-01-10 18:27:03,254 INFO L226 Difference]: Without dead ends: 763 [2022-01-10 18:27:03,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:27:03,265 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 151 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:03,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 325 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:03,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2022-01-10 18:27:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 755. [2022-01-10 18:27:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 753 states have (on average 1.4223107569721116) internal successors, (1071), 754 states have internal predecessors, (1071), 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-01-10 18:27:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1071 transitions. [2022-01-10 18:27:03,310 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1071 transitions. Word has length 44 [2022-01-10 18:27:03,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:03,310 INFO L470 AbstractCegarLoop]: Abstraction has 755 states and 1071 transitions. [2022-01-10 18:27:03,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-01-10 18:27:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1071 transitions. [2022-01-10 18:27:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 18:27:03,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:03,314 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:03,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 18:27:03,314 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:03,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:03,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1319782809, now seen corresponding path program 1 times [2022-01-10 18:27:03,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:03,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060701926] [2022-01-10 18:27:03,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:03,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 18:27:03,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:03,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060701926] [2022-01-10 18:27:03,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060701926] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:03,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:03,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:03,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065017410] [2022-01-10 18:27:03,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:03,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:03,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:03,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:03,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:03,391 INFO L87 Difference]: Start difference. First operand 755 states and 1071 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-10 18:27:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:03,492 INFO L93 Difference]: Finished difference Result 1846 states and 2611 transitions. [2022-01-10 18:27:03,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:03,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) Word has length 58 [2022-01-10 18:27:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:03,497 INFO L225 Difference]: With dead ends: 1846 [2022-01-10 18:27:03,497 INFO L226 Difference]: Without dead ends: 1131 [2022-01-10 18:27:03,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:27:03,507 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 153 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:03,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 350 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-01-10 18:27:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1127. [2022-01-10 18:27:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1125 states have (on average 1.4035555555555554) internal successors, (1579), 1126 states have internal predecessors, (1579), 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-01-10 18:27:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1579 transitions. [2022-01-10 18:27:03,558 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1579 transitions. Word has length 58 [2022-01-10 18:27:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:03,558 INFO L470 AbstractCegarLoop]: Abstraction has 1127 states and 1579 transitions. [2022-01-10 18:27:03,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-10 18:27:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1579 transitions. [2022-01-10 18:27:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 18:27:03,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:03,560 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:03,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 18:27:03,560 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:03,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash 791507560, now seen corresponding path program 1 times [2022-01-10 18:27:03,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:03,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104216117] [2022-01-10 18:27:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:03,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 18:27:03,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:03,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104216117] [2022-01-10 18:27:03,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104216117] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:03,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:03,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:03,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995377677] [2022-01-10 18:27:03,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:03,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:03,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:03,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:03,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:03,660 INFO L87 Difference]: Start difference. First operand 1127 states and 1579 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-01-10 18:27:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:03,778 INFO L93 Difference]: Finished difference Result 3175 states and 4430 transitions. [2022-01-10 18:27:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:03,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) Word has length 58 [2022-01-10 18:27:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:03,788 INFO L225 Difference]: With dead ends: 3175 [2022-01-10 18:27:03,788 INFO L226 Difference]: Without dead ends: 2133 [2022-01-10 18:27:03,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:27:03,790 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 135 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:03,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 355 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2022-01-10 18:27:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2129. [2022-01-10 18:27:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 2127 states have (on average 1.3671838269863659) internal successors, (2908), 2128 states have internal predecessors, (2908), 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-01-10 18:27:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2908 transitions. [2022-01-10 18:27:03,871 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2908 transitions. Word has length 58 [2022-01-10 18:27:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:03,874 INFO L470 AbstractCegarLoop]: Abstraction has 2129 states and 2908 transitions. [2022-01-10 18:27:03,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-01-10 18:27:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2908 transitions. [2022-01-10 18:27:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 18:27:03,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:03,882 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:03,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 18:27:03,883 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:03,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash 480961134, now seen corresponding path program 1 times [2022-01-10 18:27:03,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:03,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466759445] [2022-01-10 18:27:03,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:03,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:27:03,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:03,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466759445] [2022-01-10 18:27:03,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466759445] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:03,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:03,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:03,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699253471] [2022-01-10 18:27:03,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:03,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:03,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:03,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:03,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:03,976 INFO L87 Difference]: Start difference. First operand 2129 states and 2908 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-01-10 18:27:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:04,132 INFO L93 Difference]: Finished difference Result 6063 states and 8280 transitions. [2022-01-10 18:27:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) Word has length 60 [2022-01-10 18:27:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:04,150 INFO L225 Difference]: With dead ends: 6063 [2022-01-10 18:27:04,151 INFO L226 Difference]: Without dead ends: 4085 [2022-01-10 18:27:04,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:27:04,157 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 146 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:04,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 518 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2022-01-10 18:27:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 4085. [2022-01-10 18:27:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 4083 states have (on average 1.3470487386725447) internal successors, (5500), 4084 states have internal predecessors, (5500), 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-01-10 18:27:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5500 transitions. [2022-01-10 18:27:04,340 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5500 transitions. Word has length 60 [2022-01-10 18:27:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:04,341 INFO L470 AbstractCegarLoop]: Abstraction has 4085 states and 5500 transitions. [2022-01-10 18:27:04,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-01-10 18:27:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5500 transitions. [2022-01-10 18:27:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-10 18:27:04,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:04,350 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:04,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 18:27:04,350 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1027101923, now seen corresponding path program 1 times [2022-01-10 18:27:04,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:04,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661181872] [2022-01-10 18:27:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:04,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 18:27:04,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:04,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661181872] [2022-01-10 18:27:04,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661181872] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:04,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:04,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:04,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246515829] [2022-01-10 18:27:04,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:04,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:04,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:04,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:04,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:04,446 INFO L87 Difference]: Start difference. First operand 4085 states and 5500 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-01-10 18:27:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:04,702 INFO L93 Difference]: Finished difference Result 11701 states and 15824 transitions. [2022-01-10 18:27:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:04,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) Word has length 102 [2022-01-10 18:27:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:04,794 INFO L225 Difference]: With dead ends: 11701 [2022-01-10 18:27:04,794 INFO L226 Difference]: Without dead ends: 7893 [2022-01-10 18:27:04,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:27:04,802 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 131 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:04,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 335 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7893 states. [2022-01-10 18:27:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7893 to 7889. [2022-01-10 18:27:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7889 states, 7887 states have (on average 1.3394192975782935) internal successors, (10564), 7888 states have internal predecessors, (10564), 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-01-10 18:27:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7889 states to 7889 states and 10564 transitions. [2022-01-10 18:27:05,126 INFO L78 Accepts]: Start accepts. Automaton has 7889 states and 10564 transitions. Word has length 102 [2022-01-10 18:27:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:05,127 INFO L470 AbstractCegarLoop]: Abstraction has 7889 states and 10564 transitions. [2022-01-10 18:27:05,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-01-10 18:27:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7889 states and 10564 transitions. [2022-01-10 18:27:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 18:27:05,141 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:05,141 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:05,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 18:27:05,142 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash -424723680, now seen corresponding path program 1 times [2022-01-10 18:27:05,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:05,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974835780] [2022-01-10 18:27:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:05,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:27:05,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:05,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974835780] [2022-01-10 18:27:05,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974835780] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:05,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:05,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:05,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225849796] [2022-01-10 18:27:05,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:05,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:05,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:05,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:05,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:05,208 INFO L87 Difference]: Start difference. First operand 7889 states and 10564 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-01-10 18:27:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:05,473 INFO L93 Difference]: Finished difference Result 11741 states and 15828 transitions. [2022-01-10 18:27:05,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:05,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) Word has length 103 [2022-01-10 18:27:05,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:05,475 INFO L225 Difference]: With dead ends: 11741 [2022-01-10 18:27:05,475 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 18:27:05,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:27:05,488 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 112 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:05,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 457 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 18:27:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 18:27:05,491 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-01-10 18:27:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 18:27:05,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2022-01-10 18:27:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:05,493 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 18:27:05,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-01-10 18:27:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 18:27:05,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 18:27:05,496 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 18:27:05,496 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 18:27:05,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 18:27:05,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 18:27:07,755 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 18:27:07,755 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 18:27:07,755 INFO L854 garLoopResultBuilder]: At program point L551(lines 535 553) the Hoare annotation is: (and (= 0 ~p_dw_st~0Int) (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0) (= (+ ~q_write_ev~0Int (* (- 1) ~q_read_ev~0Int)) 0) (<= 2 ~q_write_ev~0Int)) [2022-01-10 18:27:07,755 INFO L858 garLoopResultBuilder]: For program point L258(lines 258 264) no Hoare annotation was computed. [2022-01-10 18:27:07,756 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2022-01-10 18:27:07,756 INFO L854 garLoopResultBuilder]: At program point L258-2(lines 254 268) the Hoare annotation is: (and (= 0 ~p_dw_st~0Int) (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,756 INFO L858 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2022-01-10 18:27:07,756 INFO L858 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-01-10 18:27:07,756 INFO L858 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2022-01-10 18:27:07,756 INFO L858 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2022-01-10 18:27:07,756 INFO L854 garLoopResultBuilder]: At program point L49(lines 32 51) the Hoare annotation is: (and (= 0 ~p_dw_st~0Int) (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,757 INFO L854 garLoopResultBuilder]: At program point L278-1(lines 269 286) the Hoare annotation is: (and (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,757 INFO L858 garLoopResultBuilder]: For program point L311(lines 311 315) no Hoare annotation was computed. [2022-01-10 18:27:07,757 INFO L858 garLoopResultBuilder]: For program point L311-2(lines 310 323) no Hoare annotation was computed. [2022-01-10 18:27:07,757 INFO L854 garLoopResultBuilder]: At program point L316-1(lines 307 324) the Hoare annotation is: (and (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,757 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-01-10 18:27:07,757 INFO L858 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2022-01-10 18:27:07,757 INFO L858 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2022-01-10 18:27:07,757 INFO L854 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (and (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,757 INFO L858 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2022-01-10 18:27:07,757 INFO L858 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2022-01-10 18:27:07,758 INFO L854 garLoopResultBuilder]: At program point L88(lines 62 90) the Hoare annotation is: (and (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,758 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2022-01-10 18:27:07,758 INFO L858 garLoopResultBuilder]: For program point L387-2(lines 387 391) no Hoare annotation was computed. [2022-01-10 18:27:07,758 INFO L858 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2022-01-10 18:27:07,758 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2022-01-10 18:27:07,758 INFO L858 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2022-01-10 18:27:07,758 INFO L854 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (and (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,758 INFO L858 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2022-01-10 18:27:07,758 INFO L858 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2022-01-10 18:27:07,759 INFO L854 garLoopResultBuilder]: At program point L117(lines 91 119) the Hoare annotation is: (and (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,759 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-01-10 18:27:07,759 INFO L854 garLoopResultBuilder]: At program point L395-2(lines 379 403) the Hoare annotation is: (and (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,759 INFO L858 garLoopResultBuilder]: For program point L329(lines 329 333) no Hoare annotation was computed. [2022-01-10 18:27:07,759 INFO L858 garLoopResultBuilder]: For program point L329-2(lines 328 341) no Hoare annotation was computed. [2022-01-10 18:27:07,759 INFO L854 garLoopResultBuilder]: At program point L334-1(lines 325 342) the Hoare annotation is: (and (<= 2 ~slow_clk_edge~0Int) (= ~p_dw_pc~0Int 0) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,759 INFO L854 garLoopResultBuilder]: At program point L491-2(lines 491 528) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,759 INFO L861 garLoopResultBuilder]: At program point L529(lines 476 534) the Hoare annotation is: true [2022-01-10 18:27:07,759 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-01-10 18:27:07,759 INFO L861 garLoopResultBuilder]: At program point L563(lines 554 565) the Hoare annotation is: true [2022-01-10 18:27:07,760 INFO L854 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,760 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 18:27:07,760 INFO L854 garLoopResultBuilder]: At program point L451(lines 404 456) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,760 INFO L858 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-01-10 18:27:07,760 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 18:27:07,760 INFO L858 garLoopResultBuilder]: For program point L258-3(lines 258 264) no Hoare annotation was computed. [2022-01-10 18:27:07,760 INFO L858 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2022-01-10 18:27:07,760 INFO L858 garLoopResultBuilder]: For program point L36-3(lines 36 40) no Hoare annotation was computed. [2022-01-10 18:27:07,760 INFO L854 garLoopResultBuilder]: At program point L258-5(lines 254 268) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,760 INFO L854 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,760 INFO L858 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2022-01-10 18:27:07,761 INFO L858 garLoopResultBuilder]: For program point L36-5(lines 35 50) no Hoare annotation was computed. [2022-01-10 18:27:07,761 INFO L858 garLoopResultBuilder]: For program point L311-3(lines 311 315) no Hoare annotation was computed. [2022-01-10 18:27:07,761 INFO L854 garLoopResultBuilder]: At program point L304(lines 287 306) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,761 INFO L858 garLoopResultBuilder]: For program point L41-3(lines 41 45) no Hoare annotation was computed. [2022-01-10 18:27:07,761 INFO L858 garLoopResultBuilder]: For program point L311-5(lines 310 323) no Hoare annotation was computed. [2022-01-10 18:27:07,761 INFO L858 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-01-10 18:27:07,761 INFO L854 garLoopResultBuilder]: At program point L49-1(lines 32 51) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,761 INFO L854 garLoopResultBuilder]: At program point L316-3(lines 307 324) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,761 INFO L858 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2022-01-10 18:27:07,761 INFO L858 garLoopResultBuilder]: For program point L66-3(lines 66 75) no Hoare annotation was computed. [2022-01-10 18:27:07,761 INFO L858 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2022-01-10 18:27:07,762 INFO L858 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2022-01-10 18:27:07,762 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 67 72) no Hoare annotation was computed. [2022-01-10 18:27:07,762 INFO L858 garLoopResultBuilder]: For program point L66-5(lines 65 89) no Hoare annotation was computed. [2022-01-10 18:27:07,762 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2022-01-10 18:27:07,762 INFO L858 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2022-01-10 18:27:07,762 INFO L854 garLoopResultBuilder]: At program point L87-1(lines 65 89) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,762 INFO L858 garLoopResultBuilder]: For program point L77-1(lines 77 82) no Hoare annotation was computed. [2022-01-10 18:27:07,762 INFO L858 garLoopResultBuilder]: For program point L76-3(lines 76 85) no Hoare annotation was computed. [2022-01-10 18:27:07,762 INFO L854 garLoopResultBuilder]: At program point L164-1(lines 148 192) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,762 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-01-10 18:27:07,762 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-01-10 18:27:07,762 INFO L854 garLoopResultBuilder]: At program point L88-1(lines 62 90) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,763 INFO L854 garLoopResultBuilder]: At program point L188(lines 145 193) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,763 INFO L858 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2022-01-10 18:27:07,763 INFO L854 garLoopResultBuilder]: At program point L153(lines 148 192) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,763 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2022-01-10 18:27:07,763 INFO L861 garLoopResultBuilder]: At program point L234-1(lines 198 252) the Hoare annotation is: true [2022-01-10 18:27:07,763 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2022-01-10 18:27:07,763 INFO L858 garLoopResultBuilder]: For program point L387-3(lines 387 391) no Hoare annotation was computed. [2022-01-10 18:27:07,763 INFO L854 garLoopResultBuilder]: At program point L171(lines 148 192) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,763 INFO L854 garLoopResultBuilder]: At program point L248(lines 195 253) the Hoare annotation is: (and (= ~c_dr_pc~0Int 1) (<= 2 ~c_dr_st~0Int)) [2022-01-10 18:27:07,764 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-01-10 18:27:07,764 INFO L854 garLoopResultBuilder]: At program point L203(lines 198 252) the Hoare annotation is: false [2022-01-10 18:27:07,764 INFO L858 garLoopResultBuilder]: For program point L387-5(lines 387 391) no Hoare annotation was computed. [2022-01-10 18:27:07,764 INFO L858 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2022-01-10 18:27:07,764 INFO L858 garLoopResultBuilder]: For program point L95-3(lines 95 104) no Hoare annotation was computed. [2022-01-10 18:27:07,764 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2022-01-10 18:27:07,764 INFO L858 garLoopResultBuilder]: For program point L96-1(lines 96 101) no Hoare annotation was computed. [2022-01-10 18:27:07,764 INFO L858 garLoopResultBuilder]: For program point L95-5(lines 94 118) no Hoare annotation was computed. [2022-01-10 18:27:07,764 INFO L858 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2022-01-10 18:27:07,764 INFO L858 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-01-10 18:27:07,764 INFO L854 garLoopResultBuilder]: At program point L116-1(lines 94 118) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,765 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 106 111) no Hoare annotation was computed. [2022-01-10 18:27:07,765 INFO L858 garLoopResultBuilder]: For program point L105-3(lines 105 114) no Hoare annotation was computed. [2022-01-10 18:27:07,765 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-01-10 18:27:07,765 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-10 18:27:07,765 INFO L854 garLoopResultBuilder]: At program point L20-1(lines 15 22) the Hoare annotation is: false [2022-01-10 18:27:07,765 INFO L854 garLoopResultBuilder]: At program point L117-1(lines 91 119) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,765 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-10 18:27:07,765 INFO L854 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2022-01-10 18:27:07,765 INFO L858 garLoopResultBuilder]: For program point L395-3(lines 395 399) no Hoare annotation was computed. [2022-01-10 18:27:07,765 INFO L854 garLoopResultBuilder]: At program point L395-5(lines 379 403) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,766 INFO L858 garLoopResultBuilder]: For program point L329-3(lines 329 333) no Hoare annotation was computed. [2022-01-10 18:27:07,766 INFO L858 garLoopResultBuilder]: For program point L329-5(lines 328 341) no Hoare annotation was computed. [2022-01-10 18:27:07,766 INFO L854 garLoopResultBuilder]: At program point L334-3(lines 325 342) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,766 INFO L858 garLoopResultBuilder]: For program point L291-1(lines 291 301) no Hoare annotation was computed. [2022-01-10 18:27:07,766 INFO L854 garLoopResultBuilder]: At program point L303-1(lines 290 305) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,766 INFO L858 garLoopResultBuilder]: For program point L295-1(lines 295 300) no Hoare annotation was computed. [2022-01-10 18:27:07,766 INFO L854 garLoopResultBuilder]: At program point L304-1(lines 287 306) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,766 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2022-01-10 18:27:07,766 INFO L858 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2022-01-10 18:27:07,766 INFO L858 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2022-01-10 18:27:07,767 INFO L854 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,767 INFO L858 garLoopResultBuilder]: For program point L291-2(lines 291 301) no Hoare annotation was computed. [2022-01-10 18:27:07,767 INFO L858 garLoopResultBuilder]: For program point L66-6(lines 66 75) no Hoare annotation was computed. [2022-01-10 18:27:07,767 INFO L854 garLoopResultBuilder]: At program point L303-2(lines 290 305) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,767 INFO L858 garLoopResultBuilder]: For program point L295-2(lines 295 300) no Hoare annotation was computed. [2022-01-10 18:27:07,767 INFO L858 garLoopResultBuilder]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2022-01-10 18:27:07,767 INFO L858 garLoopResultBuilder]: For program point L66-8(lines 65 89) no Hoare annotation was computed. [2022-01-10 18:27:07,767 INFO L854 garLoopResultBuilder]: At program point L304-2(lines 287 306) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,767 INFO L854 garLoopResultBuilder]: At program point L87-2(lines 65 89) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,767 INFO L858 garLoopResultBuilder]: For program point L77-2(lines 77 82) no Hoare annotation was computed. [2022-01-10 18:27:07,767 INFO L858 garLoopResultBuilder]: For program point L76-5(lines 76 85) no Hoare annotation was computed. [2022-01-10 18:27:07,768 INFO L858 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2022-01-10 18:27:07,768 INFO L854 garLoopResultBuilder]: At program point L88-2(lines 62 90) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,768 INFO L854 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,768 INFO L858 garLoopResultBuilder]: For program point L387-6(lines 387 391) no Hoare annotation was computed. [2022-01-10 18:27:07,768 INFO L854 garLoopResultBuilder]: At program point L473(lines 457 475) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,768 INFO L858 garLoopResultBuilder]: For program point L387-8(lines 387 391) no Hoare annotation was computed. [2022-01-10 18:27:07,768 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-01-10 18:27:07,768 INFO L858 garLoopResultBuilder]: For program point L95-6(lines 95 104) no Hoare annotation was computed. [2022-01-10 18:27:07,768 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 96 101) no Hoare annotation was computed. [2022-01-10 18:27:07,768 INFO L858 garLoopResultBuilder]: For program point L95-8(lines 94 118) no Hoare annotation was computed. [2022-01-10 18:27:07,768 INFO L854 garLoopResultBuilder]: At program point L116-2(lines 94 118) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,769 INFO L858 garLoopResultBuilder]: For program point L106-2(lines 106 111) no Hoare annotation was computed. [2022-01-10 18:27:07,769 INFO L858 garLoopResultBuilder]: For program point L105-5(lines 105 114) no Hoare annotation was computed. [2022-01-10 18:27:07,769 INFO L854 garLoopResultBuilder]: At program point L117-2(lines 91 119) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,769 INFO L858 garLoopResultBuilder]: For program point L395-6(lines 395 399) no Hoare annotation was computed. [2022-01-10 18:27:07,769 INFO L854 garLoopResultBuilder]: At program point L395-8(lines 379 403) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,769 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-01-10 18:27:07,769 INFO L858 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2022-01-10 18:27:07,769 INFO L854 garLoopResultBuilder]: At program point L370-1(lines 361 378) the Hoare annotation is: (or (= ~c_dr_pc~0Int 1) (<= ~c_dr_pc~0Int 0)) [2022-01-10 18:27:07,772 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:07,773 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 18:27:07,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:27:07 BasicIcfg [2022-01-10 18:27:07,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 18:27:07,804 INFO L158 Benchmark]: Toolchain (without parser) took 6740.66ms. Allocated memory was 194.0MB in the beginning and 371.2MB in the end (delta: 177.2MB). Free memory was 135.4MB in the beginning and 201.7MB in the end (delta: -66.3MB). Peak memory consumption was 220.4MB. Max. memory is 8.0GB. [2022-01-10 18:27:07,804 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 18:27:07,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.93ms. Allocated memory was 194.0MB in the beginning and 292.6MB in the end (delta: 98.6MB). Free memory was 135.3MB in the beginning and 261.4MB in the end (delta: -126.1MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-01-10 18:27:07,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.33ms. Allocated memory is still 292.6MB. Free memory was 261.4MB in the beginning and 258.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 18:27:07,805 INFO L158 Benchmark]: Boogie Preprocessor took 32.15ms. Allocated memory is still 292.6MB. Free memory was 258.8MB in the beginning and 257.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 18:27:07,805 INFO L158 Benchmark]: RCFGBuilder took 616.06ms. Allocated memory is still 292.6MB. Free memory was 256.7MB in the beginning and 236.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-01-10 18:27:07,805 INFO L158 Benchmark]: IcfgTransformer took 128.16ms. Allocated memory is still 292.6MB. Free memory was 236.2MB in the beginning and 227.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-10 18:27:07,805 INFO L158 Benchmark]: TraceAbstraction took 5498.64ms. Allocated memory was 292.6MB in the beginning and 371.2MB in the end (delta: 78.6MB). Free memory was 226.8MB in the beginning and 201.7MB in the end (delta: 25.1MB). Peak memory consumption was 213.6MB. Max. memory is 8.0GB. [2022-01-10 18:27:07,807 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 405.93ms. Allocated memory was 194.0MB in the beginning and 292.6MB in the end (delta: 98.6MB). Free memory was 135.3MB in the beginning and 261.4MB in the end (delta: -126.1MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.33ms. Allocated memory is still 292.6MB. Free memory was 261.4MB in the beginning and 258.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.15ms. Allocated memory is still 292.6MB. Free memory was 258.8MB in the beginning and 257.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 616.06ms. Allocated memory is still 292.6MB. Free memory was 256.7MB in the beginning and 236.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * IcfgTransformer took 128.16ms. Allocated memory is still 292.6MB. Free memory was 236.2MB in the beginning and 227.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5498.64ms. Allocated memory was 292.6MB in the beginning and 371.2MB in the end (delta: 78.6MB). Free memory was 226.8MB in the beginning and 201.7MB in the end (delta: 25.1MB). Peak memory consumption was 213.6MB. 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 - 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 1 procedures, 144 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1187 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1187 mSDsluCounter, 3067 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1267 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 1800 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7889occurred in iteration=7, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 49 LocationsWithAnnotation, 49 PreInvPairs, 2912 NumberOfFragments, 359 HoareAnnotationTreeSize, 49 FomulaSimplifications, 38144 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 49 FomulaSimplificationsInter, 2046 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 503 ConstructedInterpolants, 0 QuantifiedInterpolants, 1063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 81/81 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 2 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (~bvule32(2bv32, slow_clk_edge) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((p_dw_st == 0bv32 && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: (~bvule32(2bv32, slow_clk_edge) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (~bvule32(2bv32, slow_clk_edge) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: (~bvule32(2bv32, slow_clk_edge) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: (~bvule32(2bv32, slow_clk_edge) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (~bvule32(2bv32, slow_clk_edge) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((~bvule32(2bv32, q_write_ev) && 0bv65 == ~bvadd16(~zero_extendFrom32To65(q_write_ev), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(q_read_ev), 18446744073709551615bv64)))) && p_dw_st == 0bv32) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (~bvule32(2bv32, slow_clk_edge) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((p_dw_st == 0bv32 && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (~bvule32(2bv32, slow_clk_edge) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ~bvule32(2bv32, c_dr_st) && c_dr_pc == 1bv32 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: c_dr_pc == 1bv32 || ~bvule32(c_dr_pc, 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 18:27:07,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...