./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3a9fbf61771579e3e5f979c3029cdc28b5b93f1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 17:55:41,062 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 17:55:41,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 17:55:41,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 17:55:41,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 17:55:41,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 17:55:41,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 17:55:41,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 17:55:41,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 17:55:41,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 17:55:41,087 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 17:55:41,087 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 17:55:41,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 17:55:41,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 17:55:41,090 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 17:55:41,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 17:55:41,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 17:55:41,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 17:55:41,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 17:55:41,097 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 17:55:41,098 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 17:55:41,099 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 17:55:41,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 17:55:41,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 17:55:41,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 17:55:41,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 17:55:41,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 17:55:41,105 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 17:55:41,106 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 17:55:41,107 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 17:55:41,107 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 17:55:41,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 17:55:41,112 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 17:55:41,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 17:55:41,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 17:55:41,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 17:55:41,117 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 17:55:41,137 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 17:55:41,137 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 17:55:41,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 17:55:41,139 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 17:55:41,139 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 17:55:41,139 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 17:55:41,139 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 17:55:41,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 17:55:41,139 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 17:55:41,140 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 17:55:41,140 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 17:55:41,140 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 17:55:41,140 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 17:55:41,140 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 17:55:41,141 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 17:55:41,142 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 17:55:41,142 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 17:55:41,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 17:55:41,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 17:55:41,143 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 17:55:41,143 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 17:55:41,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 17:55:41,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 17:55:41,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 17:55:41,145 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 17:55:41,145 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 17:55:41,145 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 17:55:41,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 17:55:41,145 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3a9fbf61771579e3e5f979c3029cdc28b5b93f1 [2019-01-12 17:55:41,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 17:55:41,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 17:55:41,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 17:55:41,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 17:55:41,197 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 17:55:41,197 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-01-12 17:55:41,260 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617487622/387325b7881f4630a4f085179e4f9b20/FLAG70cdcee67 [2019-01-12 17:55:41,720 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 17:55:41,721 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-01-12 17:55:41,732 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617487622/387325b7881f4630a4f085179e4f9b20/FLAG70cdcee67 [2019-01-12 17:55:42,031 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617487622/387325b7881f4630a4f085179e4f9b20 [2019-01-12 17:55:42,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 17:55:42,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 17:55:42,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 17:55:42,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 17:55:42,040 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 17:55:42,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:42,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8cb670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42, skipping insertion in model container [2019-01-12 17:55:42,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:42,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 17:55:42,117 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 17:55:42,572 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 17:55:42,597 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 17:55:42,774 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 17:55:42,870 INFO L195 MainTranslator]: Completed translation [2019-01-12 17:55:42,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42 WrapperNode [2019-01-12 17:55:42,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 17:55:42,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 17:55:42,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 17:55:42,874 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 17:55:42,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:42,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:42,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 17:55:42,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 17:55:42,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 17:55:42,961 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 17:55:42,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:42,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:42,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:42,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:42,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:42,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:43,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (1/1) ... [2019-01-12 17:55:43,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 17:55:43,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 17:55:43,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 17:55:43,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 17:55:43,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 17:55:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 17:55:43,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 17:55:44,849 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 17:55:44,849 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 17:55:44,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:44 BoogieIcfgContainer [2019-01-12 17:55:44,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 17:55:44,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 17:55:44,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 17:55:44,854 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 17:55:44,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 05:55:42" (1/3) ... [2019-01-12 17:55:44,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a901f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:55:44, skipping insertion in model container [2019-01-12 17:55:44,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:42" (2/3) ... [2019-01-12 17:55:44,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a901f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:55:44, skipping insertion in model container [2019-01-12 17:55:44,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:44" (3/3) ... [2019-01-12 17:55:44,858 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-01-12 17:55:44,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 17:55:44,873 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 17:55:44,889 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 17:55:44,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 17:55:44,922 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 17:55:44,922 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 17:55:44,922 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 17:55:44,922 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 17:55:44,922 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 17:55:44,923 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 17:55:44,923 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 17:55:44,923 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 17:55:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-01-12 17:55:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 17:55:44,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:44,957 INFO L402 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] [2019-01-12 17:55:44,960 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:44,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:44,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1885524630, now seen corresponding path program 1 times [2019-01-12 17:55:44,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:44,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:45,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:45,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:45,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:45,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:45,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:45,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:45,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:45,460 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-01-12 17:55:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:45,855 INFO L93 Difference]: Finished difference Result 452 states and 785 transitions. [2019-01-12 17:55:45,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:45,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-01-12 17:55:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:45,894 INFO L225 Difference]: With dead ends: 452 [2019-01-12 17:55:45,894 INFO L226 Difference]: Without dead ends: 334 [2019-01-12 17:55:45,900 INFO L631 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 [2019-01-12 17:55:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-12 17:55:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-01-12 17:55:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-01-12 17:55:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2019-01-12 17:55:45,992 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 95 [2019-01-12 17:55:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:45,992 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2019-01-12 17:55:45,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2019-01-12 17:55:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 17:55:45,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:45,998 INFO L402 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] [2019-01-12 17:55:45,998 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash -614138391, now seen corresponding path program 1 times [2019-01-12 17:55:45,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:45,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:46,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:46,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:46,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:46,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:46,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:46,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:46,278 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand 4 states. [2019-01-12 17:55:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:46,702 INFO L93 Difference]: Finished difference Result 965 states and 1470 transitions. [2019-01-12 17:55:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:46,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-12 17:55:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:46,708 INFO L225 Difference]: With dead ends: 965 [2019-01-12 17:55:46,708 INFO L226 Difference]: Without dead ends: 642 [2019-01-12 17:55:46,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-01-12 17:55:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-01-12 17:55:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-01-12 17:55:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 968 transitions. [2019-01-12 17:55:46,795 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 968 transitions. Word has length 95 [2019-01-12 17:55:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:46,795 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 968 transitions. [2019-01-12 17:55:46,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 968 transitions. [2019-01-12 17:55:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 17:55:46,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:46,812 INFO L402 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] [2019-01-12 17:55:46,813 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:46,813 INFO L82 PathProgramCache]: Analyzing trace with hash -779319531, now seen corresponding path program 1 times [2019-01-12 17:55:46,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:46,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:46,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:46,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:46,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:46,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:46,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:46,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:46,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:46,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:46,944 INFO L87 Difference]: Start difference. First operand 640 states and 968 transitions. Second operand 3 states. [2019-01-12 17:55:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:47,084 INFO L93 Difference]: Finished difference Result 1882 states and 2842 transitions. [2019-01-12 17:55:47,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:47,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-12 17:55:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:47,095 INFO L225 Difference]: With dead ends: 1882 [2019-01-12 17:55:47,095 INFO L226 Difference]: Without dead ends: 1270 [2019-01-12 17:55:47,098 INFO L631 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 [2019-01-12 17:55:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-01-12 17:55:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 642. [2019-01-12 17:55:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-01-12 17:55:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 970 transitions. [2019-01-12 17:55:47,165 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 970 transitions. Word has length 96 [2019-01-12 17:55:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:47,165 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 970 transitions. [2019-01-12 17:55:47,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 970 transitions. [2019-01-12 17:55:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 17:55:47,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:47,169 INFO L402 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] [2019-01-12 17:55:47,169 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:47,170 INFO L82 PathProgramCache]: Analyzing trace with hash -611891448, now seen corresponding path program 1 times [2019-01-12 17:55:47,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:47,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:47,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:47,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:47,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:47,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:47,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:47,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:47,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:47,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:47,336 INFO L87 Difference]: Start difference. First operand 642 states and 970 transitions. Second operand 4 states. [2019-01-12 17:55:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:47,516 INFO L93 Difference]: Finished difference Result 1274 states and 1926 transitions. [2019-01-12 17:55:47,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:47,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-01-12 17:55:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:47,521 INFO L225 Difference]: With dead ends: 1274 [2019-01-12 17:55:47,521 INFO L226 Difference]: Without dead ends: 640 [2019-01-12 17:55:47,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-01-12 17:55:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-01-12 17:55:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-01-12 17:55:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 966 transitions. [2019-01-12 17:55:47,574 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 966 transitions. Word has length 97 [2019-01-12 17:55:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:47,574 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 966 transitions. [2019-01-12 17:55:47,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 966 transitions. [2019-01-12 17:55:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 17:55:47,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:47,576 INFO L402 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] [2019-01-12 17:55:47,577 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:47,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash -981864435, now seen corresponding path program 1 times [2019-01-12 17:55:47,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:47,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:47,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:47,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:47,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:47,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:47,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:47,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:47,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:47,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:47,753 INFO L87 Difference]: Start difference. First operand 640 states and 966 transitions. Second operand 3 states. [2019-01-12 17:55:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:48,065 INFO L93 Difference]: Finished difference Result 1414 states and 2157 transitions. [2019-01-12 17:55:48,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:48,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-12 17:55:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:48,070 INFO L225 Difference]: With dead ends: 1414 [2019-01-12 17:55:48,071 INFO L226 Difference]: Without dead ends: 948 [2019-01-12 17:55:48,072 INFO L631 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 [2019-01-12 17:55:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-01-12 17:55:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 946. [2019-01-12 17:55:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-01-12 17:55:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1411 transitions. [2019-01-12 17:55:48,144 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1411 transitions. Word has length 97 [2019-01-12 17:55:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:48,144 INFO L480 AbstractCegarLoop]: Abstraction has 946 states and 1411 transitions. [2019-01-12 17:55:48,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1411 transitions. [2019-01-12 17:55:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 17:55:48,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:48,146 INFO L402 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] [2019-01-12 17:55:48,146 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:48,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:48,147 INFO L82 PathProgramCache]: Analyzing trace with hash -83426502, now seen corresponding path program 1 times [2019-01-12 17:55:48,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:48,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:48,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:48,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:48,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:48,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:48,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:48,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:48,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:48,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:48,471 INFO L87 Difference]: Start difference. First operand 946 states and 1411 transitions. Second operand 4 states. [2019-01-12 17:55:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:48,991 INFO L93 Difference]: Finished difference Result 2376 states and 3546 transitions. [2019-01-12 17:55:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:48,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-01-12 17:55:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:49,001 INFO L225 Difference]: With dead ends: 2376 [2019-01-12 17:55:49,001 INFO L226 Difference]: Without dead ends: 1449 [2019-01-12 17:55:49,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2019-01-12 17:55:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1447. [2019-01-12 17:55:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-01-12 17:55:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2139 transitions. [2019-01-12 17:55:49,118 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2139 transitions. Word has length 99 [2019-01-12 17:55:49,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:49,118 INFO L480 AbstractCegarLoop]: Abstraction has 1447 states and 2139 transitions. [2019-01-12 17:55:49,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2139 transitions. [2019-01-12 17:55:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 17:55:49,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:49,121 INFO L402 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] [2019-01-12 17:55:49,121 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1303974225, now seen corresponding path program 1 times [2019-01-12 17:55:49,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:49,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:49,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:49,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:49,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:49,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:49,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:49,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:49,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:49,298 INFO L87 Difference]: Start difference. First operand 1447 states and 2139 transitions. Second operand 4 states. [2019-01-12 17:55:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:49,564 INFO L93 Difference]: Finished difference Result 2507 states and 3725 transitions. [2019-01-12 17:55:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:49,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-12 17:55:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:49,571 INFO L225 Difference]: With dead ends: 2507 [2019-01-12 17:55:49,572 INFO L226 Difference]: Without dead ends: 1447 [2019-01-12 17:55:49,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2019-01-12 17:55:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2019-01-12 17:55:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-01-12 17:55:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2138 transitions. [2019-01-12 17:55:49,683 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2138 transitions. Word has length 101 [2019-01-12 17:55:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:49,684 INFO L480 AbstractCegarLoop]: Abstraction has 1447 states and 2138 transitions. [2019-01-12 17:55:49,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2138 transitions. [2019-01-12 17:55:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 17:55:49,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:49,686 INFO L402 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] [2019-01-12 17:55:49,686 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:49,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:49,687 INFO L82 PathProgramCache]: Analyzing trace with hash 963915244, now seen corresponding path program 1 times [2019-01-12 17:55:49,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:49,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:49,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:49,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:49,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:49,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:49,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:49,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:49,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:49,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:49,783 INFO L87 Difference]: Start difference. First operand 1447 states and 2138 transitions. Second operand 3 states. [2019-01-12 17:55:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:50,180 INFO L93 Difference]: Finished difference Result 3304 states and 4953 transitions. [2019-01-12 17:55:50,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:50,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-12 17:55:50,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:50,192 INFO L225 Difference]: With dead ends: 3304 [2019-01-12 17:55:50,192 INFO L226 Difference]: Without dead ends: 2196 [2019-01-12 17:55:50,195 INFO L631 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 [2019-01-12 17:55:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2019-01-12 17:55:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2194. [2019-01-12 17:55:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2019-01-12 17:55:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 3218 transitions. [2019-01-12 17:55:50,491 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 3218 transitions. Word has length 101 [2019-01-12 17:55:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:50,491 INFO L480 AbstractCegarLoop]: Abstraction has 2194 states and 3218 transitions. [2019-01-12 17:55:50,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 3218 transitions. [2019-01-12 17:55:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 17:55:50,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:50,495 INFO L402 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] [2019-01-12 17:55:50,496 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1817525050, now seen corresponding path program 1 times [2019-01-12 17:55:50,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:50,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:50,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:50,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:50,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:50,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:50,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:50,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:50,789 INFO L87 Difference]: Start difference. First operand 2194 states and 3218 transitions. Second operand 4 states. [2019-01-12 17:55:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:51,649 INFO L93 Difference]: Finished difference Result 6348 states and 9298 transitions. [2019-01-12 17:55:51,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:51,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-12 17:55:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:51,670 INFO L225 Difference]: With dead ends: 6348 [2019-01-12 17:55:51,670 INFO L226 Difference]: Without dead ends: 4193 [2019-01-12 17:55:51,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2019-01-12 17:55:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 4191. [2019-01-12 17:55:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4191 states. [2019-01-12 17:55:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 6087 transitions. [2019-01-12 17:55:52,010 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 6087 transitions. Word has length 103 [2019-01-12 17:55:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:52,010 INFO L480 AbstractCegarLoop]: Abstraction has 4191 states and 6087 transitions. [2019-01-12 17:55:52,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 6087 transitions. [2019-01-12 17:55:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 17:55:52,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:52,015 INFO L402 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] [2019-01-12 17:55:52,016 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:52,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash -399665424, now seen corresponding path program 1 times [2019-01-12 17:55:52,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:52,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:52,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:52,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:52,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:52,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:52,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:52,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:52,097 INFO L87 Difference]: Start difference. First operand 4191 states and 6087 transitions. Second operand 3 states. [2019-01-12 17:55:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:52,752 INFO L93 Difference]: Finished difference Result 12389 states and 18020 transitions. [2019-01-12 17:55:52,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:52,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-12 17:55:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:52,791 INFO L225 Difference]: With dead ends: 12389 [2019-01-12 17:55:52,791 INFO L226 Difference]: Without dead ends: 8299 [2019-01-12 17:55:52,797 INFO L631 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 [2019-01-12 17:55:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8299 states. [2019-01-12 17:55:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8299 to 4197. [2019-01-12 17:55:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4197 states. [2019-01-12 17:55:53,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 6093 transitions. [2019-01-12 17:55:53,214 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 6093 transitions. Word has length 104 [2019-01-12 17:55:53,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:53,214 INFO L480 AbstractCegarLoop]: Abstraction has 4197 states and 6093 transitions. [2019-01-12 17:55:53,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 6093 transitions. [2019-01-12 17:55:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 17:55:53,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:53,220 INFO L402 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] [2019-01-12 17:55:53,220 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:53,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:53,220 INFO L82 PathProgramCache]: Analyzing trace with hash -789174747, now seen corresponding path program 1 times [2019-01-12 17:55:53,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:53,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:53,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:53,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:53,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:53,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:53,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:53,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:53,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:53,399 INFO L87 Difference]: Start difference. First operand 4197 states and 6093 transitions. Second operand 4 states. [2019-01-12 17:55:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:53,842 INFO L93 Difference]: Finished difference Result 8356 states and 12134 transitions. [2019-01-12 17:55:53,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:53,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-01-12 17:55:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:53,873 INFO L225 Difference]: With dead ends: 8356 [2019-01-12 17:55:53,873 INFO L226 Difference]: Without dead ends: 4191 [2019-01-12 17:55:53,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2019-01-12 17:55:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 4191. [2019-01-12 17:55:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4191 states. [2019-01-12 17:55:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 6081 transitions. [2019-01-12 17:55:54,269 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 6081 transitions. Word has length 105 [2019-01-12 17:55:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:54,269 INFO L480 AbstractCegarLoop]: Abstraction has 4191 states and 6081 transitions. [2019-01-12 17:55:54,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 6081 transitions. [2019-01-12 17:55:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 17:55:54,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:54,277 INFO L402 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] [2019-01-12 17:55:54,277 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1175492870, now seen corresponding path program 1 times [2019-01-12 17:55:54,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:54,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:54,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:54,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:54,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:54,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:54,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:54,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:54,391 INFO L87 Difference]: Start difference. First operand 4191 states and 6081 transitions. Second operand 3 states. [2019-01-12 17:55:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:54,837 INFO L93 Difference]: Finished difference Result 9749 states and 14248 transitions. [2019-01-12 17:55:54,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:54,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-12 17:55:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:54,849 INFO L225 Difference]: With dead ends: 9749 [2019-01-12 17:55:54,850 INFO L226 Difference]: Without dead ends: 6229 [2019-01-12 17:55:54,856 INFO L631 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 [2019-01-12 17:55:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6229 states. [2019-01-12 17:55:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6229 to 6227. [2019-01-12 17:55:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2019-01-12 17:55:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 8896 transitions. [2019-01-12 17:55:55,481 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 8896 transitions. Word has length 105 [2019-01-12 17:55:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:55,482 INFO L480 AbstractCegarLoop]: Abstraction has 6227 states and 8896 transitions. [2019-01-12 17:55:55,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 8896 transitions. [2019-01-12 17:55:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 17:55:55,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:55,493 INFO L402 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] [2019-01-12 17:55:55,493 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:55,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:55,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1323620079, now seen corresponding path program 1 times [2019-01-12 17:55:55,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:55,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:55,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:55,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:55,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:55,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:55,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:55,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:55,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:55,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:55,902 INFO L87 Difference]: Start difference. First operand 6227 states and 8896 transitions. Second operand 4 states. [2019-01-12 17:55:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:56,851 INFO L93 Difference]: Finished difference Result 11577 states and 16555 transitions. [2019-01-12 17:55:56,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:56,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-01-12 17:55:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:56,862 INFO L225 Difference]: With dead ends: 11577 [2019-01-12 17:55:56,862 INFO L226 Difference]: Without dead ends: 5619 [2019-01-12 17:55:56,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5619 states. [2019-01-12 17:55:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5619 to 5582. [2019-01-12 17:55:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5582 states. [2019-01-12 17:55:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5582 states to 5582 states and 7926 transitions. [2019-01-12 17:55:57,480 INFO L78 Accepts]: Start accepts. Automaton has 5582 states and 7926 transitions. Word has length 107 [2019-01-12 17:55:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:57,480 INFO L480 AbstractCegarLoop]: Abstraction has 5582 states and 7926 transitions. [2019-01-12 17:55:57,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 5582 states and 7926 transitions. [2019-01-12 17:55:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 17:55:57,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:57,486 INFO L402 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] [2019-01-12 17:55:57,486 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1709812529, now seen corresponding path program 1 times [2019-01-12 17:55:57,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:57,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:57,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:57,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:57,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:57,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:57,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:57,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:57,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:57,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:57,576 INFO L87 Difference]: Start difference. First operand 5582 states and 7926 transitions. Second operand 3 states. [2019-01-12 17:55:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:58,734 INFO L93 Difference]: Finished difference Result 14170 states and 20651 transitions. [2019-01-12 17:55:58,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:58,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-01-12 17:55:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:58,753 INFO L225 Difference]: With dead ends: 14170 [2019-01-12 17:55:58,753 INFO L226 Difference]: Without dead ends: 10298 [2019-01-12 17:55:58,759 INFO L631 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 [2019-01-12 17:55:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10298 states. [2019-01-12 17:55:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10298 to 10296. [2019-01-12 17:55:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10296 states. [2019-01-12 17:55:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10296 states to 10296 states and 14706 transitions. [2019-01-12 17:55:59,555 INFO L78 Accepts]: Start accepts. Automaton has 10296 states and 14706 transitions. Word has length 109 [2019-01-12 17:55:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:59,555 INFO L480 AbstractCegarLoop]: Abstraction has 10296 states and 14706 transitions. [2019-01-12 17:55:59,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 10296 states and 14706 transitions. [2019-01-12 17:55:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 17:55:59,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:59,568 INFO L402 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] [2019-01-12 17:55:59,568 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1172299126, now seen corresponding path program 1 times [2019-01-12 17:55:59,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:59,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:59,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:59,857 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 17:55:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:59,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:59,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:59,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:59,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:59,897 INFO L87 Difference]: Start difference. First operand 10296 states and 14706 transitions. Second operand 4 states. [2019-01-12 17:56:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:00,907 INFO L93 Difference]: Finished difference Result 20649 states and 29486 transitions. [2019-01-12 17:56:00,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:00,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-01-12 17:56:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:00,925 INFO L225 Difference]: With dead ends: 20649 [2019-01-12 17:56:00,925 INFO L226 Difference]: Without dead ends: 10502 [2019-01-12 17:56:00,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2019-01-12 17:56:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 10408. [2019-01-12 17:56:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10408 states. [2019-01-12 17:56:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10408 states to 10408 states and 14827 transitions. [2019-01-12 17:56:01,763 INFO L78 Accepts]: Start accepts. Automaton has 10408 states and 14827 transitions. Word has length 109 [2019-01-12 17:56:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:01,763 INFO L480 AbstractCegarLoop]: Abstraction has 10408 states and 14827 transitions. [2019-01-12 17:56:01,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:56:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 10408 states and 14827 transitions. [2019-01-12 17:56:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 17:56:01,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:01,771 INFO L402 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, 1] [2019-01-12 17:56:01,771 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash 808379514, now seen corresponding path program 1 times [2019-01-12 17:56:01,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:01,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:01,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:01,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:01,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:01,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:01,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:56:01,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:56:01,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:56:01,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:56:01,846 INFO L87 Difference]: Start difference. First operand 10408 states and 14827 transitions. Second operand 3 states. [2019-01-12 17:56:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:03,084 INFO L93 Difference]: Finished difference Result 28055 states and 40150 transitions. [2019-01-12 17:56:03,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:56:03,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-01-12 17:56:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:03,112 INFO L225 Difference]: With dead ends: 28055 [2019-01-12 17:56:03,113 INFO L226 Difference]: Without dead ends: 20618 [2019-01-12 17:56:03,127 INFO L631 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 [2019-01-12 17:56:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20618 states. [2019-01-12 17:56:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20618 to 10418. [2019-01-12 17:56:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10418 states. [2019-01-12 17:56:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10418 states to 10418 states and 14837 transitions. [2019-01-12 17:56:04,365 INFO L78 Accepts]: Start accepts. Automaton has 10418 states and 14837 transitions. Word has length 110 [2019-01-12 17:56:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:04,366 INFO L480 AbstractCegarLoop]: Abstraction has 10418 states and 14837 transitions. [2019-01-12 17:56:04,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:56:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 10418 states and 14837 transitions. [2019-01-12 17:56:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 17:56:04,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:04,372 INFO L402 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, 1, 1] [2019-01-12 17:56:04,372 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:04,373 INFO L82 PathProgramCache]: Analyzing trace with hash 744989516, now seen corresponding path program 1 times [2019-01-12 17:56:04,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:04,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:04,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:04,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:04,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:56:04,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:56:04,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:56:04,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:56:04,475 INFO L87 Difference]: Start difference. First operand 10418 states and 14837 transitions. Second operand 3 states. [2019-01-12 17:56:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:05,900 INFO L93 Difference]: Finished difference Result 22638 states and 34147 transitions. [2019-01-12 17:56:05,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:56:05,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-01-12 17:56:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:05,919 INFO L225 Difference]: With dead ends: 22638 [2019-01-12 17:56:05,919 INFO L226 Difference]: Without dead ends: 16528 [2019-01-12 17:56:05,929 INFO L631 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 [2019-01-12 17:56:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16528 states. [2019-01-12 17:56:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16528 to 16484. [2019-01-12 17:56:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16484 states. [2019-01-12 17:56:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16484 states to 16484 states and 24155 transitions. [2019-01-12 17:56:07,429 INFO L78 Accepts]: Start accepts. Automaton has 16484 states and 24155 transitions. Word has length 111 [2019-01-12 17:56:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:07,430 INFO L480 AbstractCegarLoop]: Abstraction has 16484 states and 24155 transitions. [2019-01-12 17:56:07,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:56:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 16484 states and 24155 transitions. [2019-01-12 17:56:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 17:56:07,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:07,435 INFO L402 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, 1, 1] [2019-01-12 17:56:07,435 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:07,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1518514165, now seen corresponding path program 1 times [2019-01-12 17:56:07,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:07,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:07,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:07,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:07,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:07,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:07,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:07,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:56:07,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:56:07,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:07,722 INFO L87 Difference]: Start difference. First operand 16484 states and 24155 transitions. Second operand 5 states. [2019-01-12 17:56:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:09,794 INFO L93 Difference]: Finished difference Result 29849 states and 44598 transitions. [2019-01-12 17:56:09,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 17:56:09,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-12 17:56:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:09,809 INFO L225 Difference]: With dead ends: 29849 [2019-01-12 17:56:09,809 INFO L226 Difference]: Without dead ends: 15179 [2019-01-12 17:56:09,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 17:56:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15179 states. [2019-01-12 17:56:10,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15179 to 8747. [2019-01-12 17:56:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8747 states. [2019-01-12 17:56:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8747 states to 8747 states and 12635 transitions. [2019-01-12 17:56:10,889 INFO L78 Accepts]: Start accepts. Automaton has 8747 states and 12635 transitions. Word has length 111 [2019-01-12 17:56:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:10,889 INFO L480 AbstractCegarLoop]: Abstraction has 8747 states and 12635 transitions. [2019-01-12 17:56:10,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:56:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8747 states and 12635 transitions. [2019-01-12 17:56:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 17:56:10,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:10,892 INFO L402 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, 1, 1] [2019-01-12 17:56:10,893 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1352743846, now seen corresponding path program 1 times [2019-01-12 17:56:10,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:10,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:10,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:10,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:10,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:11,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:11,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:11,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:56:11,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:56:11,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:11,067 INFO L87 Difference]: Start difference. First operand 8747 states and 12635 transitions. Second operand 5 states. [2019-01-12 17:56:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:12,117 INFO L93 Difference]: Finished difference Result 15395 states and 22476 transitions. [2019-01-12 17:56:12,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 17:56:12,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-12 17:56:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:12,125 INFO L225 Difference]: With dead ends: 15395 [2019-01-12 17:56:12,125 INFO L226 Difference]: Without dead ends: 8747 [2019-01-12 17:56:12,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 17:56:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8747 states. [2019-01-12 17:56:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8747 to 8747. [2019-01-12 17:56:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8747 states. [2019-01-12 17:56:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8747 states to 8747 states and 12507 transitions. [2019-01-12 17:56:13,056 INFO L78 Accepts]: Start accepts. Automaton has 8747 states and 12507 transitions. Word has length 111 [2019-01-12 17:56:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:13,057 INFO L480 AbstractCegarLoop]: Abstraction has 8747 states and 12507 transitions. [2019-01-12 17:56:13,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:56:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 8747 states and 12507 transitions. [2019-01-12 17:56:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 17:56:13,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:13,061 INFO L402 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, 1, 1] [2019-01-12 17:56:13,061 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash -266400693, now seen corresponding path program 1 times [2019-01-12 17:56:13,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:13,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:13,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:13,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:13,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:13,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:13,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 17:56:13,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:56:13,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:56:13,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:13,386 INFO L87 Difference]: Start difference. First operand 8747 states and 12507 transitions. Second operand 5 states. [2019-01-12 17:56:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:15,077 INFO L93 Difference]: Finished difference Result 15379 states and 22558 transitions. [2019-01-12 17:56:15,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:15,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-12 17:56:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:15,084 INFO L225 Difference]: With dead ends: 15379 [2019-01-12 17:56:15,084 INFO L226 Difference]: Without dead ends: 8749 [2019-01-12 17:56:15,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 17:56:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8749 states. [2019-01-12 17:56:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8749 to 8747. [2019-01-12 17:56:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8747 states. [2019-01-12 17:56:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8747 states to 8747 states and 12444 transitions. [2019-01-12 17:56:15,967 INFO L78 Accepts]: Start accepts. Automaton has 8747 states and 12444 transitions. Word has length 111 [2019-01-12 17:56:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:15,968 INFO L480 AbstractCegarLoop]: Abstraction has 8747 states and 12444 transitions. [2019-01-12 17:56:15,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:56:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 8747 states and 12444 transitions. [2019-01-12 17:56:15,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 17:56:15,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:15,971 INFO L402 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, 1, 1] [2019-01-12 17:56:15,971 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:15,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2048402849, now seen corresponding path program 1 times [2019-01-12 17:56:15,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:15,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:15,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:15,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:15,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:16,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:16,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:16,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:56:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:56:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:56:16,136 INFO L87 Difference]: Start difference. First operand 8747 states and 12444 transitions. Second operand 4 states. [2019-01-12 17:56:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:17,113 INFO L93 Difference]: Finished difference Result 17597 states and 24996 transitions. [2019-01-12 17:56:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:17,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-01-12 17:56:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:17,121 INFO L225 Difference]: With dead ends: 17597 [2019-01-12 17:56:17,121 INFO L226 Difference]: Without dead ends: 9105 [2019-01-12 17:56:17,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9105 states. [2019-01-12 17:56:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9105 to 8968. [2019-01-12 17:56:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8968 states. [2019-01-12 17:56:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8968 states to 8968 states and 12668 transitions. [2019-01-12 17:56:18,138 INFO L78 Accepts]: Start accepts. Automaton has 8968 states and 12668 transitions. Word has length 111 [2019-01-12 17:56:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:18,138 INFO L480 AbstractCegarLoop]: Abstraction has 8968 states and 12668 transitions. [2019-01-12 17:56:18,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:56:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 8968 states and 12668 transitions. [2019-01-12 17:56:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 17:56:18,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:18,143 INFO L402 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, 1, 1] [2019-01-12 17:56:18,143 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:18,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:18,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1191527915, now seen corresponding path program 1 times [2019-01-12 17:56:18,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:18,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:18,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:18,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:18,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:18,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:18,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:18,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:56:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:56:18,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:56:18,301 INFO L87 Difference]: Start difference. First operand 8968 states and 12668 transitions. Second operand 4 states. [2019-01-12 17:56:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:19,705 INFO L93 Difference]: Finished difference Result 12532 states and 17778 transitions. [2019-01-12 17:56:19,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:19,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-01-12 17:56:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:19,713 INFO L225 Difference]: With dead ends: 12532 [2019-01-12 17:56:19,713 INFO L226 Difference]: Without dead ends: 7760 [2019-01-12 17:56:19,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7760 states. [2019-01-12 17:56:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7760 to 7760. [2019-01-12 17:56:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7760 states. [2019-01-12 17:56:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7760 states to 7760 states and 10925 transitions. [2019-01-12 17:56:20,509 INFO L78 Accepts]: Start accepts. Automaton has 7760 states and 10925 transitions. Word has length 111 [2019-01-12 17:56:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:20,509 INFO L480 AbstractCegarLoop]: Abstraction has 7760 states and 10925 transitions. [2019-01-12 17:56:20,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:56:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7760 states and 10925 transitions. [2019-01-12 17:56:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 17:56:20,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:20,515 INFO L402 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, 1, 1, 1, 1] [2019-01-12 17:56:20,515 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:20,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:20,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1910968843, now seen corresponding path program 1 times [2019-01-12 17:56:20,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:20,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:20,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:20,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:20,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:20,780 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 17:56:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:21,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:21,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-01-12 17:56:21,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 17:56:21,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 17:56:21,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-01-12 17:56:21,696 INFO L87 Difference]: Start difference. First operand 7760 states and 10925 transitions. Second operand 22 states. [2019-01-12 17:56:22,640 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-12 17:56:22,878 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-01-12 17:56:23,205 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-01-12 17:56:23,495 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-01-12 17:56:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:29,175 INFO L93 Difference]: Finished difference Result 22011 states and 31996 transitions. [2019-01-12 17:56:29,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 17:56:29,176 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 113 [2019-01-12 17:56:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:29,195 INFO L225 Difference]: With dead ends: 22011 [2019-01-12 17:56:29,195 INFO L226 Difference]: Without dead ends: 19537 [2019-01-12 17:56:29,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=286, Invalid=1120, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 17:56:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19537 states. [2019-01-12 17:56:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19537 to 8297. [2019-01-12 17:56:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8297 states. [2019-01-12 17:56:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 11567 transitions. [2019-01-12 17:56:30,439 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 11567 transitions. Word has length 113 [2019-01-12 17:56:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:30,440 INFO L480 AbstractCegarLoop]: Abstraction has 8297 states and 11567 transitions. [2019-01-12 17:56:30,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 17:56:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 11567 transitions. [2019-01-12 17:56:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 17:56:30,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:30,443 INFO L402 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, 1, 1, 1, 1] [2019-01-12 17:56:30,443 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash 655744324, now seen corresponding path program 1 times [2019-01-12 17:56:30,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:30,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:30,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:30,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:30,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 17:56:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 17:56:30,593 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 17:56:30,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 05:56:30 BoogieIcfgContainer [2019-01-12 17:56:30,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 17:56:30,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 17:56:30,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 17:56:30,789 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 17:56:30,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:44" (3/4) ... [2019-01-12 17:56:30,792 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 17:56:31,015 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 17:56:31,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 17:56:31,016 INFO L168 Benchmark]: Toolchain (without parser) took 48981.21 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 946.0 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 404.7 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:31,017 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 17:56:31,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:31,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:31,018 INFO L168 Benchmark]: Boogie Preprocessor took 46.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:31,020 INFO L168 Benchmark]: RCFGBuilder took 1843.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:31,021 INFO L168 Benchmark]: TraceAbstraction took 45936.31 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 288.5 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:31,021 INFO L168 Benchmark]: Witness Printer took 226.87 ms. Allocated memory is still 4.0 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2019-01-12 17:56:31,025 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 835.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1843.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45936.31 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 288.5 MB. Max. memory is 11.5 GB. * Witness Printer took 226.87 ms. Allocated memory is still 4.0 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 536]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] char id2 = '\x0'; [L45] unsigned char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] char id3 = '\x0'; [L52] unsigned char r3 = '\x0'; [L53] char st3 = '\x0'; [L54] char nl3 = '\x0'; [L55] char m3 = '\x0'; [L56] char max3 = '\x0'; [L57] _Bool mode3 = 0; [L61] void (*nodes[3])() = { &node1, &node2, &node3 }; [L65] int __return_1142; [L66] int __return_1270; [L67] int __return_1389; [L68] int __return_1499; VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=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=-1, 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] [L71] int main__c1; [L72] int main__i2; [L73] main__c1 = 0 [L74] ep12 = __VERIFIER_nondet_bool() [L75] ep13 = __VERIFIER_nondet_bool() [L76] ep21 = __VERIFIER_nondet_bool() [L77] ep23 = __VERIFIER_nondet_bool() [L78] ep31 = __VERIFIER_nondet_bool() [L79] ep32 = __VERIFIER_nondet_bool() [L80] id1 = __VERIFIER_nondet_char() [L81] r1 = __VERIFIER_nondet_uchar() [L82] st1 = __VERIFIER_nondet_char() [L83] nl1 = __VERIFIER_nondet_char() [L84] m1 = __VERIFIER_nondet_char() [L85] max1 = __VERIFIER_nondet_char() [L86] mode1 = __VERIFIER_nondet_bool() [L87] id2 = __VERIFIER_nondet_char() [L88] r2 = __VERIFIER_nondet_uchar() [L89] st2 = __VERIFIER_nondet_char() [L90] nl2 = __VERIFIER_nondet_char() [L91] m2 = __VERIFIER_nondet_char() [L92] max2 = __VERIFIER_nondet_char() [L93] mode2 = __VERIFIER_nondet_bool() [L94] id3 = __VERIFIER_nondet_char() [L95] r3 = __VERIFIER_nondet_uchar() [L96] st3 = __VERIFIER_nondet_char() [L97] nl3 = __VERIFIER_nondet_char() [L98] m3 = __VERIFIER_nondet_char() [L99] max3 = __VERIFIER_nondet_char() [L100] mode3 = __VERIFIER_nondet_bool() [L102] _Bool init__r121; [L103] _Bool init__r131; [L104] _Bool init__r211; [L105] _Bool init__r231; [L106] _Bool init__r311; [L107] _Bool init__r321; [L108] _Bool init__r122; [L109] int init__tmp; [L110] _Bool init__r132; [L111] int init__tmp___0; [L112] _Bool init__r212; [L113] int init__tmp___1; [L114] _Bool init__r232; [L115] int init__tmp___2; [L116] _Bool init__r312; [L117] int init__tmp___3; [L118] _Bool init__r322; [L119] int init__tmp___4; [L120] int init__tmp___5; [L121] init__r121 = ep12 [L122] init__r131 = ep13 [L123] init__r211 = ep21 [L124] init__r231 = ep23 [L125] init__r311 = ep31 [L126] init__r321 = ep32 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L127] COND TRUE !(init__r121 == 0) [L129] init__tmp = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L131] init__r122 = (_Bool)init__tmp VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L132] COND FALSE !(!(init__r131 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L1612] COND TRUE !(init__r121 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L1614] COND TRUE !(ep23 == 0) [L1616] init__tmp___0 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L136] init__r132 = (_Bool)init__tmp___0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L137] COND FALSE !(!(init__r211 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L1589] COND TRUE !(init__r231 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L1591] COND TRUE !(ep31 == 0) [L1593] init__tmp___1 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L141] init__r212 = (_Bool)init__tmp___1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L142] COND TRUE !(init__r231 == 0) [L144] init__tmp___2 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L146] init__r232 = (_Bool)init__tmp___2 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L147] COND TRUE !(init__r311 == 0) [L149] init__tmp___3 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L151] init__r312 = (_Bool)init__tmp___3 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L152] COND FALSE !(!(init__r321 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L1520] COND TRUE !(init__r311 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L1522] COND TRUE !(ep12 == 0) [L1524] init__tmp___4 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L156] init__r322 = (_Bool)init__tmp___4 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L157] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L159] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L161] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L163] COND TRUE ((int)id1) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L165] COND TRUE ((int)id2) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L167] COND TRUE ((int)id3) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L169] COND TRUE ((int)r1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L171] COND TRUE ((int)r2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L173] COND TRUE ((int)r3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L175] COND TRUE !(init__r122 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L177] COND TRUE !(init__r132 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L179] COND TRUE !(init__r212 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L181] COND TRUE !(init__r232 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L183] COND TRUE !(init__r312 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L185] COND TRUE !(init__r322 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L187] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L189] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L191] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L193] COND TRUE ((int)st1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L195] COND TRUE ((int)st2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L197] COND TRUE ((int)st3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L199] COND TRUE ((int)nl1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L201] COND TRUE ((int)nl2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L203] COND TRUE ((int)nl3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L205] COND TRUE ((int)mode1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L207] COND TRUE ((int)mode2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L209] COND TRUE ((int)mode3) == 0 [L211] init__tmp___5 = 1 [L212] __return_1142 = init__tmp___5 [L213] main__i2 = __return_1142 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, 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] [L214] COND TRUE main__i2 != 0 [L216] p12_old = nomsg [L217] p12_new = nomsg [L218] p13_old = nomsg [L219] p13_new = nomsg [L220] p21_old = nomsg [L221] p21_new = nomsg [L222] p23_old = nomsg [L223] p23_new = nomsg [L224] p31_old = nomsg [L225] p31_new = nomsg [L226] p32_old = nomsg [L227] p32_new = nomsg [L228] main__i2 = 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND FALSE !(!(mode1 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L236] COND TRUE ((int)r1) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L238] COND TRUE !(ep12 == 0) [L240] int node1____CPAchecker_TMP_0; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND TRUE max1 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L243] COND TRUE p12_new == nomsg [L245] node1____CPAchecker_TMP_0 = max1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L247] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L249] COND FALSE !(!(ep13 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L260] mode1 = 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L262] COND FALSE !(!(mode2 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L268] COND TRUE ((int)r2) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L270] COND FALSE !(!(ep21 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L281] COND TRUE !(ep23 == 0) [L283] int node2____CPAchecker_TMP_1; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L284] COND TRUE max2 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L286] COND TRUE p23_new == nomsg [L288] node2____CPAchecker_TMP_1 = max2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L290] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L292] mode2 = 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L294] COND FALSE !(!(mode3 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L300] COND TRUE ((int)r3) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L302] COND TRUE !(ep31 == 0) [L304] int node3____CPAchecker_TMP_0; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND TRUE max3 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L307] COND TRUE p31_new == nomsg [L309] node3____CPAchecker_TMP_0 = max3 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L311] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L313] COND FALSE !(!(ep32 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L324] mode3 = 1 [L325] p12_old = p12_new [L326] p12_new = nomsg [L327] p13_old = p13_new [L328] p13_new = nomsg [L329] p21_old = p21_new [L330] p21_new = nomsg [L331] p23_old = p23_new [L332] p23_new = nomsg [L333] p31_old = p31_new [L334] p31_new = nomsg [L335] p32_old = p32_new [L336] p32_new = nomsg [L338] int check__tmp; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L339] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L343] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L345] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L347] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L353] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] COND TRUE ((int)r1) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L363] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND TRUE ((int)r1) < 2 [L367] check__tmp = 1 [L368] __return_1270 = check__tmp [L369] main__c1 = __return_1270 [L371] _Bool __tmp_1; [L372] __tmp_1 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND FALSE !(assert__arg == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L382] COND TRUE !(mode1 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND FALSE !(r1 == 255) [L390] r1 = r1 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND FALSE !(!(ep21 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=0, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L399] COND TRUE !(ep31 == 0) [L401] m1 = p31_old [L402] p31_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L403] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND TRUE ((int)r1) == 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L409] COND TRUE ((int)max1) == ((int)id1) [L411] st1 = 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L413] mode1 = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L415] COND TRUE !(mode2 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L417] COND FALSE !(r2 == 255) [L423] r2 = r2 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=0, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L424] COND TRUE !(ep12 == 0) [L426] m2 = p12_old [L427] p12_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L428] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L432] COND FALSE !(!(ep32 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L440] COND FALSE !(((int)r2) == 2) [L446] mode2 = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L448] COND TRUE !(mode3 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L450] COND FALSE !(r3 == 255) [L456] r3 = r3 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L457] COND FALSE !(!(ep13 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=0, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L465] COND TRUE !(ep23 == 0) [L467] m3 = p23_old [L468] p23_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=3, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L469] COND TRUE ((int)m3) > ((int)max3) [L471] max3 = m3 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L473] COND FALSE !(((int)r3) == 2) [L479] mode3 = 0 [L480] p12_old = p12_new [L481] p12_new = nomsg [L482] p13_old = p13_new [L483] p13_new = nomsg [L484] p21_old = p21_new [L485] p21_new = nomsg [L486] p23_old = p23_new [L487] p23_new = nomsg [L488] p31_old = p31_new [L489] p31_new = nomsg [L490] p32_old = p32_new [L491] p32_new = nomsg [L493] int check__tmp; VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L494] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L496] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L498] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L500] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L502] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L508] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1090] check__tmp = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L526] __return_1389 = check__tmp [L527] main__c1 = __return_1389 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L530] _Bool __tmp_2; [L531] __tmp_2 = main__c1 [L532] _Bool assert__arg; [L533] assert__arg = __tmp_2 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L534] COND TRUE assert__arg == 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L536] __VERIFIER_error() VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=126, id3=3, m1=3, m2=4, m3=126, max1=4, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 224 locations, 1 error locations. UNSAFE Result, 45.8s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 26.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10115 SDtfs, 10340 SDslu, 15438 SDs, 0 SdLazy, 3554 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16484occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 32932 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2525 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2389 ConstructedInterpolants, 0 QuantifiedInterpolants, 940615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...