/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_BITWISE.epf -i ../../../trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 13:36:39,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 13:36:39,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 13:36:39,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 13:36:39,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 13:36:39,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 13:36:39,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 13:36:39,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 13:36:39,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 13:36:39,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 13:36:39,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 13:36:39,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 13:36:39,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 13:36:39,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 13:36:39,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 13:36:39,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 13:36:39,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 13:36:39,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 13:36:39,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 13:36:39,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 13:36:39,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 13:36:39,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 13:36:39,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 13:36:39,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 13:36:39,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 13:36:39,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 13:36:39,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 13:36:39,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 13:36:39,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 13:36:39,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 13:36:39,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 13:36:39,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 13:36:39,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 13:36:39,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 13:36:39,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 13:36:39,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 13:36:39,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 13:36:39,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 13:36:39,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 13:36:39,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 13:36:39,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 13:36:39,692 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 13:36:39,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 13:36:39,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 13:36:39,706 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 13:36:39,706 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 13:36:39,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 13:36:39,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 13:36:39,707 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 13:36:39,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 13:36:39,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 13:36:39,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 13:36:39,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 13:36:39,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 13:36:39,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 13:36:39,708 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 13:36:39,708 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 13:36:39,708 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 13:36:39,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 13:36:39,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 13:36:39,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 13:36:39,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 13:36:39,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 13:36:39,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 13:36:39,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 13:36:39,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 13:36:39,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 13:36:39,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 13:36:39,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 13:36:39,709 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 13:36:39,709 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 13:36:39,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 13:36:39,710 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 13:36:39,710 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 13:36:39,710 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 13:36:39,710 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 13:36:39,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 13:36:39,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 13:36:39,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 13:36:39,890 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 13:36:39,890 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 13:36:39,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c [2022-01-10 13:36:39,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a517295cf/2835f96e9c184bb1803ffdaf2ab78917/FLAGb30e1162c [2022-01-10 13:36:40,617 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 13:36:40,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c [2022-01-10 13:36:40,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a517295cf/2835f96e9c184bb1803ffdaf2ab78917/FLAGb30e1162c [2022-01-10 13:36:40,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a517295cf/2835f96e9c184bb1803ffdaf2ab78917 [2022-01-10 13:36:40,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 13:36:40,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 13:36:40,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 13:36:40,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 13:36:40,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 13:36:40,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:36:40" (1/1) ... [2022-01-10 13:36:40,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5284faf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:40, skipping insertion in model container [2022-01-10 13:36:40,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:36:40" (1/1) ... [2022-01-10 13:36:40,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 13:36:41,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 13:36:42,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2022-01-10 13:36:42,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2022-01-10 13:36:42,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 13:36:42,570 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 13:36:43,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2022-01-10 13:36:43,179 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2022-01-10 13:36:43,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 13:36:43,231 INFO L208 MainTranslator]: Completed translation [2022-01-10 13:36:43,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43 WrapperNode [2022-01-10 13:36:43,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 13:36:43,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 13:36:43,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 13:36:43,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 13:36:43,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (1/1) ... [2022-01-10 13:36:43,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (1/1) ... [2022-01-10 13:36:43,677 INFO L137 Inliner]: procedures = 47, calls = 45, calls flagged for inlining = 40, calls inlined = 49, statements flattened = 12752 [2022-01-10 13:36:43,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 13:36:43,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 13:36:43,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 13:36:43,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 13:36:43,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (1/1) ... [2022-01-10 13:36:43,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (1/1) ... [2022-01-10 13:36:43,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (1/1) ... [2022-01-10 13:36:43,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (1/1) ... [2022-01-10 13:36:43,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (1/1) ... [2022-01-10 13:36:43,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (1/1) ... [2022-01-10 13:36:43,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (1/1) ... [2022-01-10 13:36:44,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 13:36:44,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 13:36:44,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 13:36:44,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 13:36:44,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (1/1) ... [2022-01-10 13:36:44,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 13:36:44,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 13:36:44,064 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 13:36:44,069 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 13:36:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 13:36:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 13:36:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 13:36:44,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 13:36:44,172 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 13:36:44,173 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 13:36:50,953 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 13:36:50,975 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 13:36:50,975 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 13:36:50,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:36:50 BoogieIcfgContainer [2022-01-10 13:36:50,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 13:36:50,981 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 13:36:50,981 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 13:36:50,996 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 13:36:50,998 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:36:50" (1/1) ... [2022-01-10 13:36:52,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 01:36:52 BasicIcfg [2022-01-10 13:36:52,156 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 13:36:52,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 13:36:52,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 13:36:52,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 13:36:52,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:36:40" (1/4) ... [2022-01-10 13:36:52,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59118ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:36:52, skipping insertion in model container [2022-01-10 13:36:52,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:43" (2/4) ... [2022-01-10 13:36:52,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59118ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:36:52, skipping insertion in model container [2022-01-10 13:36:52,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:36:50" (3/4) ... [2022-01-10 13:36:52,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59118ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:36:52, skipping insertion in model container [2022-01-10 13:36:52,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 01:36:52" (4/4) ... [2022-01-10 13:36:52,161 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.01.cil-2.cTransformedIcfg [2022-01-10 13:36:52,166 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 13:36:52,166 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 13:36:52,208 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 13:36:52,214 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 13:36:52,214 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 13:36:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 2344 states, 2340 states have (on average 1.8495726495726497) internal successors, (4328), 2343 states have internal predecessors, (4328), 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 13:36:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 13:36:52,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:52,255 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 13:36:52,256 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 826356496, now seen corresponding path program 1 times [2022-01-10 13:36:52,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:52,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441326052] [2022-01-10 13:36:52,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:52,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:52,467 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 13:36:52,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:52,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441326052] [2022-01-10 13:36:52,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441326052] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:52,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:52,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:36:52,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009811085] [2022-01-10 13:36:52,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:52,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:52,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:52,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:52,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:52,506 INFO L87 Difference]: Start difference. First operand has 2344 states, 2340 states have (on average 1.8495726495726497) internal successors, (4328), 2343 states have internal predecessors, (4328), 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.666666666666666) internal successors, (44), 2 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 13:36:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:52,848 INFO L93 Difference]: Finished difference Result 4790 states and 8814 transitions. [2022-01-10 13:36:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:52,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:52,868 INFO L225 Difference]: With dead ends: 4790 [2022-01-10 13:36:52,868 INFO L226 Difference]: Without dead ends: 2384 [2022-01-10 13:36:52,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:36:52,877 INFO L933 BasicCegarLoop]: 4247 mSDtfsCounter, 4217 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4217 SdHoareTripleChecker+Valid, 4426 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:52,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4217 Valid, 4426 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2022-01-10 13:36:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2380. [2022-01-10 13:36:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2377 states have (on average 1.824989482541018) internal successors, (4338), 2379 states have internal predecessors, (4338), 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 13:36:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 4338 transitions. [2022-01-10 13:36:52,978 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 4338 transitions. Word has length 44 [2022-01-10 13:36:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:52,978 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 4338 transitions. [2022-01-10 13:36:52,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 4338 transitions. [2022-01-10 13:36:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 13:36:52,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:52,980 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 13:36:52,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 13:36:52,980 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:52,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1932184880, now seen corresponding path program 1 times [2022-01-10 13:36:52,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:52,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993263264] [2022-01-10 13:36:52,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:52,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:53,014 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 13:36:53,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:53,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993263264] [2022-01-10 13:36:53,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993263264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:53,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:53,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:36:53,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803976270] [2022-01-10 13:36:53,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:53,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:53,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:53,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:53,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:53,017 INFO L87 Difference]: Start difference. First operand 2380 states and 4338 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:53,060 INFO L93 Difference]: Finished difference Result 2630 states and 4706 transitions. [2022-01-10 13:36:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:53,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:53,068 INFO L225 Difference]: With dead ends: 2630 [2022-01-10 13:36:53,068 INFO L226 Difference]: Without dead ends: 2380 [2022-01-10 13:36:53,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:36:53,070 INFO L933 BasicCegarLoop]: 4174 mSDtfsCounter, 4170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4170 SdHoareTripleChecker+Valid, 4174 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:53,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4170 Valid, 4174 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-01-10 13:36:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2022-01-10 13:36:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2377 states have (on average 1.821623895666807) internal successors, (4330), 2379 states have internal predecessors, (4330), 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 13:36:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 4330 transitions. [2022-01-10 13:36:53,111 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 4330 transitions. Word has length 44 [2022-01-10 13:36:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:53,111 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 4330 transitions. [2022-01-10 13:36:53,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 4330 transitions. [2022-01-10 13:36:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 13:36:53,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:53,126 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 13:36:53,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 13:36:53,127 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:53,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1634373872, now seen corresponding path program 1 times [2022-01-10 13:36:53,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:53,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144778235] [2022-01-10 13:36:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:53,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:53,157 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 13:36:53,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:53,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144778235] [2022-01-10 13:36:53,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144778235] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:53,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:53,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:36:53,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402097221] [2022-01-10 13:36:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:53,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:53,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:53,159 INFO L87 Difference]: Start difference. First operand 2380 states and 4330 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:53,216 INFO L93 Difference]: Finished difference Result 2629 states and 4689 transitions. [2022-01-10 13:36:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:53,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:53,223 INFO L225 Difference]: With dead ends: 2629 [2022-01-10 13:36:53,223 INFO L226 Difference]: Without dead ends: 2380 [2022-01-10 13:36:53,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:36:53,224 INFO L933 BasicCegarLoop]: 4161 mSDtfsCounter, 4138 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:53,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4138 Valid, 4179 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-01-10 13:36:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2022-01-10 13:36:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2377 states have (on average 1.8157341186369373) internal successors, (4316), 2379 states have internal predecessors, (4316), 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 13:36:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 4316 transitions. [2022-01-10 13:36:53,264 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 4316 transitions. Word has length 44 [2022-01-10 13:36:53,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:53,265 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 4316 transitions. [2022-01-10 13:36:53,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 4316 transitions. [2022-01-10 13:36:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 13:36:53,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:53,267 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 13:36:53,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 13:36:53,268 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash -235449682, now seen corresponding path program 1 times [2022-01-10 13:36:53,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:53,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800380876] [2022-01-10 13:36:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:53,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:53,328 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 13:36:53,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:53,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800380876] [2022-01-10 13:36:53,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800380876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:53,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:53,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:36:53,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378227870] [2022-01-10 13:36:53,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:53,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:53,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:53,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:53,330 INFO L87 Difference]: Start difference. First operand 2380 states and 4316 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:53,379 INFO L93 Difference]: Finished difference Result 2628 states and 4660 transitions. [2022-01-10 13:36:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:53,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:53,386 INFO L225 Difference]: With dead ends: 2628 [2022-01-10 13:36:53,386 INFO L226 Difference]: Without dead ends: 2380 [2022-01-10 13:36:53,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:36:53,393 INFO L933 BasicCegarLoop]: 4152 mSDtfsCounter, 4129 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4129 SdHoareTripleChecker+Valid, 4169 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:53,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4129 Valid, 4169 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-01-10 13:36:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2022-01-10 13:36:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2377 states have (on average 1.8098443416070678) internal successors, (4302), 2379 states have internal predecessors, (4302), 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 13:36:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 4302 transitions. [2022-01-10 13:36:53,437 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 4302 transitions. Word has length 44 [2022-01-10 13:36:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:53,437 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 4302 transitions. [2022-01-10 13:36:53,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 4302 transitions. [2022-01-10 13:36:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 13:36:53,437 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:53,437 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 13:36:53,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 13:36:53,438 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:53,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash -845916339, now seen corresponding path program 1 times [2022-01-10 13:36:53,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:53,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043153157] [2022-01-10 13:36:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:53,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:53,513 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 13:36:53,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:53,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043153157] [2022-01-10 13:36:53,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043153157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:53,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:53,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:36:53,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468979999] [2022-01-10 13:36:53,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:53,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:36:53,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:53,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:36:53,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:36:53,515 INFO L87 Difference]: Start difference. First operand 2380 states and 4302 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 13:36:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:53,619 INFO L93 Difference]: Finished difference Result 2818 states and 4901 transitions. [2022-01-10 13:36:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:36:53,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 13:36:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:53,627 INFO L225 Difference]: With dead ends: 2818 [2022-01-10 13:36:53,627 INFO L226 Difference]: Without dead ends: 2584 [2022-01-10 13:36:53,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 13:36:53,631 INFO L933 BasicCegarLoop]: 4151 mSDtfsCounter, 448 mSDsluCounter, 12372 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 16523 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:53,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 16523 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2022-01-10 13:36:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2386. [2022-01-10 13:36:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2383 states have (on average 1.8052874527906) internal successors, (4302), 2385 states have internal predecessors, (4302), 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 13:36:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 4302 transitions. [2022-01-10 13:36:53,676 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 4302 transitions. Word has length 44 [2022-01-10 13:36:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:53,679 INFO L470 AbstractCegarLoop]: Abstraction has 2386 states and 4302 transitions. [2022-01-10 13:36:53,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 13:36:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 4302 transitions. [2022-01-10 13:36:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 13:36:53,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:53,682 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 13:36:53,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 13:36:53,682 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:53,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash -634565426, now seen corresponding path program 1 times [2022-01-10 13:36:53,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:53,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934511979] [2022-01-10 13:36:53,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:53,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:53,733 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 13:36:53,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:53,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934511979] [2022-01-10 13:36:53,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934511979] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:53,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:53,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:36:53,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610241552] [2022-01-10 13:36:53,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:53,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:53,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:53,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:53,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:53,735 INFO L87 Difference]: Start difference. First operand 2386 states and 4302 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:53,794 INFO L93 Difference]: Finished difference Result 2844 states and 4896 transitions. [2022-01-10 13:36:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:53,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:53,801 INFO L225 Difference]: With dead ends: 2844 [2022-01-10 13:36:53,801 INFO L226 Difference]: Without dead ends: 2592 [2022-01-10 13:36:53,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:36:53,803 INFO L933 BasicCegarLoop]: 4149 mSDtfsCounter, 4087 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4087 SdHoareTripleChecker+Valid, 4299 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:53,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4087 Valid, 4299 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-01-10 13:36:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2560. [2022-01-10 13:36:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2557 states have (on average 1.7669143527571374) internal successors, (4518), 2559 states have internal predecessors, (4518), 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 13:36:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 4518 transitions. [2022-01-10 13:36:53,917 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 4518 transitions. Word has length 44 [2022-01-10 13:36:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:53,917 INFO L470 AbstractCegarLoop]: Abstraction has 2560 states and 4518 transitions. [2022-01-10 13:36:53,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 13:36:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 4518 transitions. [2022-01-10 13:36:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 13:36:53,918 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:53,918 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:36:53,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 13:36:53,918 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:53,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash 999327283, now seen corresponding path program 1 times [2022-01-10 13:36:53,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:53,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876651604] [2022-01-10 13:36:53,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:53,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:36:53,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:53,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876651604] [2022-01-10 13:36:53,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876651604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:53,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:53,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:36:53,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544098053] [2022-01-10 13:36:53,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:53,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:53,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:53,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:53,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:53,949 INFO L87 Difference]: Start difference. First operand 2560 states and 4518 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 13:36:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:54,025 INFO L93 Difference]: Finished difference Result 3332 states and 5508 transitions. [2022-01-10 13:36:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:54,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2022-01-10 13:36:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:54,034 INFO L225 Difference]: With dead ends: 3332 [2022-01-10 13:36:54,034 INFO L226 Difference]: Without dead ends: 2912 [2022-01-10 13:36:54,036 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 13:36:54,036 INFO L933 BasicCegarLoop]: 4146 mSDtfsCounter, 4097 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4097 SdHoareTripleChecker+Valid, 4296 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:54,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4097 Valid, 4296 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2022-01-10 13:36:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 2876. [2022-01-10 13:36:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2873 states have (on average 1.7138879220327183) internal successors, (4924), 2875 states have internal predecessors, (4924), 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 13:36:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4924 transitions. [2022-01-10 13:36:54,108 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4924 transitions. Word has length 70 [2022-01-10 13:36:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:54,109 INFO L470 AbstractCegarLoop]: Abstraction has 2876 states and 4924 transitions. [2022-01-10 13:36:54,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 13:36:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4924 transitions. [2022-01-10 13:36:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 13:36:54,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:54,110 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:36:54,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 13:36:54,110 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:54,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1746339443, now seen corresponding path program 1 times [2022-01-10 13:36:54,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:54,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325772225] [2022-01-10 13:36:54,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:54,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:36:54,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:54,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325772225] [2022-01-10 13:36:54,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325772225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:54,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:54,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:36:54,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191491203] [2022-01-10 13:36:54,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:54,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:54,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:54,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:54,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:54,140 INFO L87 Difference]: Start difference. First operand 2876 states and 4924 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 13:36:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:54,226 INFO L93 Difference]: Finished difference Result 4253 states and 6686 transitions. [2022-01-10 13:36:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:54,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2022-01-10 13:36:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:54,237 INFO L225 Difference]: With dead ends: 4253 [2022-01-10 13:36:54,237 INFO L226 Difference]: Without dead ends: 3527 [2022-01-10 13:36:54,239 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 13:36:54,239 INFO L933 BasicCegarLoop]: 4180 mSDtfsCounter, 4067 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4067 SdHoareTripleChecker+Valid, 4355 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:54,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4067 Valid, 4355 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:54,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2022-01-10 13:36:54,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3523. [2022-01-10 13:36:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3523 states, 3520 states have (on average 1.6244318181818183) internal successors, (5718), 3522 states have internal predecessors, (5718), 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 13:36:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 5718 transitions. [2022-01-10 13:36:54,336 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 5718 transitions. Word has length 70 [2022-01-10 13:36:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:54,336 INFO L470 AbstractCegarLoop]: Abstraction has 3523 states and 5718 transitions. [2022-01-10 13:36:54,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 13:36:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5718 transitions. [2022-01-10 13:36:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 13:36:54,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:54,338 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:36:54,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 13:36:54,338 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:54,339 INFO L85 PathProgramCache]: Analyzing trace with hash -428340654, now seen corresponding path program 1 times [2022-01-10 13:36:54,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:54,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608025862] [2022-01-10 13:36:54,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:54,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 13:36:54,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:54,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608025862] [2022-01-10 13:36:54,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608025862] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:54,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:54,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:36:54,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168964168] [2022-01-10 13:36:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:54,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:54,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:54,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:54,358 INFO L87 Difference]: Start difference. First operand 3523 states and 5718 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 13:36:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:54,434 INFO L93 Difference]: Finished difference Result 4873 states and 7422 transitions. [2022-01-10 13:36:54,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:54,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 70 [2022-01-10 13:36:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:54,444 INFO L225 Difference]: With dead ends: 4873 [2022-01-10 13:36:54,445 INFO L226 Difference]: Without dead ends: 3500 [2022-01-10 13:36:54,447 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 13:36:54,448 INFO L933 BasicCegarLoop]: 4151 mSDtfsCounter, 189 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 8109 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:54,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 8109 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2022-01-10 13:36:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 3500. [2022-01-10 13:36:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 3497 states have (on average 1.627966828710323) internal successors, (5693), 3499 states have internal predecessors, (5693), 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 13:36:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 5693 transitions. [2022-01-10 13:36:54,535 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 5693 transitions. Word has length 70 [2022-01-10 13:36:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:54,535 INFO L470 AbstractCegarLoop]: Abstraction has 3500 states and 5693 transitions. [2022-01-10 13:36:54,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 13:36:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 5693 transitions. [2022-01-10 13:36:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 13:36:54,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:54,536 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:36:54,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 13:36:54,536 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:54,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1758843996, now seen corresponding path program 1 times [2022-01-10 13:36:54,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:54,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925840962] [2022-01-10 13:36:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:54,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:36:54,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:54,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925840962] [2022-01-10 13:36:54,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925840962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:54,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:54,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:36:54,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480695702] [2022-01-10 13:36:54,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:54,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:54,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:54,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:54,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:54,574 INFO L87 Difference]: Start difference. First operand 3500 states and 5693 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 13:36:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:54,729 INFO L93 Difference]: Finished difference Result 5956 states and 8752 transitions. [2022-01-10 13:36:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 71 [2022-01-10 13:36:54,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:54,746 INFO L225 Difference]: With dead ends: 5956 [2022-01-10 13:36:54,746 INFO L226 Difference]: Without dead ends: 4606 [2022-01-10 13:36:54,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:54,751 INFO L933 BasicCegarLoop]: 4284 mSDtfsCounter, 133 mSDsluCounter, 4133 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 8417 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:54,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 8417 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2022-01-10 13:36:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 4606. [2022-01-10 13:36:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4606 states, 4603 states have (on average 1.5172713447751467) internal successors, (6984), 4605 states have internal predecessors, (6984), 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 13:36:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 6984 transitions. [2022-01-10 13:36:54,922 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 6984 transitions. Word has length 71 [2022-01-10 13:36:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:54,923 INFO L470 AbstractCegarLoop]: Abstraction has 4606 states and 6984 transitions. [2022-01-10 13:36:54,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 13:36:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 6984 transitions. [2022-01-10 13:36:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 13:36:54,926 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:54,926 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-10 13:36:54,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 13:36:54,926 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:54,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:54,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1716599349, now seen corresponding path program 1 times [2022-01-10 13:36:54,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:54,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553527374] [2022-01-10 13:36:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:54,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 13:36:54,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:54,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553527374] [2022-01-10 13:36:54,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553527374] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:54,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:54,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:36:54,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810804051] [2022-01-10 13:36:54,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:54,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:54,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:54,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:54,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:54,973 INFO L87 Difference]: Start difference. First operand 4606 states and 6984 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 13:36:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:55,097 INFO L93 Difference]: Finished difference Result 6536 states and 9356 transitions. [2022-01-10 13:36:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 13:36:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:55,105 INFO L225 Difference]: With dead ends: 6536 [2022-01-10 13:36:55,106 INFO L226 Difference]: Without dead ends: 4638 [2022-01-10 13:36:55,108 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 13:36:55,109 INFO L933 BasicCegarLoop]: 4153 mSDtfsCounter, 4084 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4084 SdHoareTripleChecker+Valid, 4325 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:55,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4084 Valid, 4325 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2022-01-10 13:36:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4558. [2022-01-10 13:36:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4558 states, 4555 states have (on average 1.5034028540065862) internal successors, (6848), 4557 states have internal predecessors, (6848), 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 13:36:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4558 states to 4558 states and 6848 transitions. [2022-01-10 13:36:55,230 INFO L78 Accepts]: Start accepts. Automaton has 4558 states and 6848 transitions. Word has length 103 [2022-01-10 13:36:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:55,231 INFO L470 AbstractCegarLoop]: Abstraction has 4558 states and 6848 transitions. [2022-01-10 13:36:55,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 13:36:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4558 states and 6848 transitions. [2022-01-10 13:36:55,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 13:36:55,233 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:55,233 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 13:36:55,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 13:36:55,233 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:55,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:55,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1025550192, now seen corresponding path program 1 times [2022-01-10 13:36:55,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:55,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629314184] [2022-01-10 13:36:55,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:55,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:36:55,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629314184] [2022-01-10 13:36:55,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629314184] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:55,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:55,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:36:55,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140087570] [2022-01-10 13:36:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:55,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:55,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:55,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:55,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:55,313 INFO L87 Difference]: Start difference. First operand 4558 states and 6848 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 13:36:55,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:55,439 INFO L93 Difference]: Finished difference Result 6426 states and 9066 transitions. [2022-01-10 13:36:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:55,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2022-01-10 13:36:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:55,446 INFO L225 Difference]: With dead ends: 6426 [2022-01-10 13:36:55,446 INFO L226 Difference]: Without dead ends: 4042 [2022-01-10 13:36:55,449 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 13:36:55,450 INFO L933 BasicCegarLoop]: 4250 mSDtfsCounter, 119 mSDsluCounter, 4109 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 8359 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:55,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 8359 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4042 states. [2022-01-10 13:36:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4042 to 4022. [2022-01-10 13:36:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4022 states, 4019 states have (on average 1.533217218213486) internal successors, (6162), 4021 states have internal predecessors, (6162), 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 13:36:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 6162 transitions. [2022-01-10 13:36:55,568 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 6162 transitions. Word has length 104 [2022-01-10 13:36:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:55,568 INFO L470 AbstractCegarLoop]: Abstraction has 4022 states and 6162 transitions. [2022-01-10 13:36:55,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 13:36:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 6162 transitions. [2022-01-10 13:36:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 13:36:55,571 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:55,571 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 13:36:55,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 13:36:55,571 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:55,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash 729274307, now seen corresponding path program 1 times [2022-01-10 13:36:55,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:55,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248224271] [2022-01-10 13:36:55,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:55,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 13:36:55,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:55,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248224271] [2022-01-10 13:36:55,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248224271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:55,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:55,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:36:55,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742875485] [2022-01-10 13:36:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:55,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:36:55,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:55,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:36:55,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:36:55,614 INFO L87 Difference]: Start difference. First operand 4022 states and 6162 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 13:36:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:55,804 INFO L93 Difference]: Finished difference Result 5723 states and 8176 transitions. [2022-01-10 13:36:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:36:55,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 105 [2022-01-10 13:36:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:55,810 INFO L225 Difference]: With dead ends: 5723 [2022-01-10 13:36:55,810 INFO L226 Difference]: Without dead ends: 3839 [2022-01-10 13:36:55,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 13:36:55,813 INFO L933 BasicCegarLoop]: 4166 mSDtfsCounter, 482 mSDsluCounter, 12244 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 16410 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:55,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 16410 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2022-01-10 13:36:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3447. [2022-01-10 13:36:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 3444 states have (on average 1.585656213704994) internal successors, (5461), 3446 states have internal predecessors, (5461), 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 13:36:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 5461 transitions. [2022-01-10 13:36:55,926 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 5461 transitions. Word has length 105 [2022-01-10 13:36:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:55,926 INFO L470 AbstractCegarLoop]: Abstraction has 3447 states and 5461 transitions. [2022-01-10 13:36:55,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 13:36:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 5461 transitions. [2022-01-10 13:36:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 13:36:55,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:55,928 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 13:36:55,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 13:36:55,928 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1354717185, now seen corresponding path program 1 times [2022-01-10 13:36:55,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:55,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185176904] [2022-01-10 13:36:55,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:55,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 13:36:56,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:56,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185176904] [2022-01-10 13:36:56,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185176904] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:56,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:56,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 13:36:56,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224694950] [2022-01-10 13:36:56,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:56,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 13:36:56,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:56,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 13:36:56,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 13:36:56,012 INFO L87 Difference]: Start difference. First operand 3447 states and 5461 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 13:36:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:56,268 INFO L93 Difference]: Finished difference Result 4869 states and 7052 transitions. [2022-01-10 13:36:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 13:36:56,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 105 [2022-01-10 13:36:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:56,277 INFO L225 Difference]: With dead ends: 4869 [2022-01-10 13:36:56,277 INFO L226 Difference]: Without dead ends: 4867 [2022-01-10 13:36:56,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 13:36:56,279 INFO L933 BasicCegarLoop]: 4243 mSDtfsCounter, 4194 mSDsluCounter, 4261 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4194 SdHoareTripleChecker+Valid, 8504 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:56,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4194 Valid, 8504 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2022-01-10 13:36:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 4005. [2022-01-10 13:36:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4005 states, 4002 states have (on average 1.5239880059970015) internal successors, (6099), 4004 states have internal predecessors, (6099), 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 13:36:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 6099 transitions. [2022-01-10 13:36:56,475 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 6099 transitions. Word has length 105 [2022-01-10 13:36:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:56,476 INFO L470 AbstractCegarLoop]: Abstraction has 4005 states and 6099 transitions. [2022-01-10 13:36:56,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 13:36:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 6099 transitions. [2022-01-10 13:36:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 13:36:56,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:56,478 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-01-10 13:36:56,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 13:36:56,478 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash -949351947, now seen corresponding path program 1 times [2022-01-10 13:36:56,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:56,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080528375] [2022-01-10 13:36:56,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:56,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:36:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 13:36:56,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:36:56,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080528375] [2022-01-10 13:36:56,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080528375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:36:56,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:36:56,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:36:56,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030759659] [2022-01-10 13:36:56,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:36:56,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:36:56,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:36:56,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:36:56,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:36:56,523 INFO L87 Difference]: Start difference. First operand 4005 states and 6099 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 13:36:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:36:56,816 INFO L93 Difference]: Finished difference Result 6509 states and 8969 transitions. [2022-01-10 13:36:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:36:56,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 109 [2022-01-10 13:36:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:36:56,825 INFO L225 Difference]: With dead ends: 6509 [2022-01-10 13:36:56,825 INFO L226 Difference]: Without dead ends: 5229 [2022-01-10 13:36:56,829 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 13:36:56,830 INFO L933 BasicCegarLoop]: 4281 mSDtfsCounter, 136 mSDsluCounter, 4135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 8416 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:36:56,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 8416 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:36:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5229 states. [2022-01-10 13:36:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5229 to 4009. [2022-01-10 13:36:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 4006 states have (on average 1.5234648027958062) internal successors, (6103), 4008 states have internal predecessors, (6103), 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 13:36:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 6103 transitions. [2022-01-10 13:36:57,050 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 6103 transitions. Word has length 109 [2022-01-10 13:36:57,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:36:57,050 INFO L470 AbstractCegarLoop]: Abstraction has 4009 states and 6103 transitions. [2022-01-10 13:36:57,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 13:36:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 6103 transitions. [2022-01-10 13:36:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 13:36:57,052 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:36:57,052 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-01-10 13:36:57,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 13:36:57,052 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:36:57,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:36:57,053 INFO L85 PathProgramCache]: Analyzing trace with hash 604147290, now seen corresponding path program 1 times [2022-01-10 13:36:57,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:36:57,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915628984] [2022-01-10 13:36:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:36:57,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:36:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 13:36:57,073 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 13:36:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 13:36:57,132 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 13:36:57,133 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 13:36:57,134 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-10 13:36:57,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-10 13:36:57,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-10 13:36:57,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 13:36:57,138 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:36:57,140 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 13:36:57,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:36:57 BasicIcfg [2022-01-10 13:36:57,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 13:36:57,352 INFO L158 Benchmark]: Toolchain (without parser) took 16408.56ms. Allocated memory was 202.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 144.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-01-10 13:36:57,352 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory was 163.9MB in the beginning and 163.8MB in the end (delta: 122.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 13:36:57,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2287.37ms. Allocated memory was 202.4MB in the beginning and 292.6MB in the end (delta: 90.2MB). Free memory was 143.7MB in the beginning and 151.3MB in the end (delta: -7.6MB). Peak memory consumption was 189.0MB. Max. memory is 8.0GB. [2022-01-10 13:36:57,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 445.82ms. Allocated memory was 292.6MB in the beginning and 529.5MB in the end (delta: 237.0MB). Free memory was 151.3MB in the beginning and 393.5MB in the end (delta: -242.2MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. [2022-01-10 13:36:57,353 INFO L158 Benchmark]: Boogie Preprocessor took 355.63ms. Allocated memory is still 529.5MB. Free memory was 393.5MB in the beginning and 355.8MB in the end (delta: 37.7MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. [2022-01-10 13:36:57,353 INFO L158 Benchmark]: RCFGBuilder took 6945.03ms. Allocated memory was 529.5MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 355.8MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 293.8MB. Max. memory is 8.0GB. [2022-01-10 13:36:57,353 INFO L158 Benchmark]: IcfgTransformer took 1174.72ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.1GB in the end (delta: 264.2MB). Peak memory consumption was 286.7MB. Max. memory is 8.0GB. [2022-01-10 13:36:57,353 INFO L158 Benchmark]: TraceAbstraction took 5194.38ms. Allocated memory was 1.6GB in the beginning and 2.7GB in the end (delta: 1.1GB). Free memory was 1.1GB in the beginning and 1.3GB in the end (delta: -194.6MB). Peak memory consumption was 904.8MB. Max. memory is 8.0GB. [2022-01-10 13:36:57,354 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.10ms. Allocated memory is still 202.4MB. Free memory was 163.9MB in the beginning and 163.8MB in the end (delta: 122.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2287.37ms. Allocated memory was 202.4MB in the beginning and 292.6MB in the end (delta: 90.2MB). Free memory was 143.7MB in the beginning and 151.3MB in the end (delta: -7.6MB). Peak memory consumption was 189.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 445.82ms. Allocated memory was 292.6MB in the beginning and 529.5MB in the end (delta: 237.0MB). Free memory was 151.3MB in the beginning and 393.5MB in the end (delta: -242.2MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 355.63ms. Allocated memory is still 529.5MB. Free memory was 393.5MB in the beginning and 355.8MB in the end (delta: 37.7MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. * RCFGBuilder took 6945.03ms. Allocated memory was 529.5MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 355.8MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 293.8MB. Max. memory is 8.0GB. * IcfgTransformer took 1174.72ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.1GB in the end (delta: 264.2MB). Peak memory consumption was 286.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5194.38ms. Allocated memory was 1.6GB in the beginning and 2.7GB in the end (delta: 1.1GB). Free memory was 1.1GB in the beginning and 1.3GB in the end (delta: -194.6MB). Peak memory consumption was 904.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 [L11586] FCALL update_channels() [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() [L11424] COND FALSE !(M_E == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() [L11589] CALL activate_threads() [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L11589] RET activate_threads() [L11590] CALL reset_delta_events() [L11452] COND FALSE !(M_E == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() [L11593] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] RET, EXPR exists_runnable_thread() [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11378] CALL, EXPR exists_runnable_thread() [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11208] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 [L11214] CALL immediate_notify() [L11506] CALL activate_threads() [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() [L11214] RET immediate_notify() [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 [L11274] CALL immediate_notify() [L11506] CALL activate_threads() [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() [L11274] RET immediate_notify() [L11275] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L11378] CALL, EXPR exists_runnable_thread() [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11200] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11222] COND FALSE !(token != local + 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 [L11236] CALL error() [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11173]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 11118]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2344 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38690 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38690 mSDsluCounter, 108961 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46073 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 237 IncrementalHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 62888 mSDtfsCounter, 237 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4606occurred in iteration=10, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 2848 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1181 NumberOfCodeBlocks, 1181 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1056 ConstructedInterpolants, 0 QuantifiedInterpolants, 2505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 189/189 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 RESULT: Ultimate proved your program to be incorrect! [2022-01-10 13:36:57,380 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...