/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_SUM.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 06:23:52,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 06:23:52,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 06:23:52,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 06:23:52,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 06:23:52,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 06:23:52,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 06:23:52,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 06:23:52,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 06:23:52,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 06:23:52,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 06:23:52,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 06:23:52,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 06:23:52,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 06:23:52,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 06:23:52,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 06:23:52,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 06:23:52,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 06:23:52,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 06:23:52,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 06:23:52,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 06:23:52,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 06:23:52,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 06:23:52,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 06:23:52,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 06:23:52,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 06:23:52,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 06:23:52,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 06:23:52,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 06:23:52,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 06:23:52,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 06:23:52,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 06:23:52,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 06:23:52,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 06:23:52,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 06:23:52,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 06:23:52,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 06:23:52,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 06:23:52,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 06:23:52,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 06:23:52,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 06:23:52,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 06:23:52,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 06:23:52,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 06:23:52,378 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 06:23:52,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 06:23:52,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 06:23:52,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 06:23:52,380 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 06:23:52,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 06:23:52,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 06:23:52,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 06:23:52,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 06:23:52,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 06:23:52,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 06:23:52,380 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 06:23:52,381 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 06:23:52,381 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 06:23:52,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 06:23:52,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 06:23:52,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 06:23:52,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 06:23:52,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 06:23:52,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 06:23:52,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 06:23:52,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 06:23:52,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 06:23:52,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 06:23:52,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 06:23:52,382 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 06:23:52,382 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 06:23:52,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 06:23:52,382 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 06:23:52,383 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 06:23:52,383 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 06:23:52,383 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 06:23:52,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 06:23:52,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 06:23:52,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 06:23:52,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 06:23:52,639 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 06:23:52,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-01-11 06:23:52,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df27d3f62/da653d9958ca4bbd8d4c3712252515d2/FLAG5c99d3dab [2022-01-11 06:23:53,077 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 06:23:53,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-01-11 06:23:53,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df27d3f62/da653d9958ca4bbd8d4c3712252515d2/FLAG5c99d3dab [2022-01-11 06:23:53,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df27d3f62/da653d9958ca4bbd8d4c3712252515d2 [2022-01-11 06:23:53,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 06:23:53,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 06:23:53,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 06:23:53,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 06:23:53,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 06:23:53,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:53,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38392cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53, skipping insertion in model container [2022-01-11 06:23:53,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:53,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 06:23:53,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 06:23:53,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[9615,9628] [2022-01-11 06:23:53,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11969,11982] [2022-01-11 06:23:53,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:23:53,826 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 06:23:53,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[9615,9628] [2022-01-11 06:23:53,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11969,11982] [2022-01-11 06:23:53,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:23:53,971 INFO L208 MainTranslator]: Completed translation [2022-01-11 06:23:53,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53 WrapperNode [2022-01-11 06:23:53,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 06:23:53,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 06:23:53,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 06:23:53,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 06:23:53,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:53,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:54,057 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 948 [2022-01-11 06:23:54,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 06:23:54,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 06:23:54,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 06:23:54,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 06:23:54,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:54,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:54,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:54,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:54,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:54,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:54,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:54,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 06:23:54,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 06:23:54,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 06:23:54,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 06:23:54,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (1/1) ... [2022-01-11 06:23:54,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 06:23:54,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 06:23:54,172 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-11 06:23:54,189 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-11 06:23:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 06:23:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 06:23:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 06:23:54,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 06:23:54,398 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 06:23:54,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 06:23:55,151 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 06:23:55,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 06:23:55,164 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 06:23:55,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:23:55 BoogieIcfgContainer [2022-01-11 06:23:55,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 06:23:55,168 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 06:23:55,168 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 06:23:55,170 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 06:23:55,172 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:23:55" (1/1) ... [2022-01-11 06:23:55,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 06:23:55 BasicIcfg [2022-01-11 06:23:55,783 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 06:23:55,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 06:23:55,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 06:23:55,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 06:23:55,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 06:23:53" (1/4) ... [2022-01-11 06:23:55,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f2ea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:23:55, skipping insertion in model container [2022-01-11 06:23:55,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:23:53" (2/4) ... [2022-01-11 06:23:55,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f2ea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:23:55, skipping insertion in model container [2022-01-11 06:23:55,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:23:55" (3/4) ... [2022-01-11 06:23:55,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f2ea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 06:23:55, skipping insertion in model container [2022-01-11 06:23:55,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 06:23:55" (4/4) ... [2022-01-11 06:23:55,792 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.cTransformedIcfg [2022-01-11 06:23:55,799 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 06:23:55,799 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-11 06:23:55,842 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 06:23:55,848 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-11 06:23:55,849 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-11 06:23:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 234 states have (on average 1.8034188034188035) internal successors, (422), 236 states have internal predecessors, (422), 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-11 06:23:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-11 06:23:55,878 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:23:55,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:23:55,879 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:23:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:23:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash 908237708, now seen corresponding path program 1 times [2022-01-11 06:23:55,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:23:55,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067957007] [2022-01-11 06:23:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:23:55,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:23:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:23:56,472 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-11 06:23:56,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:23:56,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067957007] [2022-01-11 06:23:56,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067957007] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:23:56,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:23:56,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:23:56,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435348869] [2022-01-11 06:23:56,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:23:56,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:23:56,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:23:56,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:23:56,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:23:56,511 INFO L87 Difference]: Start difference. First operand has 237 states, 234 states have (on average 1.8034188034188035) internal successors, (422), 236 states have internal predecessors, (422), 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 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-11 06:23:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:23:56,682 INFO L93 Difference]: Finished difference Result 669 states and 1195 transitions. [2022-01-11 06:23:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 06:23:56,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2022-01-11 06:23:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:23:56,707 INFO L225 Difference]: With dead ends: 669 [2022-01-11 06:23:56,708 INFO L226 Difference]: Without dead ends: 451 [2022-01-11 06:23:56,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:23:56,714 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 876 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:23:56,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [876 Valid, 1070 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:23:56,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-01-11 06:23:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 431. [2022-01-11 06:23:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 429 states have (on average 1.4685314685314685) internal successors, (630), 430 states have internal predecessors, (630), 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-11 06:23:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 630 transitions. [2022-01-11 06:23:56,805 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 630 transitions. Word has length 91 [2022-01-11 06:23:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:23:56,806 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 630 transitions. [2022-01-11 06:23:56,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-11 06:23:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 630 transitions. [2022-01-11 06:23:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-11 06:23:56,815 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:23:56,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:23:56,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 06:23:56,815 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:23:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:23:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1963504368, now seen corresponding path program 1 times [2022-01-11 06:23:56,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:23:56,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722623527] [2022-01-11 06:23:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:23:56,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:23:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:23:56,956 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-11 06:23:56,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:23:56,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722623527] [2022-01-11 06:23:56,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722623527] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:23:56,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:23:56,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:23:56,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579580423] [2022-01-11 06:23:56,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:23:56,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:23:56,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:23:56,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:23:56,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:23:56,960 INFO L87 Difference]: Start difference. First operand 431 states and 630 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-11 06:23:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:23:57,007 INFO L93 Difference]: Finished difference Result 1255 states and 1826 transitions. [2022-01-11 06:23:57,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:23:57,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 92 [2022-01-11 06:23:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:23:57,011 INFO L225 Difference]: With dead ends: 1255 [2022-01-11 06:23:57,012 INFO L226 Difference]: Without dead ends: 852 [2022-01-11 06:23:57,016 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-11 06:23:57,018 INFO L933 BasicCegarLoop]: 674 mSDtfsCounter, 333 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:23:57,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 1009 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:23:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-01-11 06:23:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 433. [2022-01-11 06:23:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 431 states have (on average 1.4663573085846868) internal successors, (632), 432 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:23:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 632 transitions. [2022-01-11 06:23:57,048 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 632 transitions. Word has length 92 [2022-01-11 06:23:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:23:57,049 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 632 transitions. [2022-01-11 06:23:57,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-11 06:23:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 632 transitions. [2022-01-11 06:23:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-11 06:23:57,054 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:23:57,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:23:57,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 06:23:57,059 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:23:57,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:23:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1578836177, now seen corresponding path program 1 times [2022-01-11 06:23:57,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:23:57,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103389493] [2022-01-11 06:23:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:23:57,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:23:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:23:57,346 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-11 06:23:57,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:23:57,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103389493] [2022-01-11 06:23:57,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103389493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:23:57,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:23:57,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:23:57,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267990764] [2022-01-11 06:23:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:23:57,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:23:57,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:23:57,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:23:57,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:23:57,349 INFO L87 Difference]: Start difference. First operand 433 states and 632 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-11 06:23:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:23:57,497 INFO L93 Difference]: Finished difference Result 1655 states and 2404 transitions. [2022-01-11 06:23:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 06:23:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2022-01-11 06:23:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:23:57,504 INFO L225 Difference]: With dead ends: 1655 [2022-01-11 06:23:57,504 INFO L226 Difference]: Without dead ends: 1234 [2022-01-11 06:23:57,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 06:23:57,511 INFO L933 BasicCegarLoop]: 722 mSDtfsCounter, 1128 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 06:23:57,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1128 Valid, 1333 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 06:23:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-01-11 06:23:57,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 817. [2022-01-11 06:23:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 815 states have (on average 1.4503067484662577) internal successors, (1182), 816 states have internal predecessors, (1182), 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-11 06:23:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1182 transitions. [2022-01-11 06:23:57,573 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1182 transitions. Word has length 93 [2022-01-11 06:23:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:23:57,573 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1182 transitions. [2022-01-11 06:23:57,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-11 06:23:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1182 transitions. [2022-01-11 06:23:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-11 06:23:57,577 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:23:57,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:23:57,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 06:23:57,578 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:23:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:23:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash 695985645, now seen corresponding path program 1 times [2022-01-11 06:23:57,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:23:57,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026174534] [2022-01-11 06:23:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:23:57,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:23:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:23:57,719 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-11 06:23:57,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:23:57,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026174534] [2022-01-11 06:23:57,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026174534] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:23:57,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:23:57,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:23:57,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568554665] [2022-01-11 06:23:57,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:23:57,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:23:57,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:23:57,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:23:57,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:23:57,724 INFO L87 Difference]: Start difference. First operand 817 states and 1182 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-11 06:23:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:23:57,815 INFO L93 Difference]: Finished difference Result 1431 states and 2063 transitions. [2022-01-11 06:23:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 06:23:57,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 93 [2022-01-11 06:23:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:23:57,818 INFO L225 Difference]: With dead ends: 1431 [2022-01-11 06:23:57,819 INFO L226 Difference]: Without dead ends: 630 [2022-01-11 06:23:57,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:23:57,821 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 69 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:23:57,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1067 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:23:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-01-11 06:23:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2022-01-11 06:23:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 628 states have (on average 1.4410828025477707) internal successors, (905), 629 states have internal predecessors, (905), 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-11 06:23:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 905 transitions. [2022-01-11 06:23:57,870 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 905 transitions. Word has length 93 [2022-01-11 06:23:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:23:57,871 INFO L470 AbstractCegarLoop]: Abstraction has 630 states and 905 transitions. [2022-01-11 06:23:57,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-11 06:23:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 905 transitions. [2022-01-11 06:23:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-11 06:23:57,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:23:57,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:23:57,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 06:23:57,873 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:23:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:23:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1137775477, now seen corresponding path program 1 times [2022-01-11 06:23:57,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:23:57,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762055267] [2022-01-11 06:23:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:23:57,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:23:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:23:57,963 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-11 06:23:57,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:23:57,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762055267] [2022-01-11 06:23:57,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762055267] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:23:57,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:23:57,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:23:57,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715471748] [2022-01-11 06:23:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:23:57,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:23:57,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:23:57,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:23:57,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:23:57,967 INFO L87 Difference]: Start difference. First operand 630 states and 905 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-11 06:23:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:23:58,029 INFO L93 Difference]: Finished difference Result 1256 states and 1791 transitions. [2022-01-11 06:23:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:23:58,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2022-01-11 06:23:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:23:58,033 INFO L225 Difference]: With dead ends: 1256 [2022-01-11 06:23:58,033 INFO L226 Difference]: Without dead ends: 839 [2022-01-11 06:23:58,034 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-11 06:23:58,035 INFO L933 BasicCegarLoop]: 381 mSDtfsCounter, 327 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:23:58,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 709 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:23:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-01-11 06:23:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 630. [2022-01-11 06:23:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 628 states have (on average 1.4394904458598725) internal successors, (904), 629 states have internal predecessors, (904), 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-11 06:23:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 904 transitions. [2022-01-11 06:23:58,079 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 904 transitions. Word has length 96 [2022-01-11 06:23:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:23:58,080 INFO L470 AbstractCegarLoop]: Abstraction has 630 states and 904 transitions. [2022-01-11 06:23:58,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-11 06:23:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 904 transitions. [2022-01-11 06:23:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-11 06:23:58,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:23:58,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:23:58,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 06:23:58,082 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:23:58,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:23:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1824955605, now seen corresponding path program 1 times [2022-01-11 06:23:58,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:23:58,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550208772] [2022-01-11 06:23:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:23:58,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:23:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:23:58,217 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-11 06:23:58,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:23:58,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550208772] [2022-01-11 06:23:58,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550208772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:23:58,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:23:58,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:23:58,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484533264] [2022-01-11 06:23:58,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:23:58,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:23:58,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:23:58,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:23:58,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:23:58,219 INFO L87 Difference]: Start difference. First operand 630 states and 904 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:23:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:23:58,313 INFO L93 Difference]: Finished difference Result 1516 states and 2212 transitions. [2022-01-11 06:23:58,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:23:58,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-01-11 06:23:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:23:58,318 INFO L225 Difference]: With dead ends: 1516 [2022-01-11 06:23:58,318 INFO L226 Difference]: Without dead ends: 1147 [2022-01-11 06:23:58,319 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-11 06:23:58,320 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 269 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:23:58,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 935 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:23:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-01-11 06:23:58,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1135. [2022-01-11 06:23:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1133 states have (on average 1.4368932038834952) internal successors, (1628), 1134 states have internal predecessors, (1628), 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-11 06:23:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1628 transitions. [2022-01-11 06:23:58,393 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1628 transitions. Word has length 97 [2022-01-11 06:23:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:23:58,394 INFO L470 AbstractCegarLoop]: Abstraction has 1135 states and 1628 transitions. [2022-01-11 06:23:58,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:23:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1628 transitions. [2022-01-11 06:23:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-11 06:23:58,395 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:23:58,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:23:58,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 06:23:58,396 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:23:58,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:23:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash 854664598, now seen corresponding path program 1 times [2022-01-11 06:23:58,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:23:58,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688768568] [2022-01-11 06:23:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:23:58,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:23:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:23:58,490 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-11 06:23:58,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:23:58,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688768568] [2022-01-11 06:23:58,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688768568] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:23:58,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:23:58,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:23:58,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787411372] [2022-01-11 06:23:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:23:58,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:23:58,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:23:58,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:23:58,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:23:58,492 INFO L87 Difference]: Start difference. First operand 1135 states and 1628 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:23:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:23:58,676 INFO L93 Difference]: Finished difference Result 2799 states and 4008 transitions. [2022-01-11 06:23:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 06:23:58,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-01-11 06:23:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:23:58,683 INFO L225 Difference]: With dead ends: 2799 [2022-01-11 06:23:58,683 INFO L226 Difference]: Without dead ends: 1748 [2022-01-11 06:23:58,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:23:58,686 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 884 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:23:58,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [884 Valid, 737 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:23:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2022-01-11 06:23:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1140. [2022-01-11 06:23:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1138 states have (on average 1.4323374340949033) internal successors, (1630), 1139 states have internal predecessors, (1630), 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-11 06:23:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1630 transitions. [2022-01-11 06:23:58,784 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1630 transitions. Word has length 97 [2022-01-11 06:23:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:23:58,785 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 1630 transitions. [2022-01-11 06:23:58,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:23:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1630 transitions. [2022-01-11 06:23:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-11 06:23:58,787 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:23:58,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:23:58,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 06:23:58,787 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:23:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:23:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash -379218778, now seen corresponding path program 1 times [2022-01-11 06:23:58,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:23:58,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480711879] [2022-01-11 06:23:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:23:58,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:23:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:23:58,918 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-11 06:23:58,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:23:58,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480711879] [2022-01-11 06:23:58,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480711879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:23:58,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:23:58,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:23:58,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232350567] [2022-01-11 06:23:58,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:23:58,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:23:58,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:23:58,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:23:58,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:23:58,921 INFO L87 Difference]: Start difference. First operand 1140 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:23:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:23:59,193 INFO L93 Difference]: Finished difference Result 3214 states and 4591 transitions. [2022-01-11 06:23:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 06:23:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-01-11 06:23:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:23:59,201 INFO L225 Difference]: With dead ends: 3214 [2022-01-11 06:23:59,201 INFO L226 Difference]: Without dead ends: 2142 [2022-01-11 06:23:59,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:23:59,205 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 671 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:23:59,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 860 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:23:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2022-01-11 06:23:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2089. [2022-01-11 06:23:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2087 states have (on average 1.4216578821274557) internal successors, (2967), 2088 states have internal predecessors, (2967), 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-11 06:23:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2967 transitions. [2022-01-11 06:23:59,415 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2967 transitions. Word has length 97 [2022-01-11 06:23:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:23:59,416 INFO L470 AbstractCegarLoop]: Abstraction has 2089 states and 2967 transitions. [2022-01-11 06:23:59,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:23:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2967 transitions. [2022-01-11 06:23:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 06:23:59,419 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:23:59,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:23:59,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 06:23:59,419 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:23:59,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:23:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash -386240841, now seen corresponding path program 1 times [2022-01-11 06:23:59,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:23:59,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758000073] [2022-01-11 06:23:59,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:23:59,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:23:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:23:59,523 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-11 06:23:59,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:23:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758000073] [2022-01-11 06:23:59,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758000073] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:23:59,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:23:59,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:23:59,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208421045] [2022-01-11 06:23:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:23:59,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:23:59,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:23:59,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:23:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:23:59,525 INFO L87 Difference]: Start difference. First operand 2089 states and 2967 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-11 06:23:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:23:59,665 INFO L93 Difference]: Finished difference Result 2958 states and 4236 transitions. [2022-01-11 06:23:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 06:23:59,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 99 [2022-01-11 06:23:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:23:59,672 INFO L225 Difference]: With dead ends: 2958 [2022-01-11 06:23:59,672 INFO L226 Difference]: Without dead ends: 1733 [2022-01-11 06:23:59,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:23:59,674 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 47 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:23:59,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1048 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:23:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2022-01-11 06:23:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1733. [2022-01-11 06:23:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1731 states have (on average 1.4228769497400346) internal successors, (2463), 1732 states have internal predecessors, (2463), 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-11 06:23:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2463 transitions. [2022-01-11 06:23:59,837 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2463 transitions. Word has length 99 [2022-01-11 06:23:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:23:59,838 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2463 transitions. [2022-01-11 06:23:59,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-11 06:23:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2463 transitions. [2022-01-11 06:23:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 06:23:59,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:23:59,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:23:59,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 06:23:59,841 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:23:59,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:23:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1862671595, now seen corresponding path program 1 times [2022-01-11 06:23:59,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:23:59,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234399880] [2022-01-11 06:23:59,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:23:59,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:23:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:23:59,972 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-11 06:23:59,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:23:59,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234399880] [2022-01-11 06:23:59,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234399880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:23:59,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:23:59,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:23:59,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844992196] [2022-01-11 06:23:59,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:23:59,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:23:59,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:23:59,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:23:59,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:23:59,974 INFO L87 Difference]: Start difference. First operand 1733 states and 2463 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-11 06:24:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:00,306 INFO L93 Difference]: Finished difference Result 4583 states and 6475 transitions. [2022-01-11 06:24:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 06:24:00,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 99 [2022-01-11 06:24:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:00,317 INFO L225 Difference]: With dead ends: 4583 [2022-01-11 06:24:00,317 INFO L226 Difference]: Without dead ends: 2894 [2022-01-11 06:24:00,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 06:24:00,320 INFO L933 BasicCegarLoop]: 692 mSDtfsCounter, 924 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:00,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [924 Valid, 1586 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 06:24:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2022-01-11 06:24:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1885. [2022-01-11 06:24:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1883 states have (on average 1.4014869888475836) internal successors, (2639), 1884 states have internal predecessors, (2639), 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-11 06:24:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2639 transitions. [2022-01-11 06:24:00,484 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2639 transitions. Word has length 99 [2022-01-11 06:24:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:00,484 INFO L470 AbstractCegarLoop]: Abstraction has 1885 states and 2639 transitions. [2022-01-11 06:24:00,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-11 06:24:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2639 transitions. [2022-01-11 06:24:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 06:24:00,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:00,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:00,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 06:24:00,488 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash 979821063, now seen corresponding path program 1 times [2022-01-11 06:24:00,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:00,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511214451] [2022-01-11 06:24:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:00,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:00,602 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-11 06:24:00,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:00,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511214451] [2022-01-11 06:24:00,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511214451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:00,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:00,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:24:00,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814365399] [2022-01-11 06:24:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:00,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:24:00,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:00,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:24:00,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:24:00,604 INFO L87 Difference]: Start difference. First operand 1885 states and 2639 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-11 06:24:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:00,744 INFO L93 Difference]: Finished difference Result 3387 states and 4732 transitions. [2022-01-11 06:24:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 06:24:00,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 99 [2022-01-11 06:24:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:00,750 INFO L225 Difference]: With dead ends: 3387 [2022-01-11 06:24:00,750 INFO L226 Difference]: Without dead ends: 1538 [2022-01-11 06:24:00,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:24:00,753 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 47 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:00,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1043 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:24:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-01-11 06:24:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1538. [2022-01-11 06:24:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1536 states have (on average 1.39453125) internal successors, (2142), 1537 states have internal predecessors, (2142), 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-11 06:24:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2142 transitions. [2022-01-11 06:24:00,875 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2142 transitions. Word has length 99 [2022-01-11 06:24:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:00,875 INFO L470 AbstractCegarLoop]: Abstraction has 1538 states and 2142 transitions. [2022-01-11 06:24:00,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-11 06:24:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2142 transitions. [2022-01-11 06:24:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-11 06:24:00,878 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:00,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:00,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 06:24:00,878 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:00,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2147225385, now seen corresponding path program 1 times [2022-01-11 06:24:00,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:00,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882632198] [2022-01-11 06:24:00,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:00,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:00,981 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-11 06:24:00,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:00,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882632198] [2022-01-11 06:24:00,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882632198] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:00,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:00,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:24:00,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245048197] [2022-01-11 06:24:00,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:00,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:24:00,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:00,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:24:00,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:24:00,983 INFO L87 Difference]: Start difference. First operand 1538 states and 2142 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-11 06:24:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:01,194 INFO L93 Difference]: Finished difference Result 2985 states and 4170 transitions. [2022-01-11 06:24:01,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:24:01,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-01-11 06:24:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:01,202 INFO L225 Difference]: With dead ends: 2985 [2022-01-11 06:24:01,202 INFO L226 Difference]: Without dead ends: 2121 [2022-01-11 06:24:01,205 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-11 06:24:01,207 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 314 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:01,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 895 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:24:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2022-01-11 06:24:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1538. [2022-01-11 06:24:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1536 states have (on average 1.392578125) internal successors, (2139), 1537 states have internal predecessors, (2139), 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-11 06:24:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2139 transitions. [2022-01-11 06:24:01,340 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2139 transitions. Word has length 102 [2022-01-11 06:24:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:01,340 INFO L470 AbstractCegarLoop]: Abstraction has 1538 states and 2139 transitions. [2022-01-11 06:24:01,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-11 06:24:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2139 transitions. [2022-01-11 06:24:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 06:24:01,342 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:01,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:01,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 06:24:01,343 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:01,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:01,343 INFO L85 PathProgramCache]: Analyzing trace with hash 156905420, now seen corresponding path program 1 times [2022-01-11 06:24:01,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:01,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861225981] [2022-01-11 06:24:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:01,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:01,496 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-11 06:24:01,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:01,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861225981] [2022-01-11 06:24:01,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861225981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:01,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:01,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:24:01,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952317962] [2022-01-11 06:24:01,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:01,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:24:01,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:01,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:24:01,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:24:01,498 INFO L87 Difference]: Start difference. First operand 1538 states and 2139 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:24:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:01,682 INFO L93 Difference]: Finished difference Result 3242 states and 4623 transitions. [2022-01-11 06:24:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:24:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-11 06:24:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:01,691 INFO L225 Difference]: With dead ends: 3242 [2022-01-11 06:24:01,692 INFO L226 Difference]: Without dead ends: 2319 [2022-01-11 06:24:01,693 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-11 06:24:01,695 INFO L933 BasicCegarLoop]: 613 mSDtfsCounter, 255 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:01,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 918 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:24:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2022-01-11 06:24:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2274. [2022-01-11 06:24:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2272 states have (on average 1.3851232394366197) internal successors, (3147), 2273 states have internal predecessors, (3147), 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-11 06:24:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3147 transitions. [2022-01-11 06:24:01,883 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3147 transitions. Word has length 103 [2022-01-11 06:24:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:01,884 INFO L470 AbstractCegarLoop]: Abstraction has 2274 states and 3147 transitions. [2022-01-11 06:24:01,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:24:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3147 transitions. [2022-01-11 06:24:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 06:24:01,886 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:01,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:01,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 06:24:01,887 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:01,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash -515856527, now seen corresponding path program 1 times [2022-01-11 06:24:01,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:01,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103977734] [2022-01-11 06:24:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:01,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:02,041 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-11 06:24:02,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:02,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103977734] [2022-01-11 06:24:02,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103977734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:02,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:02,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:24:02,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803019495] [2022-01-11 06:24:02,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:02,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:24:02,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:02,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:24:02,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:24:02,043 INFO L87 Difference]: Start difference. First operand 2274 states and 3147 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:24:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:02,296 INFO L93 Difference]: Finished difference Result 4774 states and 6743 transitions. [2022-01-11 06:24:02,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:24:02,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-11 06:24:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:02,307 INFO L225 Difference]: With dead ends: 4774 [2022-01-11 06:24:02,307 INFO L226 Difference]: Without dead ends: 3393 [2022-01-11 06:24:02,310 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-11 06:24:02,311 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 256 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 912 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-11 06:24:02,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 912 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:24:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-01-11 06:24:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3367. [2022-01-11 06:24:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3367 states, 3365 states have (on average 1.3726597325408618) internal successors, (4619), 3366 states have internal predecessors, (4619), 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-11 06:24:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3367 states to 3367 states and 4619 transitions. [2022-01-11 06:24:02,608 INFO L78 Accepts]: Start accepts. Automaton has 3367 states and 4619 transitions. Word has length 103 [2022-01-11 06:24:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:02,608 INFO L470 AbstractCegarLoop]: Abstraction has 3367 states and 4619 transitions. [2022-01-11 06:24:02,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:24:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3367 states and 4619 transitions. [2022-01-11 06:24:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 06:24:02,612 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:02,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:02,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 06:24:02,612 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1618359926, now seen corresponding path program 1 times [2022-01-11 06:24:02,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:02,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766176650] [2022-01-11 06:24:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:02,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:02,711 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-11 06:24:02,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:02,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766176650] [2022-01-11 06:24:02,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766176650] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:02,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:02,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:24:02,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551950276] [2022-01-11 06:24:02,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:02,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:24:02,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:02,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:24:02,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:24:02,713 INFO L87 Difference]: Start difference. First operand 3367 states and 4619 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-11 06:24:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:03,813 INFO L93 Difference]: Finished difference Result 8110 states and 11499 transitions. [2022-01-11 06:24:03,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:24:03,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-11 06:24:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:03,834 INFO L225 Difference]: With dead ends: 8110 [2022-01-11 06:24:03,835 INFO L226 Difference]: Without dead ends: 6049 [2022-01-11 06:24:03,839 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-11 06:24:03,840 INFO L933 BasicCegarLoop]: 471 mSDtfsCounter, 244 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:03,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 724 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 06:24:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2022-01-11 06:24:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 5992. [2022-01-11 06:24:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5992 states, 5990 states have (on average 1.3878130217028382) internal successors, (8313), 5991 states have internal predecessors, (8313), 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-11 06:24:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5992 states to 5992 states and 8313 transitions. [2022-01-11 06:24:04,453 INFO L78 Accepts]: Start accepts. Automaton has 5992 states and 8313 transitions. Word has length 105 [2022-01-11 06:24:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:04,453 INFO L470 AbstractCegarLoop]: Abstraction has 5992 states and 8313 transitions. [2022-01-11 06:24:04,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-11 06:24:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5992 states and 8313 transitions. [2022-01-11 06:24:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 06:24:04,461 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:04,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:04,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 06:24:04,462 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:04,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1231166645, now seen corresponding path program 1 times [2022-01-11 06:24:04,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:04,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681000826] [2022-01-11 06:24:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:04,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:04,647 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-11 06:24:04,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:04,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681000826] [2022-01-11 06:24:04,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681000826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:04,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:04,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:24:04,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040105920] [2022-01-11 06:24:04,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:04,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:24:04,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:04,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:24:04,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:24:04,651 INFO L87 Difference]: Start difference. First operand 5992 states and 8313 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-11 06:24:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:05,334 INFO L93 Difference]: Finished difference Result 12137 states and 16834 transitions. [2022-01-11 06:24:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 06:24:05,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-11 06:24:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:05,357 INFO L225 Difference]: With dead ends: 12137 [2022-01-11 06:24:05,358 INFO L226 Difference]: Without dead ends: 6298 [2022-01-11 06:24:05,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:24:05,366 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 655 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:05,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 822 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:24:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2022-01-11 06:24:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 6137. [2022-01-11 06:24:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6137 states, 6135 states have (on average 1.3810920945395273) internal successors, (8473), 6136 states have internal predecessors, (8473), 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-11 06:24:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6137 states to 6137 states and 8473 transitions. [2022-01-11 06:24:06,072 INFO L78 Accepts]: Start accepts. Automaton has 6137 states and 8473 transitions. Word has length 105 [2022-01-11 06:24:06,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:06,072 INFO L470 AbstractCegarLoop]: Abstraction has 6137 states and 8473 transitions. [2022-01-11 06:24:06,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-11 06:24:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 6137 states and 8473 transitions. [2022-01-11 06:24:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 06:24:06,083 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:06,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:06,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 06:24:06,084 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:06,085 INFO L85 PathProgramCache]: Analyzing trace with hash 888320499, now seen corresponding path program 1 times [2022-01-11 06:24:06,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:06,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744254311] [2022-01-11 06:24:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:06,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:06,166 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-11 06:24:06,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:06,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744254311] [2022-01-11 06:24:06,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744254311] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:06,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:06,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:24:06,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225985135] [2022-01-11 06:24:06,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:06,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:24:06,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:06,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:24:06,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:24:06,168 INFO L87 Difference]: Start difference. First operand 6137 states and 8473 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-11 06:24:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:07,028 INFO L93 Difference]: Finished difference Result 16169 states and 22489 transitions. [2022-01-11 06:24:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:24:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 106 [2022-01-11 06:24:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:07,055 INFO L225 Difference]: With dead ends: 16169 [2022-01-11 06:24:07,055 INFO L226 Difference]: Without dead ends: 12071 [2022-01-11 06:24:07,065 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-11 06:24:07,065 INFO L933 BasicCegarLoop]: 638 mSDtfsCounter, 305 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:07,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 965 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:24:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12071 states. [2022-01-11 06:24:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12071 to 6147. [2022-01-11 06:24:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6147 states, 6145 states have (on average 1.3804719283970708) internal successors, (8483), 6146 states have internal predecessors, (8483), 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-11 06:24:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 8483 transitions. [2022-01-11 06:24:07,684 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 8483 transitions. Word has length 106 [2022-01-11 06:24:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:07,684 INFO L470 AbstractCegarLoop]: Abstraction has 6147 states and 8483 transitions. [2022-01-11 06:24:07,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-11 06:24:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 8483 transitions. [2022-01-11 06:24:07,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 06:24:07,692 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:07,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:07,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 06:24:07,692 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:07,693 INFO L85 PathProgramCache]: Analyzing trace with hash -856264006, now seen corresponding path program 1 times [2022-01-11 06:24:07,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:07,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594613558] [2022-01-11 06:24:07,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:07,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:07,842 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-11 06:24:07,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:07,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594613558] [2022-01-11 06:24:07,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594613558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:07,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:07,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:24:07,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990481232] [2022-01-11 06:24:07,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:07,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:24:07,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:07,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:24:07,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:24:07,845 INFO L87 Difference]: Start difference. First operand 6147 states and 8483 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-11 06:24:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:08,828 INFO L93 Difference]: Finished difference Result 15811 states and 21824 transitions. [2022-01-11 06:24:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 06:24:08,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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 107 [2022-01-11 06:24:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:08,846 INFO L225 Difference]: With dead ends: 15811 [2022-01-11 06:24:08,847 INFO L226 Difference]: Without dead ends: 10426 [2022-01-11 06:24:08,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 06:24:08,856 INFO L933 BasicCegarLoop]: 687 mSDtfsCounter, 975 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:08,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [975 Valid, 1291 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:24:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2022-01-11 06:24:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 6452. [2022-01-11 06:24:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6452 states, 6450 states have (on average 1.3685271317829457) internal successors, (8827), 6451 states have internal predecessors, (8827), 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-11 06:24:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6452 states to 6452 states and 8827 transitions. [2022-01-11 06:24:09,526 INFO L78 Accepts]: Start accepts. Automaton has 6452 states and 8827 transitions. Word has length 107 [2022-01-11 06:24:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:09,527 INFO L470 AbstractCegarLoop]: Abstraction has 6452 states and 8827 transitions. [2022-01-11 06:24:09,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-11 06:24:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 6452 states and 8827 transitions. [2022-01-11 06:24:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 06:24:09,533 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:09,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:09,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 06:24:09,534 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:09,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:09,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1040758314, now seen corresponding path program 1 times [2022-01-11 06:24:09,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:09,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446912116] [2022-01-11 06:24:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:09,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:09,674 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-11 06:24:09,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:09,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446912116] [2022-01-11 06:24:09,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446912116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:09,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:09,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:24:09,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753230363] [2022-01-11 06:24:09,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:09,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:24:09,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:09,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:24:09,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:24:09,676 INFO L87 Difference]: Start difference. First operand 6452 states and 8827 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11 06:24:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:10,104 INFO L93 Difference]: Finished difference Result 10238 states and 14054 transitions. [2022-01-11 06:24:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 06:24:10,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 107 [2022-01-11 06:24:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:10,113 INFO L225 Difference]: With dead ends: 10238 [2022-01-11 06:24:10,114 INFO L226 Difference]: Without dead ends: 5593 [2022-01-11 06:24:10,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:24:10,121 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 23 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:10,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1016 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:24:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5593 states. [2022-01-11 06:24:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5593 to 5593. [2022-01-11 06:24:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5593 states, 5591 states have (on average 1.3661241280629584) internal successors, (7638), 5592 states have internal predecessors, (7638), 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-11 06:24:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5593 states to 5593 states and 7638 transitions. [2022-01-11 06:24:10,632 INFO L78 Accepts]: Start accepts. Automaton has 5593 states and 7638 transitions. Word has length 107 [2022-01-11 06:24:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:10,634 INFO L470 AbstractCegarLoop]: Abstraction has 5593 states and 7638 transitions. [2022-01-11 06:24:10,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11 06:24:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 5593 states and 7638 transitions. [2022-01-11 06:24:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-11 06:24:10,640 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:10,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:10,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 06:24:10,640 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:10,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:10,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1317183594, now seen corresponding path program 1 times [2022-01-11 06:24:10,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:10,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102656317] [2022-01-11 06:24:10,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:10,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:11,751 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-11 06:24:11,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:11,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102656317] [2022-01-11 06:24:11,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102656317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:11,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:11,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 06:24:11,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160464536] [2022-01-11 06:24:11,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:11,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 06:24:11,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:11,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 06:24:11,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-11 06:24:11,752 INFO L87 Difference]: Start difference. First operand 5593 states and 7638 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 6 states have internal predecessors, (109), 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-11 06:24:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:14,389 INFO L93 Difference]: Finished difference Result 10943 states and 16005 transitions. [2022-01-11 06:24:14,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 06:24:14,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 6 states have internal predecessors, (109), 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-11 06:24:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:14,398 INFO L225 Difference]: With dead ends: 10943 [2022-01-11 06:24:14,398 INFO L226 Difference]: Without dead ends: 6815 [2022-01-11 06:24:14,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-11 06:24:14,402 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 437 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:14,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 1243 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-11 06:24:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6815 states. [2022-01-11 06:24:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6815 to 6793. [2022-01-11 06:24:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6793 states, 6791 states have (on average 1.4601678692386983) internal successors, (9916), 6792 states have internal predecessors, (9916), 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-11 06:24:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 9916 transitions. [2022-01-11 06:24:15,649 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 9916 transitions. Word has length 109 [2022-01-11 06:24:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:15,649 INFO L470 AbstractCegarLoop]: Abstraction has 6793 states and 9916 transitions. [2022-01-11 06:24:15,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 6 states have internal predecessors, (109), 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-11 06:24:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 9916 transitions. [2022-01-11 06:24:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-11 06:24:15,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:15,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:15,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 06:24:15,653 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1988316969, now seen corresponding path program 1 times [2022-01-11 06:24:15,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:15,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607009971] [2022-01-11 06:24:15,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:15,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:24:16,180 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-11 06:24:16,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:24:16,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607009971] [2022-01-11 06:24:16,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607009971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:24:16,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:24:16,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 06:24:16,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640293695] [2022-01-11 06:24:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:24:16,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 06:24:16,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:24:16,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 06:24:16,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-11 06:24:16,182 INFO L87 Difference]: Start difference. First operand 6793 states and 9916 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-11 06:24:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:24:17,890 INFO L93 Difference]: Finished difference Result 9296 states and 13872 transitions. [2022-01-11 06:24:17,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 06:24:17,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-11 06:24:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:24:17,895 INFO L225 Difference]: With dead ends: 9296 [2022-01-11 06:24:17,895 INFO L226 Difference]: Without dead ends: 4461 [2022-01-11 06:24:17,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-01-11 06:24:17,900 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 866 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 06:24:17,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [866 Valid, 684 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 06:24:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2022-01-11 06:24:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 4461. [2022-01-11 06:24:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4461 states, 4459 states have (on average 1.3868580399192645) internal successors, (6184), 4460 states have internal predecessors, (6184), 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-11 06:24:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 6184 transitions. [2022-01-11 06:24:19,101 INFO L78 Accepts]: Start accepts. Automaton has 4461 states and 6184 transitions. Word has length 109 [2022-01-11 06:24:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:24:19,101 INFO L470 AbstractCegarLoop]: Abstraction has 4461 states and 6184 transitions. [2022-01-11 06:24:19,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-11 06:24:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4461 states and 6184 transitions. [2022-01-11 06:24:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-11 06:24:19,105 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:24:19,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:24:19,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 06:24:19,105 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:24:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:24:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1776966056, now seen corresponding path program 1 times [2022-01-11 06:24:19,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:24:19,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078755955] [2022-01-11 06:24:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:24:19,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:24:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 06:24:19,350 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 06:24:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 06:24:19,615 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 06:24:19,615 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 06:24:19,616 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-11 06:24:19,618 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-11 06:24:19,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 06:24:19,621 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:24:19,625 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 06:24:20,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 06:24:20 BasicIcfg [2022-01-11 06:24:20,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 06:24:20,207 INFO L158 Benchmark]: Toolchain (without parser) took 26754.35ms. Allocated memory was 181.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 131.4MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 459.8MB. Max. memory is 8.0GB. [2022-01-11 06:24:20,207 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 06:24:20,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.34ms. Allocated memory was 181.4MB in the beginning and 224.4MB in the end (delta: 43.0MB). Free memory was 131.0MB in the beginning and 188.3MB in the end (delta: -57.3MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-01-11 06:24:20,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.54ms. Allocated memory is still 224.4MB. Free memory was 188.3MB in the beginning and 184.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 06:24:20,208 INFO L158 Benchmark]: Boogie Preprocessor took 60.60ms. Allocated memory is still 224.4MB. Free memory was 184.1MB in the beginning and 181.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 06:24:20,208 INFO L158 Benchmark]: RCFGBuilder took 1046.62ms. Allocated memory is still 224.4MB. Free memory was 181.0MB in the beginning and 126.5MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2022-01-11 06:24:20,209 INFO L158 Benchmark]: IcfgTransformer took 614.42ms. Allocated memory is still 224.4MB. Free memory was 126.5MB in the beginning and 110.6MB in the end (delta: 15.8MB). Peak memory consumption was 61.4MB. Max. memory is 8.0GB. [2022-01-11 06:24:20,209 INFO L158 Benchmark]: TraceAbstraction took 24422.64ms. Allocated memory was 224.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 110.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 395.2MB. Max. memory is 8.0GB. [2022-01-11 06:24:20,210 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 516.34ms. Allocated memory was 181.4MB in the beginning and 224.4MB in the end (delta: 43.0MB). Free memory was 131.0MB in the beginning and 188.3MB in the end (delta: -57.3MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.54ms. Allocated memory is still 224.4MB. Free memory was 188.3MB in the beginning and 184.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.60ms. Allocated memory is still 224.4MB. Free memory was 184.1MB in the beginning and 181.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1046.62ms. Allocated memory is still 224.4MB. Free memory was 181.0MB in the beginning and 126.5MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * IcfgTransformer took 614.42ms. Allocated memory is still 224.4MB. Free memory was 126.5MB in the beginning and 110.6MB in the end (delta: 15.8MB). Peak memory consumption was 61.4MB. Max. memory is 8.0GB. * TraceAbstraction took 24422.64ms. Allocated memory was 224.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 110.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 395.2MB. 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: 527]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] port_t p12 = 0; [L27] char p12_old = '\x0'; [L28] char p12_new = '\x0'; [L29] _Bool ep12 = 0; [L30] port_t p13 = 0; [L31] char p13_old = '\x0'; [L32] char p13_new = '\x0'; [L33] _Bool ep13 = 0; [L34] port_t p21 = 0; [L35] char p21_old = '\x0'; [L36] char p21_new = '\x0'; [L37] _Bool ep21 = 0; [L38] port_t p23 = 0; [L39] char p23_old = '\x0'; [L40] char p23_new = '\x0'; [L41] _Bool ep23 = 0; [L42] port_t p31 = 0; [L43] char p31_old = '\x0'; [L44] char p31_new = '\x0'; [L45] _Bool ep31 = 0; [L46] port_t p32 = 0; [L47] char p32_old = '\x0'; [L48] char p32_new = '\x0'; [L49] _Bool ep32 = 0; [L50] char id1 = '\x0'; [L51] char r1 = '\x0'; [L52] char st1 = '\x0'; [L53] char nl1 = '\x0'; [L54] char m1 = '\x0'; [L55] char max1 = '\x0'; [L56] _Bool mode1 = 0; [L57] char id2 = '\x0'; [L58] char r2 = '\x0'; [L59] char st2 = '\x0'; [L60] char nl2 = '\x0'; [L61] char m2 = '\x0'; [L62] char max2 = '\x0'; [L63] _Bool mode2 = 0; [L64] char id3 = '\x0'; [L65] char r3 = '\x0'; [L66] char st3 = '\x0'; [L67] char nl3 = '\x0'; [L68] char m3 = '\x0'; [L69] char max3 = '\x0'; [L70] _Bool mode3 = 0; [L74] void (*nodes[3])() = { &node1, &node2, &node3 }; [L78] int __return_1131; [L79] int __return_1259; [L80] int __return_1679; [L81] int __return_1378; [L82] int __tmp_1379_0; [L83] int __return_1487; [L84] int __return_1392; VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L87] int main__c1; [L88] int main__i2; [L89] main__c1 = 0 [L90] ep12 = __VERIFIER_nondet_bool() [L91] ep13 = __VERIFIER_nondet_bool() [L92] ep21 = __VERIFIER_nondet_bool() [L93] ep23 = __VERIFIER_nondet_bool() [L94] ep31 = __VERIFIER_nondet_bool() [L95] ep32 = __VERIFIER_nondet_bool() [L96] id1 = __VERIFIER_nondet_char() [L97] r1 = __VERIFIER_nondet_char() [L98] st1 = __VERIFIER_nondet_char() [L99] nl1 = __VERIFIER_nondet_char() [L100] m1 = __VERIFIER_nondet_char() [L101] max1 = __VERIFIER_nondet_char() [L102] mode1 = __VERIFIER_nondet_bool() [L103] id2 = __VERIFIER_nondet_char() [L104] r2 = __VERIFIER_nondet_char() [L105] st2 = __VERIFIER_nondet_char() [L106] nl2 = __VERIFIER_nondet_char() [L107] m2 = __VERIFIER_nondet_char() [L108] max2 = __VERIFIER_nondet_char() [L109] mode2 = __VERIFIER_nondet_bool() [L110] id3 = __VERIFIER_nondet_char() [L111] r3 = __VERIFIER_nondet_char() [L112] st3 = __VERIFIER_nondet_char() [L113] nl3 = __VERIFIER_nondet_char() [L114] m3 = __VERIFIER_nondet_char() [L115] max3 = __VERIFIER_nondet_char() [L116] mode3 = __VERIFIER_nondet_bool() [L118] _Bool init__r121; [L119] _Bool init__r131; [L120] _Bool init__r211; [L121] _Bool init__r231; [L122] _Bool init__r311; [L123] _Bool init__r321; [L124] _Bool init__r122; [L125] int init__tmp; [L126] _Bool init__r132; [L127] int init__tmp___0; [L128] _Bool init__r212; [L129] int init__tmp___1; [L130] _Bool init__r232; [L131] int init__tmp___2; [L132] _Bool init__r312; [L133] int init__tmp___3; [L134] _Bool init__r322; [L135] int init__tmp___4; [L136] int init__tmp___5; [L137] init__r121 = ep12 [L138] init__r131 = ep13 [L139] init__r211 = ep21 [L140] init__r231 = ep23 [L141] init__r311 = ep31 [L142] init__r321 = ep32 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L143] COND TRUE !(init__r121 == 0) [L145] init__tmp = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L147] init__r122 = (_Bool)init__tmp VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L148] COND FALSE !(!(init__r131 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L1789] COND TRUE !(init__r121 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L1791] COND TRUE !(ep23 == 0) [L1793] init__tmp___0 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L152] init__r132 = (_Bool)init__tmp___0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L153] COND FALSE !(!(init__r211 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L1766] COND TRUE !(init__r231 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L1768] COND TRUE !(ep31 == 0) [L1770] init__tmp___1 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L157] init__r212 = (_Bool)init__tmp___1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L158] COND TRUE !(init__r231 == 0) [L160] init__tmp___2 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L162] init__r232 = (_Bool)init__tmp___2 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L163] COND TRUE !(init__r311 == 0) [L165] init__tmp___3 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L167] init__r312 = (_Bool)init__tmp___3 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L168] COND FALSE !(!(init__r321 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L1697] COND TRUE !(init__r311 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L1699] COND TRUE !(ep12 == 0) [L1701] init__tmp___4 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L172] init__r322 = (_Bool)init__tmp___4 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L173] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L175] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L177] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L179] COND TRUE ((int)id1) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L181] COND TRUE ((int)id2) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L183] COND TRUE ((int)id3) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0] [L185] COND TRUE ((int)r1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0] [L187] COND TRUE ((int)r2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0] [L189] COND TRUE ((int)r3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0] [L191] COND TRUE !(init__r122 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0] [L193] COND TRUE !(init__r132 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0] [L195] COND TRUE !(init__r212 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0] [L197] COND TRUE !(init__r232 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0] [L199] COND TRUE !(init__r312 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0] [L201] COND TRUE !(init__r322 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0] [L203] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0] [L205] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0] [L207] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0] [L209] COND TRUE ((int)st1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0] [L211] COND TRUE ((int)st2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0] [L213] COND TRUE ((int)st3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)nl1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nl1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE ((int)nl2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nl1=0, nl2=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE ((int)nl3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE ((int)mode1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L223] COND TRUE ((int)mode2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L225] COND TRUE ((int)mode3) == 0 [L227] init__tmp___5 = 1 [L228] __return_1131 = init__tmp___5 [L229] main__i2 = __return_1131 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=1, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE main__i2 != 0 [L232] p12_old = nomsg [L233] p12_new = nomsg [L234] p13_old = nomsg [L235] p13_new = nomsg [L236] p21_old = nomsg [L237] p21_new = nomsg [L238] p23_old = nomsg [L239] p23_new = nomsg [L240] p31_old = nomsg [L241] p31_new = nomsg [L242] p32_old = nomsg [L243] p32_new = nomsg [L244] main__i2 = 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L245] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L248] COND FALSE !(!(mode1 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L256] COND TRUE !(ep12 == 0) [L258] int node1____CPAchecker_TMP_0; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L259] COND TRUE max1 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] COND TRUE p12_new == nomsg [L263] node1____CPAchecker_TMP_0 = max1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L265] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND FALSE !(!(ep13 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L278] mode1 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L280] COND FALSE !(!(mode2 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L286] COND TRUE ((int)r2) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L288] COND FALSE !(!(ep21 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L299] COND TRUE !(ep23 == 0) [L301] int node2____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L302] COND TRUE max2 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L304] COND TRUE p23_new == nomsg [L306] node2____CPAchecker_TMP_1 = max2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L308] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L310] mode2 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L312] COND FALSE !(!(mode3 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] COND TRUE ((int)r3) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L320] COND TRUE !(ep31 == 0) [L322] int node3____CPAchecker_TMP_0; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L323] COND TRUE max3 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L325] COND TRUE p31_new == nomsg [L327] node3____CPAchecker_TMP_0 = max3 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L329] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=0, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L331] COND FALSE !(!(ep32 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=0, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] mode3 = 1 [L343] p12_old = p12_new [L344] p12_new = nomsg [L345] p13_old = p13_new [L346] p13_new = nomsg [L347] p21_old = p21_new [L348] p21_new = nomsg [L349] p23_old = p23_new [L350] p23_new = nomsg [L351] p31_old = p31_new [L352] p31_new = nomsg [L353] p32_old = p32_new [L354] p32_new = nomsg [L356] int check__tmp; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L359] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L361] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L363] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L381] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((int)r1) < 2 [L385] check__tmp = 1 [L386] __return_1259 = check__tmp [L387] main__c1 = __return_1259 [L389] _Bool __tmp_1; [L390] __tmp_1 = main__c1 [L391] _Bool assert__arg; [L392] assert__arg = __tmp_1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND FALSE !(assert__arg == 0) [L399] int main____CPAchecker_TMP_0 = main__i2; [L400] main__i2 = main__i2 + 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L404] COND TRUE !(mode1 == 0) [L406] r1 = (char)(((int)r1) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND FALSE !(!(ep21 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE !(ep31 == 0) [L417] m1 = p31_old [L418] p31_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L419] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int)r1) == 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE ((int)max1) == ((int)id1) [L427] st1 = 1 [L428] mode1 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=1, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L430] COND TRUE !(mode2 == 0) [L432] r2 = (char)(((int)r2) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=1, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L433] COND TRUE !(ep12 == 0) [L435] m2 = p12_old [L436] p12_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=1, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L437] COND TRUE ((int)m2) > ((int)max2) [L439] max2 = m2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L441] COND FALSE !(!(ep32 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L449] COND FALSE !(((int)r2) == 2) [L455] mode2 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L457] COND TRUE !(mode3 == 0) [L459] r3 = (char)(((int)r3) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L460] COND FALSE !(!(ep13 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L468] COND TRUE !(ep23 == 0) [L470] m3 = p23_old [L471] p23_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L472] COND TRUE ((int)m3) > ((int)max3) [L474] max3 = m3 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L476] COND FALSE !(((int)r3) == 2) [L482] mode3 = 0 [L483] p12_old = p12_new [L484] p12_new = nomsg [L485] p13_old = p13_new [L486] p13_new = nomsg [L487] p21_old = p21_new [L488] p21_new = nomsg [L489] p23_old = p23_new [L490] p23_new = nomsg [L491] p31_old = p31_new [L492] p31_new = nomsg [L493] p32_old = p32_new [L494] p32_new = nomsg [L496] int check__tmp; VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L497] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L499] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L501] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L503] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L505] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L511] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L517] check__tmp = 0 [L518] __return_1679 = check__tmp [L519] main__c1 = __return_1679 [L521] _Bool __tmp_2; [L522] __tmp_2 = main__c1 [L523] _Bool assert__arg; [L524] assert__arg = __tmp_2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, __tmp_2=0, assert__arg=1, assert__arg=0, check__tmp=1, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=0, main__i2=1, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L525] COND TRUE assert__arg == 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, __tmp_2=0, assert__arg=0, assert__arg=1, check__tmp=1, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=0, main__i2=1, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L527] reach_error() VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1=1, __tmp_1379_0=0, __tmp_2=0, assert__arg=1, assert__arg=0, check__tmp=1, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main____CPAchecker_TMP_0=0, main__c1=0, main__i2=1, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node2____CPAchecker_TMP_1=1, node3____CPAchecker_TMP_0=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - UnprovableResult [Line: 728]: 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, 237 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9905 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9905 mSDsluCounter, 20867 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9860 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 970 IncrementalHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 11007 mSDtfsCounter, 970 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6793occurred in iteration=20, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 13539 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2218 NumberOfCodeBlocks, 2218 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2088 ConstructedInterpolants, 0 QuantifiedInterpolants, 12728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-11 06:24:20,231 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...