./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer --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-678e011 [2019-11-20 09:59:32,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:59:32,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:59:32,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:59:32,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:59:32,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:59:32,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:59:32,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:59:32,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:59:32,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:59:32,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:59:32,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:59:32,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:59:32,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:59:32,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:59:32,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:59:32,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:59:32,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:59:32,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:59:32,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:59:32,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:59:32,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:59:32,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:59:32,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:59:32,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:59:32,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:59:32,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:59:32,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:59:32,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:59:32,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:59:32,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:59:32,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:59:32,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:59:32,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:59:32,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:59:32,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:59:32,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:59:32,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:59:32,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:59:32,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:59:32,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:59:32,200 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 09:59:32,224 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:59:32,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:59:32,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:59:32,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:59:32,226 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:59:32,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:59:32,226 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 09:59:32,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 09:59:32,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 09:59:32,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:59:32,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 09:59:32,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:59:32,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 09:59:32,227 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 09:59:32,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 09:59:32,228 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:59:32,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 09:59:32,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:59:32,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:59:32,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:59:32,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:59:32,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:59:32,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:59:32,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:59:32,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 09:59:32,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 09:59:32,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 09:59:32,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 09:59:32,230 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer 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-20 09:59:32,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:59:32,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:59:32,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:59:32,390 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:59:32,390 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:59:32,391 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-11-20 09:59:32,440 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/data/1af1f324a/4163e0cff102491787e4b58fcfd3d92a/FLAG268525f31 [2019-11-20 09:59:32,884 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:59:32,885 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-11-20 09:59:32,899 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/data/1af1f324a/4163e0cff102491787e4b58fcfd3d92a/FLAG268525f31 [2019-11-20 09:59:33,237 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/data/1af1f324a/4163e0cff102491787e4b58fcfd3d92a [2019-11-20 09:59:33,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:59:33,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 09:59:33,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:59:33,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:59:33,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:59:33,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f36b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33, skipping insertion in model container [2019-11-20 09:59:33,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,257 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:59:33,285 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:59:33,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:59:33,521 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:59:33,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:59:33,568 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:59:33,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33 WrapperNode [2019-11-20 09:59:33,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:59:33,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 09:59:33,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 09:59:33,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 09:59:33,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 09:59:33,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:59:33,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:59:33,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:59:33,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (1/1) ... [2019-11-20 09:59:33,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:59:33,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:59:33,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:59:33,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:59:33,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/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-20 09:59:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:59:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:59:34,213 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:59:34,213 INFO L285 CfgBuilder]: Removed 73 assume(true) statements. [2019-11-20 09:59:34,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:59:34 BoogieIcfgContainer [2019-11-20 09:59:34,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:59:34,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:59:34,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:59:34,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:59:34,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:59:33" (1/3) ... [2019-11-20 09:59:34,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c818427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:59:34, skipping insertion in model container [2019-11-20 09:59:34,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:59:33" (2/3) ... [2019-11-20 09:59:34,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c818427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:59:34, skipping insertion in model container [2019-11-20 09:59:34,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:59:34" (3/3) ... [2019-11-20 09:59:34,224 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2019-11-20 09:59:34,233 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:59:34,241 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 09:59:34,253 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 09:59:34,291 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:59:34,291 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 09:59:34,292 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:59:34,292 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:59:34,292 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:59:34,293 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:59:34,293 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:59:34,295 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:59:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2019-11-20 09:59:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 09:59:34,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:59:34,327 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-20 09:59:34,328 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:59:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:59:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash 827300887, now seen corresponding path program 1 times [2019-11-20 09:59:34,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:59:34,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446360479] [2019-11-20 09:59:34,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:59:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:59:34,457 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-20 09:59:34,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446360479] [2019-11-20 09:59:34,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:59:34,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:59:34,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896712891] [2019-11-20 09:59:34,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:59:34,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:59:34,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:59:34,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:59:34,479 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2019-11-20 09:59:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:59:34,526 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2019-11-20 09:59:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:59:34,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 09:59:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:59:34,537 INFO L225 Difference]: With dead ends: 239 [2019-11-20 09:59:34,537 INFO L226 Difference]: Without dead ends: 118 [2019-11-20 09:59:34,540 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-20 09:59:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-20 09:59:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-20 09:59:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-20 09:59:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2019-11-20 09:59:34,585 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 37 [2019-11-20 09:59:34,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:59:34,585 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2019-11-20 09:59:34,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:59:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2019-11-20 09:59:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 09:59:34,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:59:34,587 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-20 09:59:34,587 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:59:34,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:59:34,588 INFO L82 PathProgramCache]: Analyzing trace with hash 899687445, now seen corresponding path program 1 times [2019-11-20 09:59:34,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:59:34,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240129031] [2019-11-20 09:59:34,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:59:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:59:34,620 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-20 09:59:34,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240129031] [2019-11-20 09:59:34,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:59:34,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:59:34,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769067531] [2019-11-20 09:59:34,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:59:34,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:59:34,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:59:34,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:59:34,624 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand 3 states. [2019-11-20 09:59:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:59:34,700 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2019-11-20 09:59:34,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:59:34,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 09:59:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:59:34,703 INFO L225 Difference]: With dead ends: 308 [2019-11-20 09:59:34,703 INFO L226 Difference]: Without dead ends: 196 [2019-11-20 09:59:34,705 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-20 09:59:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-20 09:59:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-11-20 09:59:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-20 09:59:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 280 transitions. [2019-11-20 09:59:34,727 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 280 transitions. Word has length 37 [2019-11-20 09:59:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:59:34,727 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 280 transitions. [2019-11-20 09:59:34,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:59:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 280 transitions. [2019-11-20 09:59:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 09:59:34,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:59:34,729 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-20 09:59:34,734 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:59:34,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:59:34,734 INFO L82 PathProgramCache]: Analyzing trace with hash -413900843, now seen corresponding path program 1 times [2019-11-20 09:59:34,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:59:34,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928698851] [2019-11-20 09:59:34,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:59:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:59:34,785 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-20 09:59:34,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928698851] [2019-11-20 09:59:34,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:59:34,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:59:34,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459474598] [2019-11-20 09:59:34,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:59:34,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:59:34,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:59:34,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:59:34,787 INFO L87 Difference]: Start difference. First operand 194 states and 280 transitions. Second operand 3 states. [2019-11-20 09:59:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:59:34,829 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2019-11-20 09:59:34,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:59:34,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 09:59:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:59:34,832 INFO L225 Difference]: With dead ends: 381 [2019-11-20 09:59:34,832 INFO L226 Difference]: Without dead ends: 194 [2019-11-20 09:59:34,834 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-20 09:59:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-20 09:59:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-20 09:59:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-20 09:59:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2019-11-20 09:59:34,852 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 37 [2019-11-20 09:59:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:59:34,853 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2019-11-20 09:59:34,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:59:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2019-11-20 09:59:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 09:59:34,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:59:34,854 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-20 09:59:34,855 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:59:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:59:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash -733369323, now seen corresponding path program 1 times [2019-11-20 09:59:34,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:59:34,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678775009] [2019-11-20 09:59:34,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:59:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:59:34,883 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-20 09:59:34,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678775009] [2019-11-20 09:59:34,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:59:34,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:59:34,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866705765] [2019-11-20 09:59:34,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:59:34,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:59:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:59:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:59:34,885 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand 3 states. [2019-11-20 09:59:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:59:34,935 INFO L93 Difference]: Finished difference Result 380 states and 534 transitions. [2019-11-20 09:59:34,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:59:34,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 09:59:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:59:34,937 INFO L225 Difference]: With dead ends: 380 [2019-11-20 09:59:34,937 INFO L226 Difference]: Without dead ends: 194 [2019-11-20 09:59:34,939 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-20 09:59:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-20 09:59:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-20 09:59:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-20 09:59:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2019-11-20 09:59:34,955 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 37 [2019-11-20 09:59:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:59:34,956 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2019-11-20 09:59:34,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:59:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2019-11-20 09:59:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 09:59:34,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:59:34,957 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-20 09:59:34,958 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:59:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:59:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2103987404, now seen corresponding path program 1 times [2019-11-20 09:59:34,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:59:34,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893774340] [2019-11-20 09:59:34,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:59:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:59:35,017 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-20 09:59:35,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893774340] [2019-11-20 09:59:35,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:59:35,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:59:35,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312852042] [2019-11-20 09:59:35,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:59:35,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:59:35,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:59:35,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:59:35,020 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand 3 states. [2019-11-20 09:59:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:59:35,077 INFO L93 Difference]: Finished difference Result 525 states and 700 transitions. [2019-11-20 09:59:35,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:59:35,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 09:59:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:59:35,080 INFO L225 Difference]: With dead ends: 525 [2019-11-20 09:59:35,080 INFO L226 Difference]: Without dead ends: 356 [2019-11-20 09:59:35,090 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-20 09:59:35,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-20 09:59:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 334. [2019-11-20 09:59:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-20 09:59:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 435 transitions. [2019-11-20 09:59:35,130 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 435 transitions. Word has length 37 [2019-11-20 09:59:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:59:35,131 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 435 transitions. [2019-11-20 09:59:35,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:59:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 435 transitions. [2019-11-20 09:59:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 09:59:35,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:59:35,133 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-20 09:59:35,133 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:59:35,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:59:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash -303434219, now seen corresponding path program 1 times [2019-11-20 09:59:35,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:59:35,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769726615] [2019-11-20 09:59:35,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:59:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:59:35,189 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-20 09:59:35,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769726615] [2019-11-20 09:59:35,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:59:35,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:59:35,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934915801] [2019-11-20 09:59:35,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:59:35,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:59:35,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:59:35,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:59:35,192 INFO L87 Difference]: Start difference. First operand 334 states and 435 transitions. Second operand 3 states. [2019-11-20 09:59:35,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:59:35,248 INFO L93 Difference]: Finished difference Result 910 states and 1192 transitions. [2019-11-20 09:59:35,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:59:35,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-20 09:59:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:59:35,252 INFO L225 Difference]: With dead ends: 910 [2019-11-20 09:59:35,253 INFO L226 Difference]: Without dead ends: 606 [2019-11-20 09:59:35,254 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-20 09:59:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-11-20 09:59:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2019-11-20 09:59:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-20 09:59:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 772 transitions. [2019-11-20 09:59:35,285 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 772 transitions. Word has length 38 [2019-11-20 09:59:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:59:35,286 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 772 transitions. [2019-11-20 09:59:35,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:59:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 772 transitions. [2019-11-20 09:59:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 09:59:35,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:59:35,299 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-20 09:59:35,299 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:59:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:59:35,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1237930563, now seen corresponding path program 1 times [2019-11-20 09:59:35,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:59:35,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902991504] [2019-11-20 09:59:35,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:59:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:59:35,384 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-20 09:59:35,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902991504] [2019-11-20 09:59:35,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:59:35,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:59:35,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970482038] [2019-11-20 09:59:35,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:59:35,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:59:35,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:59:35,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:59:35,395 INFO L87 Difference]: Start difference. First operand 598 states and 772 transitions. Second operand 3 states. [2019-11-20 09:59:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:59:35,482 INFO L93 Difference]: Finished difference Result 1152 states and 1499 transitions. [2019-11-20 09:59:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:59:35,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-20 09:59:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:59:35,488 INFO L225 Difference]: With dead ends: 1152 [2019-11-20 09:59:35,489 INFO L226 Difference]: Without dead ends: 864 [2019-11-20 09:59:35,490 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-20 09:59:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-11-20 09:59:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-11-20 09:59:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-11-20 09:59:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1109 transitions. [2019-11-20 09:59:35,538 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1109 transitions. Word has length 51 [2019-11-20 09:59:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:59:35,539 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1109 transitions. [2019-11-20 09:59:35,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:59:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1109 transitions. [2019-11-20 09:59:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 09:59:35,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:59:35,543 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-20 09:59:35,543 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:59:35,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:59:35,544 INFO L82 PathProgramCache]: Analyzing trace with hash -690734764, now seen corresponding path program 1 times [2019-11-20 09:59:35,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:59:35,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964498131] [2019-11-20 09:59:35,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:59:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:59:35,633 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-20 09:59:35,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964498131] [2019-11-20 09:59:35,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:59:35,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 09:59:35,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66456343] [2019-11-20 09:59:35,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 09:59:35,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:59:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 09:59:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:59:35,636 INFO L87 Difference]: Start difference. First operand 864 states and 1109 transitions. Second operand 5 states. [2019-11-20 09:59:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:59:35,866 INFO L93 Difference]: Finished difference Result 2777 states and 3544 transitions. [2019-11-20 09:59:35,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 09:59:35,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-20 09:59:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:59:35,878 INFO L225 Difference]: With dead ends: 2777 [2019-11-20 09:59:35,878 INFO L226 Difference]: Without dead ends: 1948 [2019-11-20 09:59:35,880 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-20 09:59:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-11-20 09:59:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 909. [2019-11-20 09:59:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-11-20 09:59:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1143 transitions. [2019-11-20 09:59:35,947 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1143 transitions. Word has length 68 [2019-11-20 09:59:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:59:35,947 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1143 transitions. [2019-11-20 09:59:35,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 09:59:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1143 transitions. [2019-11-20 09:59:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 09:59:35,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:59:35,950 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-20 09:59:35,950 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:59:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:59:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash 696050646, now seen corresponding path program 1 times [2019-11-20 09:59:35,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:59:35,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822072346] [2019-11-20 09:59:35,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:59:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:59:36,046 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-20 09:59:36,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822072346] [2019-11-20 09:59:36,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:59:36,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 09:59:36,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179853250] [2019-11-20 09:59:36,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 09:59:36,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:59:36,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 09:59:36,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:59:36,051 INFO L87 Difference]: Start difference. First operand 909 states and 1143 transitions. Second operand 5 states. [2019-11-20 09:59:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:59:36,225 INFO L93 Difference]: Finished difference Result 2232 states and 2821 transitions. [2019-11-20 09:59:36,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 09:59:36,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-20 09:59:36,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:59:36,233 INFO L225 Difference]: With dead ends: 2232 [2019-11-20 09:59:36,234 INFO L226 Difference]: Without dead ends: 1361 [2019-11-20 09:59:36,235 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-20 09:59:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-11-20 09:59:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 921. [2019-11-20 09:59:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-20 09:59:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1133 transitions. [2019-11-20 09:59:36,311 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1133 transitions. Word has length 68 [2019-11-20 09:59:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:59:36,311 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1133 transitions. [2019-11-20 09:59:36,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 09:59:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1133 transitions. [2019-11-20 09:59:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 09:59:36,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:59:36,313 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-20 09:59:36,313 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:59:36,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:59:36,314 INFO L82 PathProgramCache]: Analyzing trace with hash 680531928, now seen corresponding path program 1 times [2019-11-20 09:59:36,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:59:36,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516795994] [2019-11-20 09:59:36,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:59:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:59:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:59:36,398 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:59:36,398 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 09:59:36,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:59:36 BoogieIcfgContainer [2019-11-20 09:59:36,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 09:59:36,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:59:36,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:59:36,487 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:59:36,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:59:34" (3/4) ... [2019-11-20 09:59:36,490 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 09:59:36,598 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_209b4e50-9775-45ea-87d0-49cbb96d3d94/bin/uautomizer/witness.graphml [2019-11-20 09:59:36,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:59:36,600 INFO L168 Benchmark]: Toolchain (without parser) took 3358.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.1 MB in the beginning and 976.2 MB in the end (delta: -30.2 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. [2019-11-20 09:59:36,601 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:59:36,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 09:59:36,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.70 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 09:59:36,602 INFO L168 Benchmark]: Boogie Preprocessor took 32.31 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-20 09:59:36,602 INFO L168 Benchmark]: RCFGBuilder took 572.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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-11-20 09:59:36,603 INFO L168 Benchmark]: TraceAbstraction took 2270.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.1 MB in the end (delta: 101.2 MB). Peak memory consumption was 101.2 MB. Max. memory is 11.5 GB. [2019-11-20 09:59:36,603 INFO L168 Benchmark]: Witness Printer took 111.80 ms. Allocated memory is still 1.2 GB. Free memory was 983.1 MB in the beginning and 976.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 09:59:36,605 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.70 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.31 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 572.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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2270.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.1 MB in the end (delta: 101.2 MB). Peak memory consumption was 101.2 MB. Max. memory is 11.5 GB. * Witness Printer took 111.80 ms. Allocated memory is still 1.2 GB. Free memory was 983.1 MB in the beginning and 976.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 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.1s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 0.9s, 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.3s 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...