./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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 ../sv-benchmarks/c/systemc/token_ring.02.cil-2.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a08b839794d511e255b2cbb9b4715d014c32f56d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-9a8b2e8 [2020-10-20 01:50:36,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:50:36,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:50:36,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:50:36,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:50:36,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:50:36,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:50:36,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:50:36,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:50:36,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:50:36,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:50:36,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:50:36,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:50:36,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:50:36,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:50:36,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:50:36,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:50:36,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:50:36,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:50:36,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:50:36,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:50:36,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:50:36,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:50:36,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:50:36,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:50:36,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:50:36,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:50:36,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:50:36,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:50:36,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:50:36,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:50:36,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:50:36,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:50:36,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:50:36,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:50:36,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:50:36,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:50:36,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:50:36,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:50:36,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:50:36,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:50:36,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:50:36,342 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:50:36,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:50:36,344 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:50:36,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:50:36,344 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:50:36,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:50:36,345 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:50:36,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:50:36,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:50:36,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:50:36,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:50:36,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:50:36,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:50:36,346 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:50:36,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:50:36,346 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:50:36,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:50:36,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:50:36,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:50:36,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:50:36,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:50:36,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:50:36,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:50:36,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:50:36,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:50:36,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:50:36,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:50:36,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:50:36,349 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:50:36,349 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(reach_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 -> a08b839794d511e255b2cbb9b4715d014c32f56d [2020-10-20 01:50:36,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:50:36,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:50:36,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:50:36,603 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:50:36,605 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:50:36,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-10-20 01:50:36,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28f029a6/6290ecbbfffc40a8a15d4d7df7995d07/FLAG6a2cc81fb [2020-10-20 01:50:37,266 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:50:37,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-10-20 01:50:37,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28f029a6/6290ecbbfffc40a8a15d4d7df7995d07/FLAG6a2cc81fb [2020-10-20 01:50:37,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28f029a6/6290ecbbfffc40a8a15d4d7df7995d07 [2020-10-20 01:50:37,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:50:37,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:50:37,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:50:37,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:50:37,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:50:37,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:37,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b50cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37, skipping insertion in model container [2020-10-20 01:50:37,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:37,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:50:37,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:50:37,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:50:37,876 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:50:37,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:50:37,940 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:50:37,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37 WrapperNode [2020-10-20 01:50:37,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:50:37,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:50:37,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:50:37,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:50:37,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:37,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:38,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:50:38,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:50:38,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:50:38,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:50:38,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:38,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:38,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:38,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:38,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:38,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:38,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (1/1) ... [2020-10-20 01:50:38,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:50:38,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:50:38,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:50:38,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:50:38,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (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 [2020-10-20 01:50:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:50:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:50:38,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:50:38,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:50:39,022 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:50:39,023 INFO L298 CfgBuilder]: Removed 109 assume(true) statements. [2020-10-20 01:50:39,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:39 BoogieIcfgContainer [2020-10-20 01:50:39,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:50:39,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:50:39,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:50:39,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:50:39,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:50:37" (1/3) ... [2020-10-20 01:50:39,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cca6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:50:39, skipping insertion in model container [2020-10-20 01:50:39,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:37" (2/3) ... [2020-10-20 01:50:39,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cca6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:50:39, skipping insertion in model container [2020-10-20 01:50:39,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:39" (3/3) ... [2020-10-20 01:50:39,035 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-10-20 01:50:39,047 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:50:39,055 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 01:50:39,069 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-20 01:50:39,096 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:50:39,096 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:50:39,096 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:50:39,097 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:50:39,097 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:50:39,097 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:50:39,098 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:50:39,098 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:50:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2020-10-20 01:50:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:50:39,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:39,130 INFO L422 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] [2020-10-20 01:50:39,130 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2020-10-20 01:50:39,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:39,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343685579] [2020-10-20 01:50:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:39,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343685579] [2020-10-20 01:50:39,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:39,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:39,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238184856] [2020-10-20 01:50:39,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:39,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:39,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:39,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:39,373 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2020-10-20 01:50:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:39,438 INFO L93 Difference]: Finished difference Result 447 states and 699 transitions. [2020-10-20 01:50:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:39,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-20 01:50:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:39,455 INFO L225 Difference]: With dead ends: 447 [2020-10-20 01:50:39,456 INFO L226 Difference]: Without dead ends: 221 [2020-10-20 01:50:39,460 INFO L677 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 [2020-10-20 01:50:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-20 01:50:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2020-10-20 01:50:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-20 01:50:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2020-10-20 01:50:39,533 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2020-10-20 01:50:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:39,534 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2020-10-20 01:50:39,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2020-10-20 01:50:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:50:39,537 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:39,537 INFO L422 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] [2020-10-20 01:50:39,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:50:39,538 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:39,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2020-10-20 01:50:39,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:39,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350677642] [2020-10-20 01:50:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:39,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350677642] [2020-10-20 01:50:39,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:39,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:50:39,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914358999] [2020-10-20 01:50:39,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:39,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:39,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:39,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:39,658 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand 3 states. [2020-10-20 01:50:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:39,720 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2020-10-20 01:50:39,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:39,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-20 01:50:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:39,724 INFO L225 Difference]: With dead ends: 595 [2020-10-20 01:50:39,725 INFO L226 Difference]: Without dead ends: 381 [2020-10-20 01:50:39,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2020-10-20 01:50:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2020-10-20 01:50:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-20 01:50:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2020-10-20 01:50:39,766 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2020-10-20 01:50:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:39,766 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2020-10-20 01:50:39,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2020-10-20 01:50:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:50:39,768 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:39,768 INFO L422 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] [2020-10-20 01:50:39,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:50:39,769 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2020-10-20 01:50:39,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:39,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007264425] [2020-10-20 01:50:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:39,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007264425] [2020-10-20 01:50:39,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:39,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:39,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520155783] [2020-10-20 01:50:39,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:39,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:39,838 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand 4 states. [2020-10-20 01:50:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:39,937 INFO L93 Difference]: Finished difference Result 905 states and 1366 transitions. [2020-10-20 01:50:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:39,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-10-20 01:50:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:39,941 INFO L225 Difference]: With dead ends: 905 [2020-10-20 01:50:39,942 INFO L226 Difference]: Without dead ends: 536 [2020-10-20 01:50:39,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-10-20 01:50:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 377. [2020-10-20 01:50:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-20 01:50:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 567 transitions. [2020-10-20 01:50:39,973 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 567 transitions. Word has length 50 [2020-10-20 01:50:39,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:39,974 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 567 transitions. [2020-10-20 01:50:39,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 567 transitions. [2020-10-20 01:50:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:50:39,976 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:39,976 INFO L422 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] [2020-10-20 01:50:39,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:50:39,976 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:39,977 INFO L82 PathProgramCache]: Analyzing trace with hash -794624073, now seen corresponding path program 1 times [2020-10-20 01:50:39,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:39,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850625505] [2020-10-20 01:50:39,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:40,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850625505] [2020-10-20 01:50:40,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:40,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:40,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602769637] [2020-10-20 01:50:40,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:40,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:40,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:40,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:40,042 INFO L87 Difference]: Start difference. First operand 377 states and 567 transitions. Second operand 4 states. [2020-10-20 01:50:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:40,123 INFO L93 Difference]: Finished difference Result 903 states and 1356 transitions. [2020-10-20 01:50:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:40,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-10-20 01:50:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:40,127 INFO L225 Difference]: With dead ends: 903 [2020-10-20 01:50:40,128 INFO L226 Difference]: Without dead ends: 535 [2020-10-20 01:50:40,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-10-20 01:50:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 377. [2020-10-20 01:50:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-20 01:50:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 564 transitions. [2020-10-20 01:50:40,153 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 564 transitions. Word has length 50 [2020-10-20 01:50:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:40,154 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 564 transitions. [2020-10-20 01:50:40,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 564 transitions. [2020-10-20 01:50:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:50:40,156 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:40,156 INFO L422 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] [2020-10-20 01:50:40,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:50:40,156 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:40,157 INFO L82 PathProgramCache]: Analyzing trace with hash -546477579, now seen corresponding path program 1 times [2020-10-20 01:50:40,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:40,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959085136] [2020-10-20 01:50:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:40,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959085136] [2020-10-20 01:50:40,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:40,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:50:40,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355873341] [2020-10-20 01:50:40,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:40,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:40,223 INFO L87 Difference]: Start difference. First operand 377 states and 564 transitions. Second operand 3 states. [2020-10-20 01:50:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:40,287 INFO L93 Difference]: Finished difference Result 744 states and 1115 transitions. [2020-10-20 01:50:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:40,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-20 01:50:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:40,292 INFO L225 Difference]: With dead ends: 744 [2020-10-20 01:50:40,292 INFO L226 Difference]: Without dead ends: 377 [2020-10-20 01:50:40,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-10-20 01:50:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-10-20 01:50:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-20 01:50:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 548 transitions. [2020-10-20 01:50:40,320 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 548 transitions. Word has length 50 [2020-10-20 01:50:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:40,323 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 548 transitions. [2020-10-20 01:50:40,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 548 transitions. [2020-10-20 01:50:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:50:40,329 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:40,329 INFO L422 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] [2020-10-20 01:50:40,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:50:40,330 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:40,330 INFO L82 PathProgramCache]: Analyzing trace with hash -585918790, now seen corresponding path program 1 times [2020-10-20 01:50:40,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:40,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392139645] [2020-10-20 01:50:40,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:40,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392139645] [2020-10-20 01:50:40,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:40,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:40,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999226157] [2020-10-20 01:50:40,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:40,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:40,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:40,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:40,413 INFO L87 Difference]: Start difference. First operand 377 states and 548 transitions. Second operand 4 states. [2020-10-20 01:50:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:40,522 INFO L93 Difference]: Finished difference Result 878 states and 1277 transitions. [2020-10-20 01:50:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:40,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-10-20 01:50:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:40,526 INFO L225 Difference]: With dead ends: 878 [2020-10-20 01:50:40,526 INFO L226 Difference]: Without dead ends: 512 [2020-10-20 01:50:40,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-10-20 01:50:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 377. [2020-10-20 01:50:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-20 01:50:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 545 transitions. [2020-10-20 01:50:40,551 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 545 transitions. Word has length 50 [2020-10-20 01:50:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:40,551 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 545 transitions. [2020-10-20 01:50:40,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2020-10-20 01:50:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:50:40,552 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:40,553 INFO L422 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] [2020-10-20 01:50:40,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:50:40,553 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:40,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1957726088, now seen corresponding path program 1 times [2020-10-20 01:50:40,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:40,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020984447] [2020-10-20 01:50:40,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:40,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020984447] [2020-10-20 01:50:40,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:40,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:50:40,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826148754] [2020-10-20 01:50:40,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:40,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:40,604 INFO L87 Difference]: Start difference. First operand 377 states and 545 transitions. Second operand 3 states. [2020-10-20 01:50:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:40,671 INFO L93 Difference]: Finished difference Result 742 states and 1075 transitions. [2020-10-20 01:50:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:40,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-20 01:50:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:40,674 INFO L225 Difference]: With dead ends: 742 [2020-10-20 01:50:40,675 INFO L226 Difference]: Without dead ends: 377 [2020-10-20 01:50:40,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-10-20 01:50:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-10-20 01:50:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-20 01:50:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 529 transitions. [2020-10-20 01:50:40,700 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 529 transitions. Word has length 50 [2020-10-20 01:50:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:40,701 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 529 transitions. [2020-10-20 01:50:40,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 529 transitions. [2020-10-20 01:50:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:50:40,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:40,703 INFO L422 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] [2020-10-20 01:50:40,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:50:40,704 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:40,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:40,705 INFO L82 PathProgramCache]: Analyzing trace with hash -787989636, now seen corresponding path program 1 times [2020-10-20 01:50:40,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:40,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273413616] [2020-10-20 01:50:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:40,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273413616] [2020-10-20 01:50:40,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:40,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:50:40,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182044491] [2020-10-20 01:50:40,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:50:40,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:40,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:50:40,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:40,797 INFO L87 Difference]: Start difference. First operand 377 states and 529 transitions. Second operand 5 states. [2020-10-20 01:50:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:40,934 INFO L93 Difference]: Finished difference Result 981 states and 1389 transitions. [2020-10-20 01:50:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:40,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2020-10-20 01:50:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:40,938 INFO L225 Difference]: With dead ends: 981 [2020-10-20 01:50:40,939 INFO L226 Difference]: Without dead ends: 623 [2020-10-20 01:50:40,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:50:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-10-20 01:50:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 383. [2020-10-20 01:50:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-20 01:50:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 527 transitions. [2020-10-20 01:50:40,969 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 527 transitions. Word has length 50 [2020-10-20 01:50:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:40,970 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 527 transitions. [2020-10-20 01:50:40,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:50:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 527 transitions. [2020-10-20 01:50:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:50:40,970 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:40,971 INFO L422 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] [2020-10-20 01:50:40,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:50:40,971 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:40,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash -860376194, now seen corresponding path program 1 times [2020-10-20 01:50:40,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:40,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460148030] [2020-10-20 01:50:40,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:41,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460148030] [2020-10-20 01:50:41,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:41,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:41,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141959468] [2020-10-20 01:50:41,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:41,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:41,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:41,019 INFO L87 Difference]: Start difference. First operand 383 states and 527 transitions. Second operand 4 states. [2020-10-20 01:50:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:41,217 INFO L93 Difference]: Finished difference Result 1331 states and 1833 transitions. [2020-10-20 01:50:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:41,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-10-20 01:50:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:41,223 INFO L225 Difference]: With dead ends: 1331 [2020-10-20 01:50:41,223 INFO L226 Difference]: Without dead ends: 962 [2020-10-20 01:50:41,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2020-10-20 01:50:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 886. [2020-10-20 01:50:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2020-10-20 01:50:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1204 transitions. [2020-10-20 01:50:41,283 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1204 transitions. Word has length 50 [2020-10-20 01:50:41,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:41,284 INFO L481 AbstractCegarLoop]: Abstraction has 886 states and 1204 transitions. [2020-10-20 01:50:41,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:41,284 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1204 transitions. [2020-10-20 01:50:41,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-20 01:50:41,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:41,285 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:41,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:50:41,286 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:41,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:41,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1987821321, now seen corresponding path program 1 times [2020-10-20 01:50:41,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:41,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355468355] [2020-10-20 01:50:41,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-20 01:50:41,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355468355] [2020-10-20 01:50:41,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:41,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:50:41,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165743630] [2020-10-20 01:50:41,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:50:41,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:41,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:50:41,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:41,323 INFO L87 Difference]: Start difference. First operand 886 states and 1204 transitions. Second operand 5 states. [2020-10-20 01:50:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:41,599 INFO L93 Difference]: Finished difference Result 2286 states and 3127 transitions. [2020-10-20 01:50:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:41,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-10-20 01:50:41,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:41,609 INFO L225 Difference]: With dead ends: 2286 [2020-10-20 01:50:41,609 INFO L226 Difference]: Without dead ends: 1424 [2020-10-20 01:50:41,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:50:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-10-20 01:50:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 913. [2020-10-20 01:50:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-10-20 01:50:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1218 transitions. [2020-10-20 01:50:41,705 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1218 transitions. Word has length 63 [2020-10-20 01:50:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:41,706 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1218 transitions. [2020-10-20 01:50:41,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:50:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1218 transitions. [2020-10-20 01:50:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-20 01:50:41,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:41,707 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:41,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:50:41,708 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash 616014023, now seen corresponding path program 1 times [2020-10-20 01:50:41,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:41,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147386677] [2020-10-20 01:50:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-20 01:50:41,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147386677] [2020-10-20 01:50:41,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:41,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:41,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165960534] [2020-10-20 01:50:41,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:41,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:41,762 INFO L87 Difference]: Start difference. First operand 913 states and 1218 transitions. Second operand 4 states. [2020-10-20 01:50:41,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:41,921 INFO L93 Difference]: Finished difference Result 2185 states and 2919 transitions. [2020-10-20 01:50:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:41,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-10-20 01:50:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:41,928 INFO L225 Difference]: With dead ends: 2185 [2020-10-20 01:50:41,928 INFO L226 Difference]: Without dead ends: 1305 [2020-10-20 01:50:41,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2020-10-20 01:50:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 913. [2020-10-20 01:50:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-10-20 01:50:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1205 transitions. [2020-10-20 01:50:42,009 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1205 transitions. Word has length 63 [2020-10-20 01:50:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:42,009 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1205 transitions. [2020-10-20 01:50:42,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1205 transitions. [2020-10-20 01:50:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-20 01:50:42,010 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:42,010 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:42,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:50:42,010 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:42,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash 890773637, now seen corresponding path program 1 times [2020-10-20 01:50:42,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:42,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470975386] [2020-10-20 01:50:42,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-20 01:50:42,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470975386] [2020-10-20 01:50:42,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:42,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:42,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470457656] [2020-10-20 01:50:42,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:42,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:42,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:42,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:42,047 INFO L87 Difference]: Start difference. First operand 913 states and 1205 transitions. Second operand 4 states. [2020-10-20 01:50:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:42,195 INFO L93 Difference]: Finished difference Result 2184 states and 2889 transitions. [2020-10-20 01:50:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:42,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-10-20 01:50:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:42,204 INFO L225 Difference]: With dead ends: 2184 [2020-10-20 01:50:42,204 INFO L226 Difference]: Without dead ends: 1305 [2020-10-20 01:50:42,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2020-10-20 01:50:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 913. [2020-10-20 01:50:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-10-20 01:50:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1192 transitions. [2020-10-20 01:50:42,279 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1192 transitions. Word has length 63 [2020-10-20 01:50:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:42,279 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1192 transitions. [2020-10-20 01:50:42,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1192 transitions. [2020-10-20 01:50:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-20 01:50:42,280 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:42,281 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:42,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:50:42,281 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1592373511, now seen corresponding path program 1 times [2020-10-20 01:50:42,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:42,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629201141] [2020-10-20 01:50:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:42,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629201141] [2020-10-20 01:50:42,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:42,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:42,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095750604] [2020-10-20 01:50:42,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:42,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:42,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:42,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:42,327 INFO L87 Difference]: Start difference. First operand 913 states and 1192 transitions. Second operand 3 states. [2020-10-20 01:50:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:42,493 INFO L93 Difference]: Finished difference Result 2514 states and 3253 transitions. [2020-10-20 01:50:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:42,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-10-20 01:50:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:42,503 INFO L225 Difference]: With dead ends: 2514 [2020-10-20 01:50:42,503 INFO L226 Difference]: Without dead ends: 1638 [2020-10-20 01:50:42,507 INFO L677 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 [2020-10-20 01:50:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2020-10-20 01:50:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2020-10-20 01:50:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2020-10-20 01:50:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2079 transitions. [2020-10-20 01:50:42,634 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2079 transitions. Word has length 63 [2020-10-20 01:50:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:42,634 INFO L481 AbstractCegarLoop]: Abstraction has 1638 states and 2079 transitions. [2020-10-20 01:50:42,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2079 transitions. [2020-10-20 01:50:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-20 01:50:42,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:42,636 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:42,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:50:42,636 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:42,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1604417796, now seen corresponding path program 1 times [2020-10-20 01:50:42,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:42,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295748257] [2020-10-20 01:50:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:42,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295748257] [2020-10-20 01:50:42,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:42,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:42,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269682193] [2020-10-20 01:50:42,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:42,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:42,684 INFO L87 Difference]: Start difference. First operand 1638 states and 2079 transitions. Second operand 3 states. [2020-10-20 01:50:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:43,067 INFO L93 Difference]: Finished difference Result 4524 states and 5739 transitions. [2020-10-20 01:50:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:43,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-10-20 01:50:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:43,082 INFO L225 Difference]: With dead ends: 4524 [2020-10-20 01:50:43,083 INFO L226 Difference]: Without dead ends: 2956 [2020-10-20 01:50:43,088 INFO L677 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 [2020-10-20 01:50:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-10-20 01:50:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2916. [2020-10-20 01:50:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2916 states. [2020-10-20 01:50:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3671 transitions. [2020-10-20 01:50:43,605 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3671 transitions. Word has length 64 [2020-10-20 01:50:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:43,606 INFO L481 AbstractCegarLoop]: Abstraction has 2916 states and 3671 transitions. [2020-10-20 01:50:43,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3671 transitions. [2020-10-20 01:50:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-20 01:50:43,608 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:43,609 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:43,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:50:43,609 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1043718018, now seen corresponding path program 1 times [2020-10-20 01:50:43,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:43,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780445954] [2020-10-20 01:50:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:50:43,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780445954] [2020-10-20 01:50:43,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:43,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:43,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935543486] [2020-10-20 01:50:43,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:43,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:43,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:43,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:43,641 INFO L87 Difference]: Start difference. First operand 2916 states and 3671 transitions. Second operand 3 states. [2020-10-20 01:50:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:43,847 INFO L93 Difference]: Finished difference Result 5712 states and 7209 transitions. [2020-10-20 01:50:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:43,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-10-20 01:50:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:43,860 INFO L225 Difference]: With dead ends: 5712 [2020-10-20 01:50:43,861 INFO L226 Difference]: Without dead ends: 2854 [2020-10-20 01:50:43,867 INFO L677 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 [2020-10-20 01:50:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2020-10-20 01:50:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2854. [2020-10-20 01:50:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2854 states. [2020-10-20 01:50:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3601 transitions. [2020-10-20 01:50:44,083 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3601 transitions. Word has length 64 [2020-10-20 01:50:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:44,084 INFO L481 AbstractCegarLoop]: Abstraction has 2854 states and 3601 transitions. [2020-10-20 01:50:44,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3601 transitions. [2020-10-20 01:50:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-20 01:50:44,085 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:44,086 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:44,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:50:44,087 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash -691732721, now seen corresponding path program 1 times [2020-10-20 01:50:44,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:44,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005011493] [2020-10-20 01:50:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:50:44,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005011493] [2020-10-20 01:50:44,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:44,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:50:44,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152741780] [2020-10-20 01:50:44,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:44,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:44,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:44,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:44,300 INFO L87 Difference]: Start difference. First operand 2854 states and 3601 transitions. Second operand 3 states. [2020-10-20 01:50:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:44,642 INFO L93 Difference]: Finished difference Result 6838 states and 8679 transitions. [2020-10-20 01:50:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:44,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-10-20 01:50:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:44,663 INFO L225 Difference]: With dead ends: 6838 [2020-10-20 01:50:44,664 INFO L226 Difference]: Without dead ends: 4770 [2020-10-20 01:50:44,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2020-10-20 01:50:44,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3882. [2020-10-20 01:50:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3882 states. [2020-10-20 01:50:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 4899 transitions. [2020-10-20 01:50:44,973 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 4899 transitions. Word has length 65 [2020-10-20 01:50:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:44,974 INFO L481 AbstractCegarLoop]: Abstraction has 3882 states and 4899 transitions. [2020-10-20 01:50:44,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 4899 transitions. [2020-10-20 01:50:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-20 01:50:44,976 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:44,977 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:44,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:50:44,977 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:44,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:44,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1437461722, now seen corresponding path program 1 times [2020-10-20 01:50:44,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:44,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932102504] [2020-10-20 01:50:44,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:45,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932102504] [2020-10-20 01:50:45,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:45,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:50:45,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054225196] [2020-10-20 01:50:45,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:50:45,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:45,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:50:45,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:45,024 INFO L87 Difference]: Start difference. First operand 3882 states and 4899 transitions. Second operand 5 states. [2020-10-20 01:50:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:45,494 INFO L93 Difference]: Finished difference Result 9686 states and 12267 transitions. [2020-10-20 01:50:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:45,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2020-10-20 01:50:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:45,520 INFO L225 Difference]: With dead ends: 9686 [2020-10-20 01:50:45,520 INFO L226 Difference]: Without dead ends: 5862 [2020-10-20 01:50:45,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:50:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2020-10-20 01:50:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 3930. [2020-10-20 01:50:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3930 states. [2020-10-20 01:50:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 4873 transitions. [2020-10-20 01:50:45,867 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 4873 transitions. Word has length 82 [2020-10-20 01:50:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:45,867 INFO L481 AbstractCegarLoop]: Abstraction has 3930 states and 4873 transitions. [2020-10-20 01:50:45,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:50:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 4873 transitions. [2020-10-20 01:50:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-20 01:50:45,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:45,870 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:45,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:50:45,870 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:45,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1269157672, now seen corresponding path program 1 times [2020-10-20 01:50:45,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:45,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316364786] [2020-10-20 01:50:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:45,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316364786] [2020-10-20 01:50:45,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:45,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:45,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842349746] [2020-10-20 01:50:45,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:45,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:45,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:45,910 INFO L87 Difference]: Start difference. First operand 3930 states and 4873 transitions. Second operand 3 states. [2020-10-20 01:50:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:46,300 INFO L93 Difference]: Finished difference Result 11242 states and 13901 transitions. [2020-10-20 01:50:46,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:46,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-10-20 01:50:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:46,314 INFO L225 Difference]: With dead ends: 11242 [2020-10-20 01:50:46,315 INFO L226 Difference]: Without dead ends: 7382 [2020-10-20 01:50:46,321 INFO L677 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 [2020-10-20 01:50:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2020-10-20 01:50:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7170. [2020-10-20 01:50:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7170 states. [2020-10-20 01:50:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 8765 transitions. [2020-10-20 01:50:46,946 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 8765 transitions. Word has length 82 [2020-10-20 01:50:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:46,947 INFO L481 AbstractCegarLoop]: Abstraction has 7170 states and 8765 transitions. [2020-10-20 01:50:46,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 8765 transitions. [2020-10-20 01:50:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-20 01:50:46,950 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:46,950 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:46,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:50:46,950 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:46,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1587172131, now seen corresponding path program 1 times [2020-10-20 01:50:46,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:46,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201258709] [2020-10-20 01:50:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:47,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201258709] [2020-10-20 01:50:47,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:47,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:47,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336014992] [2020-10-20 01:50:47,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:47,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:47,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:47,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:47,012 INFO L87 Difference]: Start difference. First operand 7170 states and 8765 transitions. Second operand 4 states. [2020-10-20 01:50:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:48,090 INFO L93 Difference]: Finished difference Result 12646 states and 15461 transitions. [2020-10-20 01:50:48,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:48,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-10-20 01:50:48,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:48,104 INFO L225 Difference]: With dead ends: 12646 [2020-10-20 01:50:48,105 INFO L226 Difference]: Without dead ends: 5513 [2020-10-20 01:50:48,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2020-10-20 01:50:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5509. [2020-10-20 01:50:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5509 states. [2020-10-20 01:50:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 6669 transitions. [2020-10-20 01:50:48,719 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 6669 transitions. Word has length 83 [2020-10-20 01:50:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:48,720 INFO L481 AbstractCegarLoop]: Abstraction has 5509 states and 6669 transitions. [2020-10-20 01:50:48,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 6669 transitions. [2020-10-20 01:50:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-20 01:50:48,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:48,728 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:48,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:50:48,729 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash -810228725, now seen corresponding path program 1 times [2020-10-20 01:50:48,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:48,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983774029] [2020-10-20 01:50:48,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:48,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983774029] [2020-10-20 01:50:48,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:48,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:50:48,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469703082] [2020-10-20 01:50:48,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:48,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:48,896 INFO L87 Difference]: Start difference. First operand 5509 states and 6669 transitions. Second operand 3 states. [2020-10-20 01:50:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:49,338 INFO L93 Difference]: Finished difference Result 12613 states and 15226 transitions. [2020-10-20 01:50:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:49,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-10-20 01:50:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:49,352 INFO L225 Difference]: With dead ends: 12613 [2020-10-20 01:50:49,353 INFO L226 Difference]: Without dead ends: 7130 [2020-10-20 01:50:49,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2020-10-20 01:50:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 7082. [2020-10-20 01:50:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-10-20 01:50:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8483 transitions. [2020-10-20 01:50:50,099 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8483 transitions. Word has length 106 [2020-10-20 01:50:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:50,099 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8483 transitions. [2020-10-20 01:50:50,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8483 transitions. [2020-10-20 01:50:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-20 01:50:50,113 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:50,113 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:50,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:50:50,113 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash 614427576, now seen corresponding path program 1 times [2020-10-20 01:50:50,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:50,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067578492] [2020-10-20 01:50:50,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:50,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067578492] [2020-10-20 01:50:50,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:50,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:50,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335619114] [2020-10-20 01:50:50,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:50,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:50,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:50,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:50,168 INFO L87 Difference]: Start difference. First operand 7082 states and 8483 transitions. Second operand 4 states. [2020-10-20 01:50:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:50,714 INFO L93 Difference]: Finished difference Result 12566 states and 15119 transitions. [2020-10-20 01:50:50,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:50,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2020-10-20 01:50:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:50,730 INFO L225 Difference]: With dead ends: 12566 [2020-10-20 01:50:50,731 INFO L226 Difference]: Without dead ends: 7094 [2020-10-20 01:50:50,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2020-10-20 01:50:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 7082. [2020-10-20 01:50:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-10-20 01:50:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8447 transitions. [2020-10-20 01:50:51,140 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8447 transitions. Word has length 121 [2020-10-20 01:50:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:51,141 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8447 transitions. [2020-10-20 01:50:51,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8447 transitions. [2020-10-20 01:50:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-10-20 01:50:51,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:51,148 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:51,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:50:51,149 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1456346617, now seen corresponding path program 1 times [2020-10-20 01:50:51,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:51,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606639876] [2020-10-20 01:50:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 01:50:51,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606639876] [2020-10-20 01:50:51,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:51,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:51,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606656084] [2020-10-20 01:50:51,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:51,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:51,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:51,251 INFO L87 Difference]: Start difference. First operand 7082 states and 8447 transitions. Second operand 4 states. [2020-10-20 01:50:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:51,965 INFO L93 Difference]: Finished difference Result 14332 states and 17091 transitions. [2020-10-20 01:50:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:51,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2020-10-20 01:50:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:51,982 INFO L225 Difference]: With dead ends: 14332 [2020-10-20 01:50:51,983 INFO L226 Difference]: Without dead ends: 6492 [2020-10-20 01:50:51,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2020-10-20 01:50:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 6280. [2020-10-20 01:50:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-10-20 01:50:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7448 transitions. [2020-10-20 01:50:52,491 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7448 transitions. Word has length 147 [2020-10-20 01:50:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:52,492 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7448 transitions. [2020-10-20 01:50:52,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7448 transitions. [2020-10-20 01:50:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-10-20 01:50:52,497 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:52,497 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:52,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 01:50:52,498 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:52,498 INFO L82 PathProgramCache]: Analyzing trace with hash -495516941, now seen corresponding path program 1 times [2020-10-20 01:50:52,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:52,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373571569] [2020-10-20 01:50:52,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:52,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373571569] [2020-10-20 01:50:52,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:52,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:52,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791663959] [2020-10-20 01:50:52,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:52,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:52,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:52,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:52,556 INFO L87 Difference]: Start difference. First operand 6280 states and 7448 transitions. Second operand 3 states. [2020-10-20 01:50:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:52,932 INFO L93 Difference]: Finished difference Result 11323 states and 13479 transitions. [2020-10-20 01:50:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:52,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-10-20 01:50:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:52,941 INFO L225 Difference]: With dead ends: 11323 [2020-10-20 01:50:52,941 INFO L226 Difference]: Without dead ends: 6304 [2020-10-20 01:50:52,948 INFO L677 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 [2020-10-20 01:50:52,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2020-10-20 01:50:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 6280. [2020-10-20 01:50:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-10-20 01:50:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7296 transitions. [2020-10-20 01:50:53,805 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7296 transitions. Word has length 147 [2020-10-20 01:50:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:53,806 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7296 transitions. [2020-10-20 01:50:53,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7296 transitions. [2020-10-20 01:50:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-20 01:50:53,811 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:53,811 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:53,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 01:50:53,812 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:53,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1875095521, now seen corresponding path program 1 times [2020-10-20 01:50:53,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:53,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005934548] [2020-10-20 01:50:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:50:53,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005934548] [2020-10-20 01:50:53,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:53,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:53,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160143884] [2020-10-20 01:50:53,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:53,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:53,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:53,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:53,858 INFO L87 Difference]: Start difference. First operand 6280 states and 7296 transitions. Second operand 3 states. [2020-10-20 01:50:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:54,201 INFO L93 Difference]: Finished difference Result 10747 states and 12514 transitions. [2020-10-20 01:50:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:54,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2020-10-20 01:50:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:54,211 INFO L225 Difference]: With dead ends: 10747 [2020-10-20 01:50:54,211 INFO L226 Difference]: Without dead ends: 6564 [2020-10-20 01:50:54,216 INFO L677 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 [2020-10-20 01:50:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2020-10-20 01:50:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 6280. [2020-10-20 01:50:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-10-20 01:50:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7176 transitions. [2020-10-20 01:50:54,647 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7176 transitions. Word has length 149 [2020-10-20 01:50:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:54,647 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7176 transitions. [2020-10-20 01:50:54,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7176 transitions. [2020-10-20 01:50:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-10-20 01:50:54,652 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:54,652 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:54,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 01:50:54,653 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:54,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:54,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1711412734, now seen corresponding path program 1 times [2020-10-20 01:50:54,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:54,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676369531] [2020-10-20 01:50:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:54,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676369531] [2020-10-20 01:50:54,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:54,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:54,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562603323] [2020-10-20 01:50:54,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:54,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:54,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:54,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:54,703 INFO L87 Difference]: Start difference. First operand 6280 states and 7176 transitions. Second operand 3 states. [2020-10-20 01:50:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:55,002 INFO L93 Difference]: Finished difference Result 10912 states and 12510 transitions. [2020-10-20 01:50:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:55,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2020-10-20 01:50:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:55,009 INFO L225 Difference]: With dead ends: 10912 [2020-10-20 01:50:55,009 INFO L226 Difference]: Without dead ends: 4668 [2020-10-20 01:50:55,022 INFO L677 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 [2020-10-20 01:50:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2020-10-20 01:50:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4652. [2020-10-20 01:50:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4652 states. [2020-10-20 01:50:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4652 states to 4652 states and 5255 transitions. [2020-10-20 01:50:55,287 INFO L78 Accepts]: Start accepts. Automaton has 4652 states and 5255 transitions. Word has length 150 [2020-10-20 01:50:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:55,288 INFO L481 AbstractCegarLoop]: Abstraction has 4652 states and 5255 transitions. [2020-10-20 01:50:55,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 4652 states and 5255 transitions. [2020-10-20 01:50:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-10-20 01:50:55,291 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:55,292 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:55,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 01:50:55,292 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash 473818913, now seen corresponding path program 1 times [2020-10-20 01:50:55,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:55,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874697214] [2020-10-20 01:50:55,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:50:55,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874697214] [2020-10-20 01:50:55,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:55,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:55,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449146636] [2020-10-20 01:50:55,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:55,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:55,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:55,560 INFO L87 Difference]: Start difference. First operand 4652 states and 5255 transitions. Second operand 4 states. [2020-10-20 01:50:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:55,766 INFO L93 Difference]: Finished difference Result 7044 states and 7901 transitions. [2020-10-20 01:50:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:55,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2020-10-20 01:50:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:55,768 INFO L225 Difference]: With dead ends: 7044 [2020-10-20 01:50:55,768 INFO L226 Difference]: Without dead ends: 1511 [2020-10-20 01:50:55,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2020-10-20 01:50:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1507. [2020-10-20 01:50:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-10-20 01:50:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1613 transitions. [2020-10-20 01:50:55,843 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1613 transitions. Word has length 150 [2020-10-20 01:50:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:55,844 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1613 transitions. [2020-10-20 01:50:55,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1613 transitions. [2020-10-20 01:50:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-10-20 01:50:55,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:55,847 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:55,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-20 01:50:55,847 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:55,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:55,848 INFO L82 PathProgramCache]: Analyzing trace with hash 776824727, now seen corresponding path program 1 times [2020-10-20 01:50:55,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:55,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852196531] [2020-10-20 01:50:55,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:50:55,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852196531] [2020-10-20 01:50:55,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:55,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:50:55,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382066654] [2020-10-20 01:50:55,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:50:55,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:55,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:50:55,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:55,987 INFO L87 Difference]: Start difference. First operand 1507 states and 1613 transitions. Second operand 5 states. [2020-10-20 01:50:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:56,125 INFO L93 Difference]: Finished difference Result 1507 states and 1613 transitions. [2020-10-20 01:50:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:56,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2020-10-20 01:50:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:56,128 INFO L225 Difference]: With dead ends: 1507 [2020-10-20 01:50:56,128 INFO L226 Difference]: Without dead ends: 1505 [2020-10-20 01:50:56,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2020-10-20 01:50:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2020-10-20 01:50:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2020-10-20 01:50:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1610 transitions. [2020-10-20 01:50:56,261 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1610 transitions. Word has length 152 [2020-10-20 01:50:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:56,262 INFO L481 AbstractCegarLoop]: Abstraction has 1505 states and 1610 transitions. [2020-10-20 01:50:56,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:50:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1610 transitions. [2020-10-20 01:50:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-10-20 01:50:56,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:56,265 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:56,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-20 01:50:56,266 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash 46651813, now seen corresponding path program 1 times [2020-10-20 01:50:56,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:56,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699698216] [2020-10-20 01:50:56,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-20 01:50:56,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699698216] [2020-10-20 01:50:56,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:56,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:56,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407835725] [2020-10-20 01:50:56,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:56,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:56,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:56,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:56,315 INFO L87 Difference]: Start difference. First operand 1505 states and 1610 transitions. Second operand 3 states. [2020-10-20 01:50:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:56,496 INFO L93 Difference]: Finished difference Result 2761 states and 2943 transitions. [2020-10-20 01:50:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:56,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-10-20 01:50:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:56,500 INFO L225 Difference]: With dead ends: 2761 [2020-10-20 01:50:56,500 INFO L226 Difference]: Without dead ends: 2125 [2020-10-20 01:50:56,502 INFO L677 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 [2020-10-20 01:50:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2020-10-20 01:50:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1507. [2020-10-20 01:50:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-10-20 01:50:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1612 transitions. [2020-10-20 01:50:56,635 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1612 transitions. Word has length 156 [2020-10-20 01:50:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:56,636 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1612 transitions. [2020-10-20 01:50:56,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1612 transitions. [2020-10-20 01:50:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-10-20 01:50:56,638 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:56,639 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:56,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-20 01:50:56,639 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1208769336, now seen corresponding path program 1 times [2020-10-20 01:50:56,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:56,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254081221] [2020-10-20 01:50:56,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:50:56,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:50:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:50:56,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:50:56,774 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:50:56,774 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:50:56,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-20 01:50:56,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:50:56 BoogieIcfgContainer [2020-10-20 01:50:56,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:50:56,957 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:50:56,957 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:50:56,957 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:50:56,958 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:39" (3/4) ... [2020-10-20 01:50:56,960 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:50:57,099 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:50:57,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:50:57,102 INFO L168 Benchmark]: Toolchain (without parser) took 19567.26 ms. Allocated memory was 43.5 MB in the beginning and 489.2 MB in the end (delta: 445.6 MB). Free memory was 24.4 MB in the beginning and 79.2 MB in the end (delta: -54.8 MB). Peak memory consumption was 390.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:57,102 INFO L168 Benchmark]: CDTParser took 1.17 ms. Allocated memory is still 32.5 MB. Free memory was 11.7 MB in the beginning and 11.7 MB in the end (delta: 48.5 kB). Peak memory consumption was 48.5 kB. Max. memory is 14.3 GB. [2020-10-20 01:50:57,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.24 ms. Allocated memory was 43.5 MB in the beginning and 44.0 MB in the end (delta: 524.3 kB). Free memory was 23.5 MB in the beginning and 21.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:57,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.81 ms. Allocated memory is still 44.0 MB. Free memory was 21.4 MB in the beginning and 18.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:57,104 INFO L168 Benchmark]: Boogie Preprocessor took 57.84 ms. Allocated memory is still 44.0 MB. Free memory was 18.0 MB in the beginning and 15.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:57,104 INFO L168 Benchmark]: RCFGBuilder took 960.36 ms. Allocated memory was 44.0 MB in the beginning and 49.8 MB in the end (delta: 5.8 MB). Free memory was 15.0 MB in the beginning and 19.4 MB in the end (delta: -4.5 MB). Peak memory consumption was 7.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:57,105 INFO L168 Benchmark]: TraceAbstraction took 17929.96 ms. Allocated memory was 49.8 MB in the beginning and 489.2 MB in the end (delta: 439.4 MB). Free memory was 18.7 MB in the beginning and 109.2 MB in the end (delta: -90.5 MB). Peak memory consumption was 348.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:57,105 INFO L168 Benchmark]: Witness Printer took 142.57 ms. Allocated memory is still 489.2 MB. Free memory was 109.2 MB in the beginning and 79.2 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:57,108 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17 ms. Allocated memory is still 32.5 MB. Free memory was 11.7 MB in the beginning and 11.7 MB in the end (delta: 48.5 kB). Peak memory consumption was 48.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 401.24 ms. Allocated memory was 43.5 MB in the beginning and 44.0 MB in the end (delta: 524.3 kB). Free memory was 23.5 MB in the beginning and 21.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 64.81 ms. Allocated memory is still 44.0 MB. Free memory was 21.4 MB in the beginning and 18.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 57.84 ms. Allocated memory is still 44.0 MB. Free memory was 18.0 MB in the beginning and 15.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 960.36 ms. Allocated memory was 44.0 MB in the beginning and 49.8 MB in the end (delta: 5.8 MB). Free memory was 15.0 MB in the beginning and 19.4 MB in the end (delta: -4.5 MB). Peak memory consumption was 7.9 MB. Max. memory is 14.3 GB. * TraceAbstraction took 17929.96 ms. Allocated memory was 49.8 MB in the beginning and 489.2 MB in the end (delta: 439.4 MB). Free memory was 18.7 MB in the beginning and 109.2 MB in the end (delta: -90.5 MB). Peak memory consumption was 348.8 MB. Max. memory is 14.3 GB. * Witness Printer took 142.57 ms. Allocated memory is still 489.2 MB. Free memory was 109.2 MB in the beginning and 79.2 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int M_E = 2; [L26] int T1_E = 2; [L27] int T2_E = 2; [L28] int E_M = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L35] int token ; [L37] int local ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L602] int __retres1 ; [L516] m_i = 1 [L517] t1_i = 1 [L518] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L543] int kernel_st ; [L544] int tmp ; [L545] int tmp___0 ; [L549] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L235] COND TRUE m_i == 1 [L236] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L240] COND TRUE t1_i == 1 [L241] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L245] COND TRUE t2_i == 1 [L246] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L348] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L353] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L358] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L363] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L368] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L373] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L182] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L189] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L208] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L386] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L391] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L396] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L401] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L406] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L411] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L557] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] kernel_st = 1 [L281] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L98] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L134] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L53] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L56] token = __VERIFIER_nondet_int() [L57] local = token [L58] E_1 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L182] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L186] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L189] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L190] COND TRUE E_1 == 1 [L191] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L201] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND TRUE \read(tmp___0) [L438] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L205] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L208] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L209] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L220] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L60] E_1 = 2 [L61] m_pc = 1 [L62] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L98] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L101] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L117] token += 1 [L118] E_2 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L171] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L182] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L186] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L201] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L205] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L209] COND TRUE E_2 == 1 [L210] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L220] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L443] tmp___1 = is_transmit2_triggered() [L445] COND TRUE \read(tmp___1) [L446] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L120] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L134] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L137] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] token += 1 [L154] E_M = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L171] COND TRUE E_M == 1 [L172] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L182] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L427] tmp = is_master_triggered() [L429] COND TRUE \read(tmp) [L430] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L209] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L156] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L45] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L67] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L80] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L3] __assert_fail("0", "token_ring.02.cil-2.c", 3, "reach_error") VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.6s, OverallIterations: 29, TraceHistogramMax: 3, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9959 SDtfs, 12538 SDslu, 9564 SDs, 0 SdLazy, 712 SolverSat, 264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7170occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 6361 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2577 NumberOfCodeBlocks, 2577 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2392 ConstructedInterpolants, 0 QuantifiedInterpolants, 476043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 361/361 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...