./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18c351eab8f6ce363bd7076ce800527c30b2b6c5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:28:28,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:28:28,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:28:28,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:28:28,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:28:28,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:28:28,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:28:28,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:28:28,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:28:28,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:28:28,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:28:28,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:28:28,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:28:28,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:28:28,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:28:28,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:28:28,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:28:28,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:28:28,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:28:28,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:28:28,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:28:28,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:28:28,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:28:28,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:28:28,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:28:28,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:28:28,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:28:28,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:28:28,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:28:28,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:28:28,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:28:28,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:28:28,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:28:28,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:28:28,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:28:28,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:28:28,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:28:28,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:28:28,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:28:28,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:28:28,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:28:28,554 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:28:28,569 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:28:28,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:28:28,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:28:28,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:28:28,572 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:28:28,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:28:28,572 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:28:28,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:28:28,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:28:28,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:28:28,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:28:28,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:28:28,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:28:28,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:28:28,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:28:28,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:28:28,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:28:28,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:28:28,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:28:28,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:28:28,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:28:28,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:28:28,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:28:28,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:28:28,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:28:28,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:28:28,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:28:28,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:28:28,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18c351eab8f6ce363bd7076ce800527c30b2b6c5 [2019-11-28 00:28:28,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:28:28,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:28:28,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:28:28,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:28:28,902 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:28:28,903 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-11-28 00:28:28,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa49829d/ff47c81d5ae54135b75a4388bb165c96/FLAG6b5192139 [2019-11-28 00:28:29,445 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:28:29,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-11-28 00:28:29,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa49829d/ff47c81d5ae54135b75a4388bb165c96/FLAG6b5192139 [2019-11-28 00:28:29,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa49829d/ff47c81d5ae54135b75a4388bb165c96 [2019-11-28 00:28:29,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:28:29,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:28:29,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:28:29,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:28:29,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:28:29,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:28:29" (1/1) ... [2019-11-28 00:28:29,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25640e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:29, skipping insertion in model container [2019-11-28 00:28:29,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:28:29" (1/1) ... [2019-11-28 00:28:29,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:28:29,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:28:30,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:28:30,125 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:28:30,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:28:30,294 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:28:30,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30 WrapperNode [2019-11-28 00:28:30,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:28:30,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:28:30,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:28:30,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:28:30,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (1/1) ... [2019-11-28 00:28:30,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (1/1) ... [2019-11-28 00:28:30,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:28:30,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:28:30,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:28:30,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:28:30,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (1/1) ... [2019-11-28 00:28:30,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (1/1) ... [2019-11-28 00:28:30,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (1/1) ... [2019-11-28 00:28:30,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (1/1) ... [2019-11-28 00:28:30,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (1/1) ... [2019-11-28 00:28:30,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (1/1) ... [2019-11-28 00:28:30,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (1/1) ... [2019-11-28 00:28:30,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:28:30,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:28:30,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:28:30,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:28:30,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:28:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:28:30,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:28:31,043 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:28:31,044 INFO L297 CfgBuilder]: Removed 73 assume(true) statements. [2019-11-28 00:28:31,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:28:31 BoogieIcfgContainer [2019-11-28 00:28:31,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:28:31,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:28:31,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:28:31,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:28:31,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:28:29" (1/3) ... [2019-11-28 00:28:31,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cd1f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:28:31, skipping insertion in model container [2019-11-28 00:28:31,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:30" (2/3) ... [2019-11-28 00:28:31,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cd1f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:28:31, skipping insertion in model container [2019-11-28 00:28:31,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:28:31" (3/3) ... [2019-11-28 00:28:31,062 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2019-11-28 00:28:31,073 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:28:31,082 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:28:31,095 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:28:31,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:28:31,128 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:28:31,128 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:28:31,128 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:28:31,129 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:28:31,129 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:28:31,129 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:28:31,129 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:28:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2019-11-28 00:28:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 00:28:31,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:28:31,158 INFO L410 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] [2019-11-28 00:28:31,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:28:31,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:28:31,166 INFO L82 PathProgramCache]: Analyzing trace with hash 827300887, now seen corresponding path program 1 times [2019-11-28 00:28:31,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:28:31,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15159819] [2019-11-28 00:28:31,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:28:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:28:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:28:31,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15159819] [2019-11-28 00:28:31,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:28:31,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:28:31,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775246840] [2019-11-28 00:28:31,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:28:31,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:28:31,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:28:31,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:28:31,360 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2019-11-28 00:28:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:28:31,434 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2019-11-28 00:28:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:28:31,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 00:28:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:28:31,456 INFO L225 Difference]: With dead ends: 239 [2019-11-28 00:28:31,457 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 00:28:31,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:28:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 00:28:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-28 00:28:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 00:28:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2019-11-28 00:28:31,507 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 37 [2019-11-28 00:28:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:28:31,508 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2019-11-28 00:28:31,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:28:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2019-11-28 00:28:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 00:28:31,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:28:31,510 INFO L410 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] [2019-11-28 00:28:31,510 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:28:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:28:31,510 INFO L82 PathProgramCache]: Analyzing trace with hash 899687445, now seen corresponding path program 1 times [2019-11-28 00:28:31,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:28:31,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987040838] [2019-11-28 00:28:31,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:28:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:28:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:28:31,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987040838] [2019-11-28 00:28:31,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:28:31,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:28:31,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689363838] [2019-11-28 00:28:31,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:28:31,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:28:31,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:28:31,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:28:31,557 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand 3 states. [2019-11-28 00:28:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:28:31,653 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2019-11-28 00:28:31,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:28:31,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 00:28:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:28:31,656 INFO L225 Difference]: With dead ends: 308 [2019-11-28 00:28:31,656 INFO L226 Difference]: Without dead ends: 196 [2019-11-28 00:28:31,658 INFO L630 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 [2019-11-28 00:28:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-28 00:28:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-11-28 00:28:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 00:28:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 280 transitions. [2019-11-28 00:28:31,686 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 280 transitions. Word has length 37 [2019-11-28 00:28:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:28:31,686 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 280 transitions. [2019-11-28 00:28:31,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:28:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 280 transitions. [2019-11-28 00:28:31,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 00:28:31,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:28:31,688 INFO L410 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] [2019-11-28 00:28:31,689 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:28:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:28:31,689 INFO L82 PathProgramCache]: Analyzing trace with hash -413900843, now seen corresponding path program 1 times [2019-11-28 00:28:31,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:28:31,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978088361] [2019-11-28 00:28:31,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:28:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:28:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:28:31,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978088361] [2019-11-28 00:28:31,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:28:31,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:28:31,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010903585] [2019-11-28 00:28:31,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:28:31,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:28:31,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:28:31,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:28:31,752 INFO L87 Difference]: Start difference. First operand 194 states and 280 transitions. Second operand 3 states. [2019-11-28 00:28:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:28:31,807 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2019-11-28 00:28:31,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:28:31,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 00:28:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:28:31,810 INFO L225 Difference]: With dead ends: 381 [2019-11-28 00:28:31,810 INFO L226 Difference]: Without dead ends: 194 [2019-11-28 00:28:31,812 INFO L630 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 [2019-11-28 00:28:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-28 00:28:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-28 00:28:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 00:28:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2019-11-28 00:28:31,836 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 37 [2019-11-28 00:28:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:28:31,836 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2019-11-28 00:28:31,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:28:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2019-11-28 00:28:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 00:28:31,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:28:31,838 INFO L410 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] [2019-11-28 00:28:31,839 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:28:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:28:31,839 INFO L82 PathProgramCache]: Analyzing trace with hash -733369323, now seen corresponding path program 1 times [2019-11-28 00:28:31,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:28:31,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536728158] [2019-11-28 00:28:31,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:28:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:28:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:28:31,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536728158] [2019-11-28 00:28:31,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:28:31,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:28:31,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062814894] [2019-11-28 00:28:31,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:28:31,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:28:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:28:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:28:31,898 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand 3 states. [2019-11-28 00:28:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:28:31,972 INFO L93 Difference]: Finished difference Result 380 states and 534 transitions. [2019-11-28 00:28:31,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:28:31,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 00:28:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:28:31,977 INFO L225 Difference]: With dead ends: 380 [2019-11-28 00:28:31,977 INFO L226 Difference]: Without dead ends: 194 [2019-11-28 00:28:31,981 INFO L630 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 [2019-11-28 00:28:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-28 00:28:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-28 00:28:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 00:28:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2019-11-28 00:28:32,019 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 37 [2019-11-28 00:28:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:28:32,020 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2019-11-28 00:28:32,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:28:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2019-11-28 00:28:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 00:28:32,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:28:32,022 INFO L410 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] [2019-11-28 00:28:32,023 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:28:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:28:32,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2103987404, now seen corresponding path program 1 times [2019-11-28 00:28:32,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:28:32,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972738390] [2019-11-28 00:28:32,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:28:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:28:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:28:32,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972738390] [2019-11-28 00:28:32,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:28:32,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:28:32,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320244267] [2019-11-28 00:28:32,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:28:32,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:28:32,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:28:32,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:28:32,091 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand 3 states. [2019-11-28 00:28:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:28:32,171 INFO L93 Difference]: Finished difference Result 525 states and 700 transitions. [2019-11-28 00:28:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:28:32,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 00:28:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:28:32,174 INFO L225 Difference]: With dead ends: 525 [2019-11-28 00:28:32,174 INFO L226 Difference]: Without dead ends: 356 [2019-11-28 00:28:32,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:28:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-28 00:28:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 334. [2019-11-28 00:28:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-28 00:28:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 435 transitions. [2019-11-28 00:28:32,202 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 435 transitions. Word has length 37 [2019-11-28 00:28:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:28:32,202 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 435 transitions. [2019-11-28 00:28:32,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:28:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 435 transitions. [2019-11-28 00:28:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 00:28:32,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:28:32,204 INFO L410 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] [2019-11-28 00:28:32,205 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:28:32,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:28:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash -303434219, now seen corresponding path program 1 times [2019-11-28 00:28:32,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:28:32,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333694026] [2019-11-28 00:28:32,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:28:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:28:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:28:32,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333694026] [2019-11-28 00:28:32,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:28:32,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:28:32,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066273192] [2019-11-28 00:28:32,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:28:32,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:28:32,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:28:32,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:28:32,296 INFO L87 Difference]: Start difference. First operand 334 states and 435 transitions. Second operand 3 states. [2019-11-28 00:28:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:28:32,362 INFO L93 Difference]: Finished difference Result 910 states and 1192 transitions. [2019-11-28 00:28:32,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:28:32,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-28 00:28:32,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:28:32,367 INFO L225 Difference]: With dead ends: 910 [2019-11-28 00:28:32,367 INFO L226 Difference]: Without dead ends: 606 [2019-11-28 00:28:32,368 INFO L630 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 [2019-11-28 00:28:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-11-28 00:28:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2019-11-28 00:28:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-28 00:28:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 772 transitions. [2019-11-28 00:28:32,405 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 772 transitions. Word has length 38 [2019-11-28 00:28:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:28:32,405 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 772 transitions. [2019-11-28 00:28:32,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:28:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 772 transitions. [2019-11-28 00:28:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:28:32,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:28:32,408 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:28:32,408 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:28:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:28:32,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1237930563, now seen corresponding path program 1 times [2019-11-28 00:28:32,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:28:32,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85219678] [2019-11-28 00:28:32,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:28:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:28:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:28:32,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85219678] [2019-11-28 00:28:32,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:28:32,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:28:32,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764002831] [2019-11-28 00:28:32,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:28:32,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:28:32,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:28:32,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:28:32,474 INFO L87 Difference]: Start difference. First operand 598 states and 772 transitions. Second operand 3 states. [2019-11-28 00:28:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:28:32,559 INFO L93 Difference]: Finished difference Result 1152 states and 1499 transitions. [2019-11-28 00:28:32,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:28:32,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 00:28:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:28:32,564 INFO L225 Difference]: With dead ends: 1152 [2019-11-28 00:28:32,565 INFO L226 Difference]: Without dead ends: 864 [2019-11-28 00:28:32,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:28:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-11-28 00:28:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-11-28 00:28:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-11-28 00:28:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1109 transitions. [2019-11-28 00:28:32,616 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1109 transitions. Word has length 51 [2019-11-28 00:28:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:28:32,616 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1109 transitions. [2019-11-28 00:28:32,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:28:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1109 transitions. [2019-11-28 00:28:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 00:28:32,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:28:32,619 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:28:32,619 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:28:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:28:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash -690734764, now seen corresponding path program 1 times [2019-11-28 00:28:32,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:28:32,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551955006] [2019-11-28 00:28:32,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:28:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:28:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 00:28:32,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551955006] [2019-11-28 00:28:32,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:28:32,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:28:32,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911381993] [2019-11-28 00:28:32,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:28:32,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:28:32,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:28:32,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:28:32,725 INFO L87 Difference]: Start difference. First operand 864 states and 1109 transitions. Second operand 5 states. [2019-11-28 00:28:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:28:32,926 INFO L93 Difference]: Finished difference Result 2777 states and 3544 transitions. [2019-11-28 00:28:32,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:28:32,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-28 00:28:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:28:32,936 INFO L225 Difference]: With dead ends: 2777 [2019-11-28 00:28:32,936 INFO L226 Difference]: Without dead ends: 1948 [2019-11-28 00:28:32,938 INFO L630 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 [2019-11-28 00:28:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-11-28 00:28:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 909. [2019-11-28 00:28:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-11-28 00:28:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1143 transitions. [2019-11-28 00:28:33,014 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1143 transitions. Word has length 68 [2019-11-28 00:28:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:28:33,014 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1143 transitions. [2019-11-28 00:28:33,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:28:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1143 transitions. [2019-11-28 00:28:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 00:28:33,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:28:33,017 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:28:33,017 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:28:33,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:28:33,017 INFO L82 PathProgramCache]: Analyzing trace with hash 696050646, now seen corresponding path program 1 times [2019-11-28 00:28:33,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:28:33,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736635434] [2019-11-28 00:28:33,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:28:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:28:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 00:28:33,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736635434] [2019-11-28 00:28:33,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:28:33,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:28:33,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653692863] [2019-11-28 00:28:33,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:28:33,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:28:33,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:28:33,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:28:33,101 INFO L87 Difference]: Start difference. First operand 909 states and 1143 transitions. Second operand 5 states. [2019-11-28 00:28:33,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:28:33,338 INFO L93 Difference]: Finished difference Result 2232 states and 2821 transitions. [2019-11-28 00:28:33,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:28:33,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-28 00:28:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:28:33,347 INFO L225 Difference]: With dead ends: 2232 [2019-11-28 00:28:33,347 INFO L226 Difference]: Without dead ends: 1361 [2019-11-28 00:28:33,350 INFO L630 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 [2019-11-28 00:28:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-11-28 00:28:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 921. [2019-11-28 00:28:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-28 00:28:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1133 transitions. [2019-11-28 00:28:33,431 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1133 transitions. Word has length 68 [2019-11-28 00:28:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:28:33,432 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1133 transitions. [2019-11-28 00:28:33,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:28:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1133 transitions. [2019-11-28 00:28:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 00:28:33,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:28:33,434 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:28:33,434 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:28:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:28:33,435 INFO L82 PathProgramCache]: Analyzing trace with hash 680531928, now seen corresponding path program 1 times [2019-11-28 00:28:33,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:28:33,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535025168] [2019-11-28 00:28:33,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:28:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:28:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:28:33,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:28:33,503 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:28:33,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:28:33 BoogieIcfgContainer [2019-11-28 00:28:33,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:28:33,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:28:33,620 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:28:33,620 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:28:33,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:28:31" (3/4) ... [2019-11-28 00:28:33,624 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:28:33,768 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:28:33,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:28:33,774 INFO L168 Benchmark]: Toolchain (without parser) took 4007.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:28:33,774 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:28:33,775 INFO L168 Benchmark]: CACSL2BoogieTranslator took 529.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:28:33,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:28:33,775 INFO L168 Benchmark]: Boogie Preprocessor took 49.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:28:33,776 INFO L168 Benchmark]: RCFGBuilder took 649.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:28:33,776 INFO L168 Benchmark]: TraceAbstraction took 2569.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -66.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:28:33,776 INFO L168 Benchmark]: Witness Printer took 148.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:28:33,781 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 529.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 649.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2569.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -66.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Witness Printer took 148.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; [L354] m_i = 1 [L355] t1_i = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(E_1 == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(E_1 == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] kernel_st = 1 [L187] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L191] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 [L53] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 122 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.3s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1554 SDtfs, 1693 SDslu, 1435 SDs, 0 SdLazy, 165 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1511 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 28171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 33/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...