./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 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.5.800.v20200727-1323.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.01.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 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-5485861 [2020-10-25 23:14:09,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:14:09,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:14:09,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:14:09,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:14:09,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:14:09,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:14:09,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:14:09,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:14:09,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:14:09,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:14:09,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:14:09,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:14:09,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:14:09,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:14:09,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:14:09,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:14:09,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:14:09,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:14:09,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:14:09,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:14:09,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:14:09,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:14:09,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:14:09,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:14:09,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:14:09,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:14:09,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:14:09,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:14:09,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:14:09,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:14:09,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:14:09,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:14:09,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:14:09,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:14:09,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:14:09,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:14:09,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:14:09,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:14:09,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:14:09,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:14:09,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:14:09,269 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:14:09,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:14:09,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:14:09,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:14:09,273 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:14:09,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:14:09,274 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:14:09,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:14:09,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:14:09,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:14:09,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:14:09,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:14:09,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:14:09,276 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:14:09,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:14:09,277 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:14:09,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:14:09,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:14:09,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:14:09,278 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:14:09,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:14:09,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:14:09,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:14:09,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:14:09,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:14:09,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:14:09,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:14:09,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:14:09,280 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:14:09,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.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 -> 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 [2020-10-25 23:14:09,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:14:09,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:14:09,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:14:09,706 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:14:09,707 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:14:09,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-10-25 23:14:09,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0687fad/474c4f66aa8e4c7d860a99dbc940e368/FLAG2e7f6c3f9 [2020-10-25 23:14:10,471 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:14:10,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-10-25 23:14:10,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0687fad/474c4f66aa8e4c7d860a99dbc940e368/FLAG2e7f6c3f9 [2020-10-25 23:14:10,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0687fad/474c4f66aa8e4c7d860a99dbc940e368 [2020-10-25 23:14:10,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:14:10,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:14:10,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:14:10,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:14:10,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:14:10,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:14:10" (1/1) ... [2020-10-25 23:14:10,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a3d4887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:10, skipping insertion in model container [2020-10-25 23:14:10,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:14:10" (1/1) ... [2020-10-25 23:14:10,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:14:10,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:14:11,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:14:11,257 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:14:11,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:14:11,324 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:14:11,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11 WrapperNode [2020-10-25 23:14:11,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:14:11,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:14:11,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:14:11,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:14:11,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (1/1) ... [2020-10-25 23:14:11,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (1/1) ... [2020-10-25 23:14:11,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:14:11,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:14:11,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:14:11,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:14:11,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (1/1) ... [2020-10-25 23:14:11,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (1/1) ... [2020-10-25 23:14:11,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (1/1) ... [2020-10-25 23:14:11,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (1/1) ... [2020-10-25 23:14:11,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (1/1) ... [2020-10-25 23:14:11,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (1/1) ... [2020-10-25 23:14:11,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (1/1) ... [2020-10-25 23:14:11,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:14:11,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:14:11,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:14:11,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:14:11,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (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-25 23:14:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:14:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:14:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:14:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:14:12,513 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:14:12,513 INFO L298 CfgBuilder]: Removed 86 assume(true) statements. [2020-10-25 23:14:12,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:14:12 BoogieIcfgContainer [2020-10-25 23:14:12,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:14:12,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:14:12,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:14:12,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:14:12,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:14:10" (1/3) ... [2020-10-25 23:14:12,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325be0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:14:12, skipping insertion in model container [2020-10-25 23:14:12,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:11" (2/3) ... [2020-10-25 23:14:12,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325be0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:14:12, skipping insertion in model container [2020-10-25 23:14:12,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:14:12" (3/3) ... [2020-10-25 23:14:12,525 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-10-25 23:14:12,536 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:14:12,542 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-25 23:14:12,555 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-25 23:14:12,582 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:14:12,583 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:14:12,583 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:14:12,583 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:14:12,583 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:14:12,584 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:14:12,584 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:14:12,584 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:14:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2020-10-25 23:14:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-25 23:14:12,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:12,611 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] [2020-10-25 23:14:12,612 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:12,618 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2020-10-25 23:14:12,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:12,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596186063] [2020-10-25 23:14:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:12,822 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-25 23:14:12,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596186063] [2020-10-25 23:14:12,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:12,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:12,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064059062] [2020-10-25 23:14:12,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:12,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:12,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:12,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:12,853 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2020-10-25 23:14:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:12,953 INFO L93 Difference]: Finished difference Result 293 states and 457 transitions. [2020-10-25 23:14:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:12,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-10-25 23:14:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:12,968 INFO L225 Difference]: With dead ends: 293 [2020-10-25 23:14:12,969 INFO L226 Difference]: Without dead ends: 144 [2020-10-25 23:14:12,973 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-25 23:14:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-25 23:14:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-10-25 23:14:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-25 23:14:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2020-10-25 23:14:13,029 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2020-10-25 23:14:13,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:13,029 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2020-10-25 23:14:13,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:13,029 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2020-10-25 23:14:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-25 23:14:13,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:13,031 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] [2020-10-25 23:14:13,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:14:13,032 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:13,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2020-10-25 23:14:13,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:13,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264742749] [2020-10-25 23:14:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:13,092 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-25 23:14:13,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264742749] [2020-10-25 23:14:13,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:13,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:14:13,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789578565] [2020-10-25 23:14:13,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:13,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:13,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:13,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:13,096 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2020-10-25 23:14:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:13,181 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2020-10-25 23:14:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:13,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-10-25 23:14:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:13,185 INFO L225 Difference]: With dead ends: 384 [2020-10-25 23:14:13,185 INFO L226 Difference]: Without dead ends: 246 [2020-10-25 23:14:13,186 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-25 23:14:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-10-25 23:14:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2020-10-25 23:14:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-25 23:14:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2020-10-25 23:14:13,217 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2020-10-25 23:14:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:13,218 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2020-10-25 23:14:13,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2020-10-25 23:14:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-25 23:14:13,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:13,221 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] [2020-10-25 23:14:13,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:14:13,222 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:13,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2020-10-25 23:14:13,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:13,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401034625] [2020-10-25 23:14:13,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:13,326 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-25 23:14:13,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401034625] [2020-10-25 23:14:13,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:13,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:13,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968153013] [2020-10-25 23:14:13,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:13,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:13,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:13,331 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 4 states. [2020-10-25 23:14:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:13,482 INFO L93 Difference]: Finished difference Result 578 states and 863 transitions. [2020-10-25 23:14:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:13,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-10-25 23:14:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:13,489 INFO L225 Difference]: With dead ends: 578 [2020-10-25 23:14:13,490 INFO L226 Difference]: Without dead ends: 343 [2020-10-25 23:14:13,494 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-25 23:14:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-10-25 23:14:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 242. [2020-10-25 23:14:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-25 23:14:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2020-10-25 23:14:13,541 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 39 [2020-10-25 23:14:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:13,541 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2020-10-25 23:14:13,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2020-10-25 23:14:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-25 23:14:13,546 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:13,546 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] [2020-10-25 23:14:13,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 23:14:13,546 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:13,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1582653462, now seen corresponding path program 1 times [2020-10-25 23:14:13,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:13,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549085097] [2020-10-25 23:14:13,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:13,630 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-25 23:14:13,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549085097] [2020-10-25 23:14:13,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:13,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:14:13,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211084141] [2020-10-25 23:14:13,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:13,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:13,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:13,633 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand 3 states. [2020-10-25 23:14:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:13,711 INFO L93 Difference]: Finished difference Result 476 states and 708 transitions. [2020-10-25 23:14:13,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:13,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-10-25 23:14:13,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:13,714 INFO L225 Difference]: With dead ends: 476 [2020-10-25 23:14:13,714 INFO L226 Difference]: Without dead ends: 242 [2020-10-25 23:14:13,715 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-25 23:14:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-10-25 23:14:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-10-25 23:14:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-25 23:14:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 345 transitions. [2020-10-25 23:14:13,741 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 345 transitions. Word has length 39 [2020-10-25 23:14:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:13,742 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 345 transitions. [2020-10-25 23:14:13,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2020-10-25 23:14:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-25 23:14:13,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:13,743 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] [2020-10-25 23:14:13,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 23:14:13,744 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:13,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash 836344722, now seen corresponding path program 1 times [2020-10-25 23:14:13,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:13,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921784748] [2020-10-25 23:14:13,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:13,783 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-25 23:14:13,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921784748] [2020-10-25 23:14:13,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:13,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:13,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170376342] [2020-10-25 23:14:13,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:13,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:13,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:13,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:13,786 INFO L87 Difference]: Start difference. First operand 242 states and 345 transitions. Second operand 4 states. [2020-10-25 23:14:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:13,887 INFO L93 Difference]: Finished difference Result 560 states and 799 transitions. [2020-10-25 23:14:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:13,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-10-25 23:14:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:13,890 INFO L225 Difference]: With dead ends: 560 [2020-10-25 23:14:13,890 INFO L226 Difference]: Without dead ends: 327 [2020-10-25 23:14:13,891 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-25 23:14:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-10-25 23:14:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 242. [2020-10-25 23:14:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-25 23:14:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 342 transitions. [2020-10-25 23:14:13,911 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 342 transitions. Word has length 39 [2020-10-25 23:14:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:13,912 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 342 transitions. [2020-10-25 23:14:13,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 342 transitions. [2020-10-25 23:14:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-25 23:14:13,913 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:13,913 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] [2020-10-25 23:14:13,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 23:14:13,914 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:13,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:13,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1537944596, now seen corresponding path program 1 times [2020-10-25 23:14:13,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:13,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842699244] [2020-10-25 23:14:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:13,957 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-25 23:14:13,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842699244] [2020-10-25 23:14:13,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:13,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:13,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126861215] [2020-10-25 23:14:13,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:13,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:13,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:13,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:13,959 INFO L87 Difference]: Start difference. First operand 242 states and 342 transitions. Second operand 4 states. [2020-10-25 23:14:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:14,118 INFO L93 Difference]: Finished difference Result 820 states and 1159 transitions. [2020-10-25 23:14:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:14,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-10-25 23:14:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:14,122 INFO L225 Difference]: With dead ends: 820 [2020-10-25 23:14:14,123 INFO L226 Difference]: Without dead ends: 589 [2020-10-25 23:14:14,124 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-25 23:14:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-10-25 23:14:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2020-10-25 23:14:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-10-25 23:14:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 753 transitions. [2020-10-25 23:14:14,160 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 753 transitions. Word has length 39 [2020-10-25 23:14:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:14,161 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 753 transitions. [2020-10-25 23:14:14,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 753 transitions. [2020-10-25 23:14:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-25 23:14:14,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:14,162 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] [2020-10-25 23:14:14,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 23:14:14,163 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:14,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1965836524, now seen corresponding path program 1 times [2020-10-25 23:14:14,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:14,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043444305] [2020-10-25 23:14:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:14,223 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-25 23:14:14,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043444305] [2020-10-25 23:14:14,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:14,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:14:14,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718739723] [2020-10-25 23:14:14,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:14:14,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:14,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:14:14,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:14,226 INFO L87 Difference]: Start difference. First operand 541 states and 753 transitions. Second operand 5 states. [2020-10-25 23:14:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:14,418 INFO L93 Difference]: Finished difference Result 1379 states and 1933 transitions. [2020-10-25 23:14:14,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:14:14,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-10-25 23:14:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:14,423 INFO L225 Difference]: With dead ends: 1379 [2020-10-25 23:14:14,424 INFO L226 Difference]: Without dead ends: 859 [2020-10-25 23:14:14,426 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-25 23:14:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-10-25 23:14:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 562. [2020-10-25 23:14:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-25 23:14:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 765 transitions. [2020-10-25 23:14:14,489 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 765 transitions. Word has length 51 [2020-10-25 23:14:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:14,490 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 765 transitions. [2020-10-25 23:14:14,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:14:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 765 transitions. [2020-10-25 23:14:14,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-25 23:14:14,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:14,495 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] [2020-10-25 23:14:14,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 23:14:14,496 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1627530898, now seen corresponding path program 1 times [2020-10-25 23:14:14,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:14,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743363383] [2020-10-25 23:14:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:14,576 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-25 23:14:14,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743363383] [2020-10-25 23:14:14,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:14,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:14,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989594083] [2020-10-25 23:14:14,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:14,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:14,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:14,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:14,578 INFO L87 Difference]: Start difference. First operand 562 states and 765 transitions. Second operand 4 states. [2020-10-25 23:14:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:14,683 INFO L93 Difference]: Finished difference Result 1340 states and 1827 transitions. [2020-10-25 23:14:14,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:14,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-10-25 23:14:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:14,694 INFO L225 Difference]: With dead ends: 1340 [2020-10-25 23:14:14,694 INFO L226 Difference]: Without dead ends: 801 [2020-10-25 23:14:14,695 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-25 23:14:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-10-25 23:14:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 562. [2020-10-25 23:14:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-25 23:14:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2020-10-25 23:14:14,740 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 51 [2020-10-25 23:14:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:14,740 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2020-10-25 23:14:14,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2020-10-25 23:14:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-25 23:14:14,741 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:14,741 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] [2020-10-25 23:14:14,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 23:14:14,742 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash -241327504, now seen corresponding path program 1 times [2020-10-25 23:14:14,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:14,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225250081] [2020-10-25 23:14:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:14,780 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-25 23:14:14,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225250081] [2020-10-25 23:14:14,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:14,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:14,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959595699] [2020-10-25 23:14:14,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:14,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:14,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:14,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:14,782 INFO L87 Difference]: Start difference. First operand 562 states and 752 transitions. Second operand 3 states. [2020-10-25 23:14:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:14,927 INFO L93 Difference]: Finished difference Result 1555 states and 2057 transitions. [2020-10-25 23:14:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:14,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-10-25 23:14:14,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:14,933 INFO L225 Difference]: With dead ends: 1555 [2020-10-25 23:14:14,933 INFO L226 Difference]: Without dead ends: 1018 [2020-10-25 23:14:14,935 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-25 23:14:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-10-25 23:14:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 982. [2020-10-25 23:14:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2020-10-25 23:14:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1267 transitions. [2020-10-25 23:14:15,023 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1267 transitions. Word has length 51 [2020-10-25 23:14:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:15,023 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1267 transitions. [2020-10-25 23:14:15,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1267 transitions. [2020-10-25 23:14:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-25 23:14:15,025 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:15,025 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] [2020-10-25 23:14:15,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 23:14:15,026 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:15,026 INFO L82 PathProgramCache]: Analyzing trace with hash -794822095, now seen corresponding path program 1 times [2020-10-25 23:14:15,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:15,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710866768] [2020-10-25 23:14:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:15,072 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-25 23:14:15,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710866768] [2020-10-25 23:14:15,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:15,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:14:15,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417543610] [2020-10-25 23:14:15,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:15,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:15,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:15,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:15,075 INFO L87 Difference]: Start difference. First operand 982 states and 1267 transitions. Second operand 3 states. [2020-10-25 23:14:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:15,229 INFO L93 Difference]: Finished difference Result 2328 states and 3027 transitions. [2020-10-25 23:14:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:15,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-10-25 23:14:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:15,238 INFO L225 Difference]: With dead ends: 2328 [2020-10-25 23:14:15,238 INFO L226 Difference]: Without dead ends: 1624 [2020-10-25 23:14:15,240 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-25 23:14:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2020-10-25 23:14:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1334. [2020-10-25 23:14:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2020-10-25 23:14:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1719 transitions. [2020-10-25 23:14:15,356 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1719 transitions. Word has length 52 [2020-10-25 23:14:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:15,357 INFO L481 AbstractCegarLoop]: Abstraction has 1334 states and 1719 transitions. [2020-10-25 23:14:15,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1719 transitions. [2020-10-25 23:14:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-25 23:14:15,358 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:15,359 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] [2020-10-25 23:14:15,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 23:14:15,359 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:15,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1952123894, now seen corresponding path program 1 times [2020-10-25 23:14:15,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:15,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572498257] [2020-10-25 23:14:15,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:15,415 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-25 23:14:15,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572498257] [2020-10-25 23:14:15,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:15,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:14:15,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015940214] [2020-10-25 23:14:15,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:14:15,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:15,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:14:15,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:15,417 INFO L87 Difference]: Start difference. First operand 1334 states and 1719 transitions. Second operand 5 states. [2020-10-25 23:14:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:15,624 INFO L93 Difference]: Finished difference Result 2606 states and 3374 transitions. [2020-10-25 23:14:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:14:15,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-10-25 23:14:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:15,633 INFO L225 Difference]: With dead ends: 2606 [2020-10-25 23:14:15,633 INFO L226 Difference]: Without dead ends: 1600 [2020-10-25 23:14:15,635 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-25 23:14:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2020-10-25 23:14:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1346. [2020-10-25 23:14:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2020-10-25 23:14:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1697 transitions. [2020-10-25 23:14:15,780 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1697 transitions. Word has length 63 [2020-10-25 23:14:15,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:15,780 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1697 transitions. [2020-10-25 23:14:15,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:14:15,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1697 transitions. [2020-10-25 23:14:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-25 23:14:15,781 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:15,782 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] [2020-10-25 23:14:15,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 23:14:15,782 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:15,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1529422068, now seen corresponding path program 1 times [2020-10-25 23:14:15,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:15,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330814621] [2020-10-25 23:14:15,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:15,826 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-25 23:14:15,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330814621] [2020-10-25 23:14:15,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:15,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:15,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098190665] [2020-10-25 23:14:15,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:15,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:15,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:15,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:15,828 INFO L87 Difference]: Start difference. First operand 1346 states and 1697 transitions. Second operand 3 states. [2020-10-25 23:14:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:16,069 INFO L93 Difference]: Finished difference Result 3754 states and 4725 transitions. [2020-10-25 23:14:16,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:16,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-10-25 23:14:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:16,081 INFO L225 Difference]: With dead ends: 3754 [2020-10-25 23:14:16,081 INFO L226 Difference]: Without dead ends: 2454 [2020-10-25 23:14:16,083 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-25 23:14:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2020-10-25 23:14:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2426. [2020-10-25 23:14:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-10-25 23:14:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3011 transitions. [2020-10-25 23:14:16,287 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3011 transitions. Word has length 63 [2020-10-25 23:14:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:16,289 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 3011 transitions. [2020-10-25 23:14:16,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3011 transitions. [2020-10-25 23:14:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-25 23:14:16,290 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:16,291 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] [2020-10-25 23:14:16,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 23:14:16,291 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:16,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:16,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1900886728, now seen corresponding path program 1 times [2020-10-25 23:14:16,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:16,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138872163] [2020-10-25 23:14:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:16,361 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-25 23:14:16,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138872163] [2020-10-25 23:14:16,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:16,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:14:16,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197159071] [2020-10-25 23:14:16,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:16,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:16,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:16,363 INFO L87 Difference]: Start difference. First operand 2426 states and 3011 transitions. Second operand 4 states. [2020-10-25 23:14:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:16,660 INFO L93 Difference]: Finished difference Result 4276 states and 5307 transitions. [2020-10-25 23:14:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:14:16,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-10-25 23:14:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:16,671 INFO L225 Difference]: With dead ends: 4276 [2020-10-25 23:14:16,671 INFO L226 Difference]: Without dead ends: 1875 [2020-10-25 23:14:16,676 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-25 23:14:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-10-25 23:14:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1871. [2020-10-25 23:14:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2020-10-25 23:14:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2288 transitions. [2020-10-25 23:14:16,884 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2288 transitions. Word has length 64 [2020-10-25 23:14:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:16,884 INFO L481 AbstractCegarLoop]: Abstraction has 1871 states and 2288 transitions. [2020-10-25 23:14:16,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2288 transitions. [2020-10-25 23:14:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-25 23:14:16,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:16,886 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:16,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 23:14:16,887 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:16,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1840238380, now seen corresponding path program 1 times [2020-10-25 23:14:16,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:16,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990449154] [2020-10-25 23:14:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 23:14:16,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990449154] [2020-10-25 23:14:16,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:16,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:14:16,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495116513] [2020-10-25 23:14:16,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:16,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:16,935 INFO L87 Difference]: Start difference. First operand 1871 states and 2288 transitions. Second operand 4 states. [2020-10-25 23:14:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:17,168 INFO L93 Difference]: Finished difference Result 3747 states and 4574 transitions. [2020-10-25 23:14:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:14:17,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-10-25 23:14:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:17,176 INFO L225 Difference]: With dead ends: 3747 [2020-10-25 23:14:17,176 INFO L226 Difference]: Without dead ends: 1634 [2020-10-25 23:14:17,180 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-25 23:14:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2020-10-25 23:14:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1596. [2020-10-25 23:14:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2020-10-25 23:14:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1935 transitions. [2020-10-25 23:14:17,316 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1935 transitions. Word has length 94 [2020-10-25 23:14:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:17,316 INFO L481 AbstractCegarLoop]: Abstraction has 1596 states and 1935 transitions. [2020-10-25 23:14:17,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1935 transitions. [2020-10-25 23:14:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-25 23:14:17,318 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:17,318 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-10-25 23:14:17,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 23:14:17,319 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash 341678357, now seen corresponding path program 1 times [2020-10-25 23:14:17,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:17,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833734130] [2020-10-25 23:14:17,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:17,391 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-25 23:14:17,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833734130] [2020-10-25 23:14:17,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:17,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:17,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813952487] [2020-10-25 23:14:17,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:17,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:17,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:17,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:17,393 INFO L87 Difference]: Start difference. First operand 1596 states and 1935 transitions. Second operand 3 states. [2020-10-25 23:14:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:17,519 INFO L93 Difference]: Finished difference Result 2909 states and 3525 transitions. [2020-10-25 23:14:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:17,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-10-25 23:14:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:17,526 INFO L225 Difference]: With dead ends: 2909 [2020-10-25 23:14:17,526 INFO L226 Difference]: Without dead ends: 1338 [2020-10-25 23:14:17,529 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-25 23:14:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2020-10-25 23:14:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2020-10-25 23:14:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-10-25 23:14:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1576 transitions. [2020-10-25 23:14:17,638 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1576 transitions. Word has length 94 [2020-10-25 23:14:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:17,639 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 1576 transitions. [2020-10-25 23:14:17,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1576 transitions. [2020-10-25 23:14:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-25 23:14:17,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:17,641 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-10-25 23:14:17,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 23:14:17,641 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash 701412920, now seen corresponding path program 1 times [2020-10-25 23:14:17,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:17,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542158026] [2020-10-25 23:14:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 23:14:17,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542158026] [2020-10-25 23:14:17,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:17,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:14:17,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118773815] [2020-10-25 23:14:17,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:17,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:17,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:17,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:17,688 INFO L87 Difference]: Start difference. First operand 1330 states and 1576 transitions. Second operand 4 states. [2020-10-25 23:14:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:17,814 INFO L93 Difference]: Finished difference Result 2218 states and 2610 transitions. [2020-10-25 23:14:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:14:17,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-10-25 23:14:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:17,817 INFO L225 Difference]: With dead ends: 2218 [2020-10-25 23:14:17,818 INFO L226 Difference]: Without dead ends: 598 [2020-10-25 23:14:17,820 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-25 23:14:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-10-25 23:14:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 594. [2020-10-25 23:14:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-10-25 23:14:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2020-10-25 23:14:17,879 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2020-10-25 23:14:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:17,880 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2020-10-25 23:14:17,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2020-10-25 23:14:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-25 23:14:17,881 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:17,881 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-10-25 23:14:17,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 23:14:17,882 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:17,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:17,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1223381222, now seen corresponding path program 1 times [2020-10-25 23:14:17,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:17,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875488555] [2020-10-25 23:14:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 23:14:17,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875488555] [2020-10-25 23:14:17,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:17,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:14:17,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236911805] [2020-10-25 23:14:17,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:17,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:17,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:17,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:17,987 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2020-10-25 23:14:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:18,063 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2020-10-25 23:14:18,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:18,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-10-25 23:14:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:18,067 INFO L225 Difference]: With dead ends: 598 [2020-10-25 23:14:18,067 INFO L226 Difference]: Without dead ends: 596 [2020-10-25 23:14:18,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-10-25 23:14:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2020-10-25 23:14:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-10-25 23:14:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2020-10-25 23:14:18,135 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2020-10-25 23:14:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:18,136 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2020-10-25 23:14:18,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2020-10-25 23:14:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-25 23:14:18,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:18,138 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-10-25 23:14:18,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 23:14:18,138 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:18,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1585215284, now seen corresponding path program 1 times [2020-10-25 23:14:18,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:18,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897428427] [2020-10-25 23:14:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 23:14:18,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897428427] [2020-10-25 23:14:18,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:18,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:18,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681925151] [2020-10-25 23:14:18,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:18,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:18,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:18,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:18,183 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2020-10-25 23:14:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:18,286 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2020-10-25 23:14:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:18,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-10-25 23:14:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:18,291 INFO L225 Difference]: With dead ends: 1230 [2020-10-25 23:14:18,291 INFO L226 Difference]: Without dead ends: 900 [2020-10-25 23:14:18,292 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-25 23:14:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-10-25 23:14:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2020-10-25 23:14:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-10-25 23:14:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2020-10-25 23:14:18,359 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2020-10-25 23:14:18,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:18,359 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2020-10-25 23:14:18,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2020-10-25 23:14:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-25 23:14:18,361 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:18,361 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-10-25 23:14:18,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 23:14:18,361 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:18,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1659596600, now seen corresponding path program 1 times [2020-10-25 23:14:18,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:18,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45083459] [2020-10-25 23:14:18,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:14:18,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:14:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:14:18,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:14:18,441 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:14:18,441 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:14:18,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 23:14:18,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:14:18 BoogieIcfgContainer [2020-10-25 23:14:18,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:14:18,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:14:18,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:14:18,567 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:14:18,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:14:12" (3/4) ... [2020-10-25 23:14:18,569 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:14:18,689 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:14:18,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:14:18,692 INFO L168 Benchmark]: Toolchain (without parser) took 7848.82 ms. Allocated memory was 52.4 MB in the beginning and 377.5 MB in the end (delta: 325.1 MB). Free memory was 29.4 MB in the beginning and 151.5 MB in the end (delta: -122.1 MB). Peak memory consumption was 204.4 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:18,692 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 39.8 MB. Free memory was 17.9 MB in the beginning and 17.8 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:14:18,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.35 ms. Allocated memory is still 52.4 MB. Free memory was 28.8 MB in the beginning and 26.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:18,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.50 ms. Allocated memory is still 52.4 MB. Free memory was 26.7 MB in the beginning and 24.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:18,694 INFO L168 Benchmark]: Boogie Preprocessor took 80.28 ms. Allocated memory is still 52.4 MB. Free memory was 24.2 MB in the beginning and 35.7 MB in the end (delta: -11.4 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:18,694 INFO L168 Benchmark]: RCFGBuilder took 998.18 ms. Allocated memory was 52.4 MB in the beginning and 65.0 MB in the end (delta: 12.6 MB). Free memory was 35.7 MB in the beginning and 36.5 MB in the end (delta: -860.1 kB). Peak memory consumption was 16.7 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:18,695 INFO L168 Benchmark]: TraceAbstraction took 6048.40 ms. Allocated memory was 65.0 MB in the beginning and 377.5 MB in the end (delta: 312.5 MB). Free memory was 35.9 MB in the beginning and 165.1 MB in the end (delta: -129.2 MB). Peak memory consumption was 183.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:18,695 INFO L168 Benchmark]: Witness Printer took 123.45 ms. Allocated memory is still 377.5 MB. Free memory was 165.1 MB in the beginning and 151.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:18,698 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 39.8 MB. Free memory was 17.9 MB in the beginning and 17.8 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 474.35 ms. Allocated memory is still 52.4 MB. Free memory was 28.8 MB in the beginning and 26.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 106.50 ms. Allocated memory is still 52.4 MB. Free memory was 26.7 MB in the beginning and 24.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 80.28 ms. Allocated memory is still 52.4 MB. Free memory was 24.2 MB in the beginning and 35.7 MB in the end (delta: -11.4 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 998.18 ms. Allocated memory was 52.4 MB in the beginning and 65.0 MB in the end (delta: 12.6 MB). Free memory was 35.7 MB in the beginning and 36.5 MB in the end (delta: -860.1 kB). Peak memory consumption was 16.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6048.40 ms. Allocated memory was 65.0 MB in the beginning and 377.5 MB in the end (delta: 312.5 MB). Free memory was 35.9 MB in the beginning and 165.1 MB in the end (delta: -129.2 MB). Peak memory consumption was 183.1 MB. Max. memory is 16.1 GB. * Witness Printer took 123.45 ms. Allocated memory is still 377.5 MB. Free memory was 165.1 MB in the beginning and 151.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 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 m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; VAL [E_1=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, token=0] [L477] int __retres1 ; [L392] m_i = 1 [L393] t1_i = 1 VAL [E_1=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, token=0] [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_st = 0 VAL [E_1=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, token=0] [L174] COND TRUE m_i == 1 [L175] m_st = 0 VAL [E_1=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, token=0] [L179] COND TRUE t1_i == 1 [L180] t1_st = 0 VAL [E_1=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, token=0] [L263] COND FALSE !(M_E == 0) VAL [E_1=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, token=0] [L268] COND FALSE !(T1_E == 0) VAL [E_1=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, token=0] [L273] COND FALSE !(E_M == 0) VAL [E_1=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, token=0] [L278] COND FALSE !(E_1 == 0) VAL [E_1=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, token=0] [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=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, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=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, token=0] [L138] __retres1 = 0 VAL [E_1=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, token=0] [L140] return (__retres1); VAL [E_1=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, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=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, token=0] [L144] int __retres1 ; VAL [E_1=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, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [E_1=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, token=0] [L157] __retres1 = 0 VAL [E_1=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, token=0] [L159] return (__retres1); VAL [E_1=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, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=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, token=0] [L291] COND FALSE !(M_E == 1) VAL [E_1=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, token=0] [L296] COND FALSE !(T1_E == 1) VAL [E_1=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, token=0] [L301] COND FALSE !(E_M == 1) VAL [E_1=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, token=0] [L306] COND FALSE !(E_1 == 1) VAL [E_1=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, token=0] [L432] COND TRUE 1 VAL [E_1=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, token=0] [L435] kernel_st = 1 [L210] int tmp ; VAL [E_1=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, token=0] [L214] COND TRUE 1 VAL [E_1=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, token=0] [L189] int __retres1 ; VAL [E_1=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, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=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, token=0] [L205] return (__retres1); VAL [E_1=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, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=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, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=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, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=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, token=0] [L92] COND TRUE t1_pc == 0 VAL [E_1=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, token=0] [L103] COND TRUE 1 VAL [E_1=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, token=0] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=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, token=0] [L214] COND TRUE 1 VAL [E_1=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, token=0] [L189] int __retres1 ; VAL [E_1=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, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=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, token=0] [L205] return (__retres1); VAL [E_1=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, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=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, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND TRUE m_pc == 0 VAL [E_1=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, token=0] [L47] COND TRUE 1 VAL [E_1=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, token=0] [L50] token = __VERIFIER_nondet_int() [L51] local = token [L52] E_1 = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=1, 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, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=1, 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, token=0] [L138] __retres1 = 0 VAL [E_1=1, 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, token=0] [L140] return (__retres1); VAL [E_1=1, 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, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=1, 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, token=0] [L144] int __retres1 ; VAL [E_1=1, 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, token=0] [L147] COND TRUE t1_pc == 1 VAL [E_1=1, 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, token=0] [L148] COND TRUE E_1 == 1 [L149] __retres1 = 1 VAL [E_1=1, 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, token=0] [L159] return (__retres1); VAL [E_1=1, 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, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND TRUE \read(tmp___0) [L332] t1_st = 0 VAL [E_1=1, 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, token=0] [L54] E_1 = 2 [L55] m_pc = 1 [L56] m_st = 2 VAL [E_1=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, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=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, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [E_1=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, token=0] [L95] COND TRUE t1_pc == 1 VAL [E_1=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, token=0] [L111] token += 1 [L112] E_M = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=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=1, token=1] [L128] COND TRUE m_pc == 1 VAL [E_1=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=1, token=1] [L129] COND TRUE E_M == 1 [L130] __retres1 = 1 VAL [E_1=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=1, token=1] [L140] return (__retres1); VAL [E_1=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=1, token=1] [L321] tmp = is_master_triggered() [L323] COND TRUE \read(tmp) [L324] m_st = 0 VAL [E_1=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=1, token=1] [L144] int __retres1 ; VAL [E_1=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=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [E_1=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=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [E_1=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=1, token=1] [L157] __retres1 = 0 VAL [E_1=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=1, token=1] [L159] return (__retres1); VAL [E_1=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=1, token=1] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=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=1, token=1] [L114] E_M = 2 VAL [E_1=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=1, token=1] [L103] COND TRUE 1 VAL [E_1=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=1, token=1] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=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, token=1] [L214] COND TRUE 1 VAL [E_1=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, token=1] [L189] int __retres1 ; VAL [E_1=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, token=1] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=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, token=1] [L205] return (__retres1); VAL [E_1=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, token=1] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=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, token=1] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND FALSE !(m_pc == 0) VAL [E_1=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, token=1] [L39] COND TRUE m_pc == 1 VAL [E_1=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, token=1] [L61] COND FALSE !(token != local + 1) VAL [E_1=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, token=1] [L66] COND TRUE tmp_var <= 5 VAL [E_1=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, token=1] [L67] COND TRUE tmp_var >= 5 VAL [E_1=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, token=1] [L72] COND TRUE tmp_var <= 5 VAL [E_1=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, token=1] [L73] COND TRUE tmp_var >= 5 VAL [E_1=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, token=1] [L74] COND TRUE tmp_var == 5 VAL [E_1=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, token=1] [L3] __assert_fail("0", "token_ring.01.cil-2.c", 3, "reach_error") VAL [E_1=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, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.8s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4021 SDtfs, 5346 SDslu, 4017 SDs, 0 SdLazy, 454 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2426occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 1746 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1087 ConstructedInterpolants, 0 QuantifiedInterpolants, 147019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 204/204 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...