./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5a079682 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/pthread-nondet/nondet-loop-bound-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 18f8c11d6085f6594f0f2021411e68b8ac706f42 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5a07968 [2019-11-22 11:01:02,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:01:02,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:01:02,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:01:02,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:01:02,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:01:02,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:01:02,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:01:02,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:01:02,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:01:02,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:01:02,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:01:02,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:01:02,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:01:02,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:01:02,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:01:02,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:01:02,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:01:02,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:01:02,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:01:02,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:01:02,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:01:02,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:01:02,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:01:02,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:01:02,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:01:02,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:01:02,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:01:02,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:01:02,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:01:02,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:01:02,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:01:02,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:01:02,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:01:02,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:01:02,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:01:02,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:01:02,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:01:02,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:01:02,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:01:02,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:01:02,294 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-22 11:01:02,313 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:01:02,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:01:02,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:01:02,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:01:02,316 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:01:02,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:01:02,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:01:02,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:01:02,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-22 11:01:02,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:01:02,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-22 11:01:02,319 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:01:02,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-22 11:01:02,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:01:02,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-22 11:01:02,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:01:02,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:01:02,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:01:02,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:01:02,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:01:02,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:01:02,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:01:02,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-22 11:01:02,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 11:01:02,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 11:01:02,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-22 11:01:02,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 11:01:02,323 INFO L138 SettingsManager]: * To the following directory=dump/ 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18f8c11d6085f6594f0f2021411e68b8ac706f42 [2019-11-22 11:01:02,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:01:02,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:01:02,651 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:01:02,653 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:01:02,653 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:01:02,654 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-22 11:01:02,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4da408484/7c73460786654589aa64f5603509b032/FLAG700d5b6c4 [2019-11-22 11:01:03,243 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:01:03,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-22 11:01:03,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4da408484/7c73460786654589aa64f5603509b032/FLAG700d5b6c4 [2019-11-22 11:01:03,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4da408484/7c73460786654589aa64f5603509b032 [2019-11-22 11:01:03,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:01:03,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-22 11:01:03,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:01:03,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:01:03,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:01:03,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:01:03" (1/1) ... [2019-11-22 11:01:03,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574f5a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:03, skipping insertion in model container [2019-11-22 11:01:03,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:01:03" (1/1) ... [2019-11-22 11:01:03,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:01:03,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:01:04,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:01:04,226 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:01:04,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:01:04,349 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:01:04,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04 WrapperNode [2019-11-22 11:01:04,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:01:04,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-22 11:01:04,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-22 11:01:04,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-22 11:01:04,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (1/1) ... [2019-11-22 11:01:04,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (1/1) ... [2019-11-22 11:01:04,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-22 11:01:04,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:01:04,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:01:04,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:01:04,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (1/1) ... [2019-11-22 11:01:04,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (1/1) ... [2019-11-22 11:01:04,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (1/1) ... [2019-11-22 11:01:04,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (1/1) ... [2019-11-22 11:01:04,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (1/1) ... [2019-11-22 11:01:04,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (1/1) ... [2019-11-22 11:01:04,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (1/1) ... [2019-11-22 11:01:04,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:01:04,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:01:04,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:01:04,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:01:04,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (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-22 11:01:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-22 11:01:04,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-22 11:01:04,514 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-22 11:01:04,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-22 11:01:04,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 11:01:04,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 11:01:04,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:01:04,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:01:04,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:01:04,517 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-22 11:01:04,876 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:01:04,877 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-22 11:01:04,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:04 BoogieIcfgContainer [2019-11-22 11:01:04,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:01:04,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:01:04,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:01:04,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:01:04,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:01:03" (1/3) ... [2019-11-22 11:01:04,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652b4632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:01:04, skipping insertion in model container [2019-11-22 11:01:04,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:04" (2/3) ... [2019-11-22 11:01:04,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652b4632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:01:04, skipping insertion in model container [2019-11-22 11:01:04,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:04" (3/3) ... [2019-11-22 11:01:04,888 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2019-11-22 11:01:04,930 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,931 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,931 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,931 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,932 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,932 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,932 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,933 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,933 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,933 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,934 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,934 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,934 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,934 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,935 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,935 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,937 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,937 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,939 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,939 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,939 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,943 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,943 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,945 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,946 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,946 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,948 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,948 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 11:01:04,967 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-22 11:01:04,968 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:01:04,976 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-22 11:01:04,986 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-22 11:01:05,007 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:01:05,008 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-22 11:01:05,008 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:01:05,008 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:01:05,009 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:01:05,009 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:01:05,009 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:01:05,009 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:01:05,022 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 83 transitions [2019-11-22 11:01:09,343 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34966 states. [2019-11-22 11:01:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 34966 states. [2019-11-22 11:01:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 11:01:09,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:09,354 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] [2019-11-22 11:01:09,355 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:09,360 INFO L82 PathProgramCache]: Analyzing trace with hash -902852624, now seen corresponding path program 1 times [2019-11-22 11:01:09,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:09,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931271363] [2019-11-22 11:01:09,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:09,673 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-22 11:01:09,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931271363] [2019-11-22 11:01:09,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:09,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:01:09,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726865737] [2019-11-22 11:01:09,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:01:09,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:09,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:01:09,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:01:09,700 INFO L87 Difference]: Start difference. First operand 34966 states. Second operand 6 states. [2019-11-22 11:01:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:10,689 INFO L93 Difference]: Finished difference Result 45470 states and 184962 transitions. [2019-11-22 11:01:10,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:01:10,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-22 11:01:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:10,903 INFO L225 Difference]: With dead ends: 45470 [2019-11-22 11:01:10,903 INFO L226 Difference]: Without dead ends: 20819 [2019-11-22 11:01:10,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:01:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20819 states. [2019-11-22 11:01:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20819 to 20819. [2019-11-22 11:01:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20819 states. [2019-11-22 11:01:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20819 states to 20819 states and 82977 transitions. [2019-11-22 11:01:12,049 INFO L78 Accepts]: Start accepts. Automaton has 20819 states and 82977 transitions. Word has length 25 [2019-11-22 11:01:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:12,051 INFO L462 AbstractCegarLoop]: Abstraction has 20819 states and 82977 transitions. [2019-11-22 11:01:12,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:01:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 20819 states and 82977 transitions. [2019-11-22 11:01:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 11:01:12,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:12,065 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] [2019-11-22 11:01:12,066 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1950343494, now seen corresponding path program 1 times [2019-11-22 11:01:12,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:12,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772781137] [2019-11-22 11:01:12,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:12,236 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-22 11:01:12,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772781137] [2019-11-22 11:01:12,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:12,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 11:01:12,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681192024] [2019-11-22 11:01:12,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:01:12,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:12,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:01:12,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:01:12,240 INFO L87 Difference]: Start difference. First operand 20819 states and 82977 transitions. Second operand 8 states. [2019-11-22 11:01:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:13,104 INFO L93 Difference]: Finished difference Result 35069 states and 134196 transitions. [2019-11-22 11:01:13,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:01:13,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-22 11:01:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:13,260 INFO L225 Difference]: With dead ends: 35069 [2019-11-22 11:01:13,261 INFO L226 Difference]: Without dead ends: 28819 [2019-11-22 11:01:13,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:01:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28819 states. [2019-11-22 11:01:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28819 to 19249. [2019-11-22 11:01:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19249 states. [2019-11-22 11:01:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19249 states to 19249 states and 75732 transitions. [2019-11-22 11:01:14,180 INFO L78 Accepts]: Start accepts. Automaton has 19249 states and 75732 transitions. Word has length 34 [2019-11-22 11:01:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:14,180 INFO L462 AbstractCegarLoop]: Abstraction has 19249 states and 75732 transitions. [2019-11-22 11:01:14,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:01:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 19249 states and 75732 transitions. [2019-11-22 11:01:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-22 11:01:14,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:14,185 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-22 11:01:14,186 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:14,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:14,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1707268840, now seen corresponding path program 1 times [2019-11-22 11:01:14,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:14,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882956739] [2019-11-22 11:01:14,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 11:01:14,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882956739] [2019-11-22 11:01:14,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:14,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 11:01:14,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614777083] [2019-11-22 11:01:14,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:01:14,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:14,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:01:14,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:01:14,314 INFO L87 Difference]: Start difference. First operand 19249 states and 75732 transitions. Second operand 8 states. [2019-11-22 11:01:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:14,769 INFO L93 Difference]: Finished difference Result 31729 states and 119978 transitions. [2019-11-22 11:01:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:01:14,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-22 11:01:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:14,879 INFO L225 Difference]: With dead ends: 31729 [2019-11-22 11:01:14,879 INFO L226 Difference]: Without dead ends: 25345 [2019-11-22 11:01:14,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:01:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25345 states. [2019-11-22 11:01:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25345 to 17369. [2019-11-22 11:01:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17369 states. [2019-11-22 11:01:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17369 states to 17369 states and 66928 transitions. [2019-11-22 11:01:16,098 INFO L78 Accepts]: Start accepts. Automaton has 17369 states and 66928 transitions. Word has length 41 [2019-11-22 11:01:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:16,100 INFO L462 AbstractCegarLoop]: Abstraction has 17369 states and 66928 transitions. [2019-11-22 11:01:16,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:01:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 17369 states and 66928 transitions. [2019-11-22 11:01:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 11:01:16,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:16,107 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-22 11:01:16,107 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:16,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:16,107 INFO L82 PathProgramCache]: Analyzing trace with hash -539445418, now seen corresponding path program 1 times [2019-11-22 11:01:16,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:16,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730741617] [2019-11-22 11:01:16,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:16,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730741617] [2019-11-22 11:01:16,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587574462] [2019-11-22 11:01:16,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:16,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:01:16,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:01:16,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:16,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:01:16,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-22 11:01:16,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331543671] [2019-11-22 11:01:16,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 11:01:16,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:16,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 11:01:16,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-22 11:01:16,555 INFO L87 Difference]: Start difference. First operand 17369 states and 66928 transitions. Second operand 18 states. [2019-11-22 11:01:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:17,473 INFO L93 Difference]: Finished difference Result 34675 states and 128863 transitions. [2019-11-22 11:01:17,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 11:01:17,474 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-22 11:01:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:17,665 INFO L225 Difference]: With dead ends: 34675 [2019-11-22 11:01:17,665 INFO L226 Difference]: Without dead ends: 32095 [2019-11-22 11:01:17,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-22 11:01:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32095 states. [2019-11-22 11:01:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32095 to 16565. [2019-11-22 11:01:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16565 states. [2019-11-22 11:01:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16565 states to 16565 states and 63900 transitions. [2019-11-22 11:01:18,458 INFO L78 Accepts]: Start accepts. Automaton has 16565 states and 63900 transitions. Word has length 45 [2019-11-22 11:01:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:18,459 INFO L462 AbstractCegarLoop]: Abstraction has 16565 states and 63900 transitions. [2019-11-22 11:01:18,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 11:01:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 16565 states and 63900 transitions. [2019-11-22 11:01:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 11:01:18,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:18,464 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-22 11:01:18,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:18,669 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:18,669 INFO L82 PathProgramCache]: Analyzing trace with hash -548416362, now seen corresponding path program 2 times [2019-11-22 11:01:18,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:18,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046789465] [2019-11-22 11:01:18,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 11:01:18,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046789465] [2019-11-22 11:01:18,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:18,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:01:18,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729342436] [2019-11-22 11:01:18,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:01:18,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:01:18,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:01:18,792 INFO L87 Difference]: Start difference. First operand 16565 states and 63900 transitions. Second operand 10 states. [2019-11-22 11:01:19,258 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-11-22 11:01:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:19,650 INFO L93 Difference]: Finished difference Result 32695 states and 121435 transitions. [2019-11-22 11:01:19,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 11:01:19,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-22 11:01:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:19,749 INFO L225 Difference]: With dead ends: 32695 [2019-11-22 11:01:19,750 INFO L226 Difference]: Without dead ends: 29971 [2019-11-22 11:01:19,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-22 11:01:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29971 states. [2019-11-22 11:01:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29971 to 13517. [2019-11-22 11:01:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13517 states. [2019-11-22 11:01:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13517 states to 13517 states and 52896 transitions. [2019-11-22 11:01:20,351 INFO L78 Accepts]: Start accepts. Automaton has 13517 states and 52896 transitions. Word has length 45 [2019-11-22 11:01:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:20,351 INFO L462 AbstractCegarLoop]: Abstraction has 13517 states and 52896 transitions. [2019-11-22 11:01:20,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:01:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 13517 states and 52896 transitions. [2019-11-22 11:01:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-22 11:01:20,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:20,360 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:20,360 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash 337207879, now seen corresponding path program 1 times [2019-11-22 11:01:20,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:20,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138906667] [2019-11-22 11:01:20,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 11:01:20,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138906667] [2019-11-22 11:01:20,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:20,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 11:01:20,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17989487] [2019-11-22 11:01:20,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:01:20,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:01:20,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:01:20,514 INFO L87 Difference]: Start difference. First operand 13517 states and 52896 transitions. Second operand 8 states. [2019-11-22 11:01:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:20,795 INFO L93 Difference]: Finished difference Result 22637 states and 85048 transitions. [2019-11-22 11:01:20,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:01:20,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-22 11:01:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:20,837 INFO L225 Difference]: With dead ends: 22637 [2019-11-22 11:01:20,837 INFO L226 Difference]: Without dead ends: 16787 [2019-11-22 11:01:20,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:01:20,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16787 states. [2019-11-22 11:01:21,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16787 to 12107. [2019-11-22 11:01:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12107 states. [2019-11-22 11:01:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12107 states to 12107 states and 45415 transitions. [2019-11-22 11:01:21,208 INFO L78 Accepts]: Start accepts. Automaton has 12107 states and 45415 transitions. Word has length 48 [2019-11-22 11:01:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:21,209 INFO L462 AbstractCegarLoop]: Abstraction has 12107 states and 45415 transitions. [2019-11-22 11:01:21,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:01:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 12107 states and 45415 transitions. [2019-11-22 11:01:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 11:01:21,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:21,225 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:21,225 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:21,225 INFO L82 PathProgramCache]: Analyzing trace with hash -297898423, now seen corresponding path program 1 times [2019-11-22 11:01:21,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:21,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997992463] [2019-11-22 11:01:21,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 11:01:21,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997992463] [2019-11-22 11:01:21,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440561192] [2019-11-22 11:01:21,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:21,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:01:21,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:01:21,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 11:01:21,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:01:21,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-22 11:01:21,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171883881] [2019-11-22 11:01:21,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 11:01:21,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:21,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 11:01:21,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-22 11:01:21,598 INFO L87 Difference]: Start difference. First operand 12107 states and 45415 transitions. Second operand 18 states. [2019-11-22 11:01:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:22,324 INFO L93 Difference]: Finished difference Result 22447 states and 81039 transitions. [2019-11-22 11:01:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 11:01:22,325 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-22 11:01:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:22,360 INFO L225 Difference]: With dead ends: 22447 [2019-11-22 11:01:22,360 INFO L226 Difference]: Without dead ends: 19931 [2019-11-22 11:01:22,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-22 11:01:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19931 states. [2019-11-22 11:01:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19931 to 12075. [2019-11-22 11:01:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12075 states. [2019-11-22 11:01:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 44995 transitions. [2019-11-22 11:01:22,669 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 44995 transitions. Word has length 52 [2019-11-22 11:01:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:22,670 INFO L462 AbstractCegarLoop]: Abstraction has 12075 states and 44995 transitions. [2019-11-22 11:01:22,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 11:01:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 44995 transitions. [2019-11-22 11:01:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 11:01:22,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:22,691 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:22,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:22,895 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:22,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2054262665, now seen corresponding path program 2 times [2019-11-22 11:01:22,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:22,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278858684] [2019-11-22 11:01:22,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 11:01:23,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278858684] [2019-11-22 11:01:23,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:23,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:01:23,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272881367] [2019-11-22 11:01:23,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:01:23,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:23,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:01:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:01:23,020 INFO L87 Difference]: Start difference. First operand 12075 states and 44995 transitions. Second operand 10 states. [2019-11-22 11:01:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:23,797 INFO L93 Difference]: Finished difference Result 20531 states and 73675 transitions. [2019-11-22 11:01:23,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 11:01:23,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 11:01:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:23,837 INFO L225 Difference]: With dead ends: 20531 [2019-11-22 11:01:23,837 INFO L226 Difference]: Without dead ends: 17621 [2019-11-22 11:01:23,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-22 11:01:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2019-11-22 11:01:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 9225. [2019-11-22 11:01:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2019-11-22 11:01:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 34430 transitions. [2019-11-22 11:01:24,086 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 34430 transitions. Word has length 52 [2019-11-22 11:01:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:24,086 INFO L462 AbstractCegarLoop]: Abstraction has 9225 states and 34430 transitions. [2019-11-22 11:01:24,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:01:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 34430 transitions. [2019-11-22 11:01:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 11:01:24,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:24,099 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:24,100 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:24,100 INFO L82 PathProgramCache]: Analyzing trace with hash 795640873, now seen corresponding path program 1 times [2019-11-22 11:01:24,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:24,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649594931] [2019-11-22 11:01:24,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 11:01:24,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649594931] [2019-11-22 11:01:24,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:24,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:01:24,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420939470] [2019-11-22 11:01:24,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:01:24,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:24,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:01:24,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:01:24,221 INFO L87 Difference]: Start difference. First operand 9225 states and 34430 transitions. Second operand 10 states. [2019-11-22 11:01:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:24,745 INFO L93 Difference]: Finished difference Result 16565 states and 59274 transitions. [2019-11-22 11:01:24,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 11:01:24,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 11:01:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:24,773 INFO L225 Difference]: With dead ends: 16565 [2019-11-22 11:01:24,773 INFO L226 Difference]: Without dead ends: 13655 [2019-11-22 11:01:24,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-22 11:01:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13655 states. [2019-11-22 11:01:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13655 to 9375. [2019-11-22 11:01:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9375 states. [2019-11-22 11:01:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9375 states to 9375 states and 34645 transitions. [2019-11-22 11:01:24,990 INFO L78 Accepts]: Start accepts. Automaton has 9375 states and 34645 transitions. Word has length 52 [2019-11-22 11:01:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:24,991 INFO L462 AbstractCegarLoop]: Abstraction has 9375 states and 34645 transitions. [2019-11-22 11:01:24,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:01:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 9375 states and 34645 transitions. [2019-11-22 11:01:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 11:01:25,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:25,000 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:25,000 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:25,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:25,000 INFO L82 PathProgramCache]: Analyzing trace with hash 844196999, now seen corresponding path program 2 times [2019-11-22 11:01:25,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:25,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633584253] [2019-11-22 11:01:25,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 11:01:25,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633584253] [2019-11-22 11:01:25,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:25,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:01:25,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345240279] [2019-11-22 11:01:25,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:01:25,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:01:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:01:25,126 INFO L87 Difference]: Start difference. First operand 9375 states and 34645 transitions. Second operand 10 states. [2019-11-22 11:01:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:25,571 INFO L93 Difference]: Finished difference Result 14255 states and 50473 transitions. [2019-11-22 11:01:25,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 11:01:25,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 11:01:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:25,592 INFO L225 Difference]: With dead ends: 14255 [2019-11-22 11:01:25,592 INFO L226 Difference]: Without dead ends: 11219 [2019-11-22 11:01:25,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-22 11:01:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11219 states. [2019-11-22 11:01:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11219 to 7203. [2019-11-22 11:01:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7203 states. [2019-11-22 11:01:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7203 states to 7203 states and 26359 transitions. [2019-11-22 11:01:25,740 INFO L78 Accepts]: Start accepts. Automaton has 7203 states and 26359 transitions. Word has length 52 [2019-11-22 11:01:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:25,741 INFO L462 AbstractCegarLoop]: Abstraction has 7203 states and 26359 transitions. [2019-11-22 11:01:25,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:01:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 7203 states and 26359 transitions. [2019-11-22 11:01:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 11:01:25,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:25,751 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:25,751 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:25,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:25,752 INFO L82 PathProgramCache]: Analyzing trace with hash 407355179, now seen corresponding path program 1 times [2019-11-22 11:01:25,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:25,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791651501] [2019-11-22 11:01:25,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 11:01:25,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791651501] [2019-11-22 11:01:25,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608817547] [2019-11-22 11:01:25,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:25,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 11:01:25,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:01:26,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 11:01:26,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:01:26,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 11:01:26,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039590530] [2019-11-22 11:01:26,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 11:01:26,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:26,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 11:01:26,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-22 11:01:26,141 INFO L87 Difference]: Start difference. First operand 7203 states and 26359 transitions. Second operand 22 states. [2019-11-22 11:01:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:27,080 INFO L93 Difference]: Finished difference Result 11819 states and 41675 transitions. [2019-11-22 11:01:27,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-22 11:01:27,081 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-22 11:01:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:27,100 INFO L225 Difference]: With dead ends: 11819 [2019-11-22 11:01:27,100 INFO L226 Difference]: Without dead ends: 10559 [2019-11-22 11:01:27,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-22 11:01:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-11-22 11:01:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 7023. [2019-11-22 11:01:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2019-11-22 11:01:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 25531 transitions. [2019-11-22 11:01:27,241 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 25531 transitions. Word has length 56 [2019-11-22 11:01:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:27,241 INFO L462 AbstractCegarLoop]: Abstraction has 7023 states and 25531 transitions. [2019-11-22 11:01:27,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 11:01:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 25531 transitions. [2019-11-22 11:01:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 11:01:27,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:27,251 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:27,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:27,452 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:27,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:27,453 INFO L82 PathProgramCache]: Analyzing trace with hash 455911305, now seen corresponding path program 2 times [2019-11-22 11:01:27,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:27,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047590068] [2019-11-22 11:01:27,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 11:01:27,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047590068] [2019-11-22 11:01:27,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694414466] [2019-11-22 11:01:27,573 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:27,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-22 11:01:27,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-22 11:01:27,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 11:01:27,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:01:27,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 11:01:27,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:01:27,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 11:01:27,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179978639] [2019-11-22 11:01:27,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 11:01:27,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:27,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 11:01:27,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-22 11:01:27,831 INFO L87 Difference]: Start difference. First operand 7023 states and 25531 transitions. Second operand 22 states. [2019-11-22 11:01:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:28,628 INFO L93 Difference]: Finished difference Result 10319 states and 36435 transitions. [2019-11-22 11:01:28,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 11:01:28,629 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-22 11:01:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:28,646 INFO L225 Difference]: With dead ends: 10319 [2019-11-22 11:01:28,646 INFO L226 Difference]: Without dead ends: 7997 [2019-11-22 11:01:28,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-11-22 11:01:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7997 states. [2019-11-22 11:01:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7997 to 5837. [2019-11-22 11:01:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-11-22 11:01:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 21036 transitions. [2019-11-22 11:01:28,836 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 21036 transitions. Word has length 56 [2019-11-22 11:01:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:28,836 INFO L462 AbstractCegarLoop]: Abstraction has 5837 states and 21036 transitions. [2019-11-22 11:01:28,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 11:01:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 21036 transitions. [2019-11-22 11:01:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 11:01:28,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:28,844 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:29,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:29,045 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:29,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:29,046 INFO L82 PathProgramCache]: Analyzing trace with hash 663240811, now seen corresponding path program 3 times [2019-11-22 11:01:29,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:29,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245593588] [2019-11-22 11:01:29,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 11:01:29,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245593588] [2019-11-22 11:01:29,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:29,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 11:01:29,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052355598] [2019-11-22 11:01:29,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:01:29,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:29,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:01:29,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:01:29,172 INFO L87 Difference]: Start difference. First operand 5837 states and 21036 transitions. Second operand 12 states. [2019-11-22 11:01:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:29,574 INFO L93 Difference]: Finished difference Result 7757 states and 27388 transitions. [2019-11-22 11:01:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 11:01:29,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 11:01:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:29,586 INFO L225 Difference]: With dead ends: 7757 [2019-11-22 11:01:29,587 INFO L226 Difference]: Without dead ends: 6497 [2019-11-22 11:01:29,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-11-22 11:01:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6497 states. [2019-11-22 11:01:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6497 to 5177. [2019-11-22 11:01:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2019-11-22 11:01:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 18560 transitions. [2019-11-22 11:01:29,683 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 18560 transitions. Word has length 56 [2019-11-22 11:01:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:29,684 INFO L462 AbstractCegarLoop]: Abstraction has 5177 states and 18560 transitions. [2019-11-22 11:01:29,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:01:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 18560 transitions. [2019-11-22 11:01:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 11:01:29,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:29,691 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:29,692 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash 641585993, now seen corresponding path program 4 times [2019-11-22 11:01:29,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:29,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487135726] [2019-11-22 11:01:29,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 11:01:29,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487135726] [2019-11-22 11:01:29,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:29,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 11:01:29,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644976177] [2019-11-22 11:01:29,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:01:29,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:29,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:01:29,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:01:29,831 INFO L87 Difference]: Start difference. First operand 5177 states and 18560 transitions. Second operand 12 states. [2019-11-22 11:01:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:30,241 INFO L93 Difference]: Finished difference Result 7097 states and 24912 transitions. [2019-11-22 11:01:30,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 11:01:30,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 11:01:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:30,251 INFO L225 Difference]: With dead ends: 7097 [2019-11-22 11:01:30,251 INFO L226 Difference]: Without dead ends: 5027 [2019-11-22 11:01:30,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-11-22 11:01:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2019-11-22 11:01:30,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4187. [2019-11-22 11:01:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-11-22 11:01:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 14681 transitions. [2019-11-22 11:01:30,318 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 14681 transitions. Word has length 56 [2019-11-22 11:01:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:30,318 INFO L462 AbstractCegarLoop]: Abstraction has 4187 states and 14681 transitions. [2019-11-22 11:01:30,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:01:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 14681 transitions. [2019-11-22 11:01:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 11:01:30,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:30,324 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:30,324 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:30,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:30,325 INFO L82 PathProgramCache]: Analyzing trace with hash 59382823, now seen corresponding path program 5 times [2019-11-22 11:01:30,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:30,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135212609] [2019-11-22 11:01:30,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 11:01:30,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135212609] [2019-11-22 11:01:30,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:30,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 11:01:30,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606381798] [2019-11-22 11:01:30,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:01:30,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:30,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:01:30,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:01:30,444 INFO L87 Difference]: Start difference. First operand 4187 states and 14681 transitions. Second operand 12 states. [2019-11-22 11:01:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:30,755 INFO L93 Difference]: Finished difference Result 4787 states and 16621 transitions. [2019-11-22 11:01:30,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 11:01:30,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 11:01:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:30,764 INFO L225 Difference]: With dead ends: 4787 [2019-11-22 11:01:30,764 INFO L226 Difference]: Without dead ends: 3527 [2019-11-22 11:01:30,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-22 11:01:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2019-11-22 11:01:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3527. [2019-11-22 11:01:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3527 states. [2019-11-22 11:01:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 12205 transitions. [2019-11-22 11:01:30,849 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 12205 transitions. Word has length 56 [2019-11-22 11:01:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:30,849 INFO L462 AbstractCegarLoop]: Abstraction has 3527 states and 12205 transitions. [2019-11-22 11:01:30,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:01:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 12205 transitions. [2019-11-22 11:01:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 11:01:30,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:30,858 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-22 11:01:30,858 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 11:01:30,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:30,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1277217831, now seen corresponding path program 6 times [2019-11-22 11:01:30,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:30,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372433131] [2019-11-22 11:01:30,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 11:01:30,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372433131] [2019-11-22 11:01:30,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:30,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 11:01:30,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012368696] [2019-11-22 11:01:30,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:01:30,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:01:30,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:01:30,993 INFO L87 Difference]: Start difference. First operand 3527 states and 12205 transitions. Second operand 12 states. [2019-11-22 11:01:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:31,281 INFO L93 Difference]: Finished difference Result 3287 states and 11381 transitions. [2019-11-22 11:01:31,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:01:31,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 11:01:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:31,282 INFO L225 Difference]: With dead ends: 3287 [2019-11-22 11:01:31,282 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 11:01:31,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-22 11:01:31,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 11:01:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 11:01:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 11:01:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 11:01:31,284 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-22 11:01:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:31,284 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 11:01:31,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:01:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 11:01:31,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 11:01:31,288 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-22 11:01:31,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:01:31 BasicIcfg [2019-11-22 11:01:31,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 11:01:31,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 11:01:31,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 11:01:31,293 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 11:01:31,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:04" (3/4) ... [2019-11-22 11:01:31,299 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 11:01:31,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-22 11:01:31,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-22 11:01:31,313 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-22 11:01:31,313 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 11:01:31,314 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-22 11:01:31,373 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 11:01:31,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 11:01:31,376 INFO L168 Benchmark]: Toolchain (without parser) took 27810.54 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 963.1 MB in the beginning and 1.9 GB in the end (delta: -906.9 MB). Peak memory consumption was 900.4 MB. Max. memory is 11.5 GB. [2019-11-22 11:01:31,377 INFO L168 Benchmark]: CDTParser took 0.31 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-22 11:01:31,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-22 11:01:31,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:01:31,383 INFO L168 Benchmark]: Boogie Preprocessor took 27.97 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-22 11:01:31,384 INFO L168 Benchmark]: RCFGBuilder took 435.30 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:01:31,384 INFO L168 Benchmark]: TraceAbstraction took 26411.44 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -787.0 MB). Peak memory consumption was 874.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:01:31,385 INFO L168 Benchmark]: Witness Printer took 82.55 ms. Allocated memory is still 2.8 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-22 11:01:31,388 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.31 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 783.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.97 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 435.30 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26411.44 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -787.0 MB). Peak memory consumption was 874.5 MB. Max. memory is 11.5 GB. * Witness Printer took 82.55 ms. Allocated memory is still 2.8 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 96 locations, 4 error locations. Result: SAFE, OverallTime: 26.2s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2462 SDtfs, 7849 SDslu, 13500 SDs, 0 SdLazy, 3663 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34966occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 86614 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 971 ConstructedInterpolants, 0 QuantifiedInterpolants, 244626 SizeOfPredicates, 36 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 128/194 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 correct! Received shutdown request...