./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/singleton.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4d5612c 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/singleton.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3491af59218a0433b9de95fff59451438a5c03e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-f4d5612 [2019-11-28 12:29:33,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 12:29:33,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 12:29:33,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 12:29:33,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 12:29:33,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 12:29:33,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 12:29:33,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 12:29:33,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 12:29:33,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 12:29:33,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 12:29:33,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 12:29:33,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 12:29:33,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 12:29:33,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 12:29:33,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 12:29:33,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 12:29:33,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 12:29:33,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 12:29:33,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 12:29:33,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 12:29:33,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 12:29:33,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 12:29:33,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 12:29:33,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 12:29:33,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 12:29:33,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 12:29:33,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 12:29:33,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 12:29:33,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 12:29:33,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 12:29:33,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 12:29:33,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 12:29:33,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 12:29:33,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 12:29:33,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 12:29:33,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 12:29:33,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 12:29:33,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 12:29:33,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 12:29:33,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 12:29:33,470 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 12:29:33,485 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 12:29:33,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 12:29:33,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 12:29:33,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 12:29:33,487 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 12:29:33,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 12:29:33,488 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 12:29:33,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 12:29:33,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 12:29:33,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 12:29:33,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 12:29:33,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 12:29:33,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 12:29:33,490 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 12:29:33,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 12:29:33,491 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 12:29:33,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 12:29:33,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 12:29:33,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 12:29:33,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 12:29:33,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 12:29:33,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 12:29:33,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 12:29:33,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 12:29:33,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 12:29:33,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 12:29:33,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 12:29:33,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 12:29:33,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3491af59218a0433b9de95fff59451438a5c03e [2019-11-28 12:29:33,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 12:29:33,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 12:29:33,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 12:29:33,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 12:29:33,812 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 12:29:33,813 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2019-11-28 12:29:33,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca4d13dc/ab7908a9ef56481fa641f8c7a469b6e7/FLAG0834fff49 [2019-11-28 12:29:34,448 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 12:29:34,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2019-11-28 12:29:34,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca4d13dc/ab7908a9ef56481fa641f8c7a469b6e7/FLAG0834fff49 [2019-11-28 12:29:34,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca4d13dc/ab7908a9ef56481fa641f8c7a469b6e7 [2019-11-28 12:29:34,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 12:29:34,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 12:29:34,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 12:29:34,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 12:29:34,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 12:29:34,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:29:34" (1/1) ... [2019-11-28 12:29:34,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a23882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:34, skipping insertion in model container [2019-11-28 12:29:34,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:29:34" (1/1) ... [2019-11-28 12:29:34,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 12:29:34,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 12:29:35,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:29:35,375 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 12:29:35,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:29:35,654 INFO L208 MainTranslator]: Completed translation [2019-11-28 12:29:35,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35 WrapperNode [2019-11-28 12:29:35,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 12:29:35,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 12:29:35,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 12:29:35,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 12:29:35,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (1/1) ... [2019-11-28 12:29:35,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (1/1) ... [2019-11-28 12:29:35,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 12:29:35,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 12:29:35,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 12:29:35,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 12:29:35,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (1/1) ... [2019-11-28 12:29:35,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (1/1) ... [2019-11-28 12:29:35,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (1/1) ... [2019-11-28 12:29:35,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (1/1) ... [2019-11-28 12:29:35,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (1/1) ... [2019-11-28 12:29:35,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (1/1) ... [2019-11-28 12:29:35,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (1/1) ... [2019-11-28 12:29:35,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 12:29:35,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 12:29:35,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 12:29:35,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 12:29:35,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 12:29:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 12:29:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 12:29:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 12:29:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-11-28 12:29:35,841 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-11-28 12:29:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-11-28 12:29:35,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-11-28 12:29:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-11-28 12:29:35,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-11-28 12:29:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-11-28 12:29:35,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-11-28 12:29:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 12:29:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 12:29:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 12:29:35,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 12:29:35,846 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 12:29:36,322 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 12:29:36,323 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 12:29:36,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:29:36 BoogieIcfgContainer [2019-11-28 12:29:36,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 12:29:36,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 12:29:36,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 12:29:36,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 12:29:36,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:29:34" (1/3) ... [2019-11-28 12:29:36,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53766e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:29:36, skipping insertion in model container [2019-11-28 12:29:36,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:29:35" (2/3) ... [2019-11-28 12:29:36,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53766e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:29:36, skipping insertion in model container [2019-11-28 12:29:36,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:29:36" (3/3) ... [2019-11-28 12:29:36,333 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2019-11-28 12:29:36,343 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 12:29:36,343 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 12:29:36,351 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 12:29:36,352 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 12:29:36,390 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,390 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,391 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,391 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,391 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,392 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,392 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,392 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,393 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,393 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,393 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,394 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,394 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,394 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,395 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,395 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,395 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,395 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,396 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,396 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,397 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,397 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,397 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,397 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,398 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,398 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,398 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,398 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,399 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,399 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,399 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,399 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,400 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,400 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,400 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,400 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,401 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,401 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,401 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,401 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,402 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,402 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,402 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,402 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,403 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,403 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,403 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,403 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,404 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,404 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,404 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,404 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,405 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,405 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,405 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,405 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,406 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,406 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,406 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,406 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,407 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,407 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,407 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,407 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,408 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,408 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,408 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,408 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,409 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,409 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,409 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,409 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,410 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,410 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,410 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,410 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,411 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,411 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,411 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,411 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,412 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,412 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,412 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,413 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,413 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,413 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,413 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,414 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,414 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,414 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,414 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,415 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,415 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,415 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,416 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,416 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,416 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,416 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,417 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,417 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 12:29:36,646 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-11-28 12:29:36,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 12:29:36,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 12:29:36,668 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 12:29:36,668 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 12:29:36,668 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 12:29:36,668 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 12:29:36,668 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 12:29:36,669 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 12:29:36,688 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions [2019-11-28 12:29:36,690 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-11-28 12:29:36,825 INFO L134 PetriNetUnfolder]: 61/264 cut-off events. [2019-11-28 12:29:36,825 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 12:29:36,846 INFO L76 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1229 event pairs. 227/441 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2019-11-28 12:29:36,866 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-11-28 12:29:36,974 INFO L134 PetriNetUnfolder]: 61/264 cut-off events. [2019-11-28 12:29:36,975 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 12:29:36,980 INFO L76 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1229 event pairs. 227/441 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2019-11-28 12:29:36,994 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2019-11-28 12:29:36,995 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 12:29:38,226 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-28 12:29:38,714 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 12:29:39,121 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2019-11-28 12:29:39,121 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2019-11-28 12:29:39,125 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 173 transitions [2019-11-28 12:29:39,770 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2019-11-28 12:29:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2019-11-28 12:29:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 12:29:39,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:39,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:39,787 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:39,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1385407457, now seen corresponding path program 1 times [2019-11-28 12:29:39,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:39,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944772123] [2019-11-28 12:29:39,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:40,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944772123] [2019-11-28 12:29:40,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:40,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 12:29:40,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647870966] [2019-11-28 12:29:40,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 12:29:40,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:40,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 12:29:40,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 12:29:40,337 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2019-11-28 12:29:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:40,853 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2019-11-28 12:29:40,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 12:29:40,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-28 12:29:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:40,923 INFO L225 Difference]: With dead ends: 4760 [2019-11-28 12:29:40,924 INFO L226 Difference]: Without dead ends: 4272 [2019-11-28 12:29:40,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:29:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2019-11-28 12:29:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2019-11-28 12:29:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-11-28 12:29:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2019-11-28 12:29:41,183 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2019-11-28 12:29:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:41,184 INFO L462 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2019-11-28 12:29:41,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 12:29:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2019-11-28 12:29:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 12:29:41,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:41,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:41,186 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:41,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1192062693, now seen corresponding path program 2 times [2019-11-28 12:29:41,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:41,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921108384] [2019-11-28 12:29:41,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:41,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921108384] [2019-11-28 12:29:41,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:41,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 12:29:41,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504143995] [2019-11-28 12:29:41,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 12:29:41,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:41,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 12:29:41,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 12:29:41,298 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2019-11-28 12:29:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:41,762 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2019-11-28 12:29:41,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:29:41,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-28 12:29:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:41,816 INFO L225 Difference]: With dead ends: 5518 [2019-11-28 12:29:41,816 INFO L226 Difference]: Without dead ends: 5518 [2019-11-28 12:29:41,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 12:29:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2019-11-28 12:29:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2019-11-28 12:29:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2019-11-28 12:29:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2019-11-28 12:29:41,967 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2019-11-28 12:29:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:41,967 INFO L462 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2019-11-28 12:29:41,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 12:29:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2019-11-28 12:29:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 12:29:41,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:41,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:41,970 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1538202320, now seen corresponding path program 1 times [2019-11-28 12:29:41,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:41,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488768096] [2019-11-28 12:29:41,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:42,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488768096] [2019-11-28 12:29:42,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:42,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 12:29:42,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29391203] [2019-11-28 12:29:42,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 12:29:42,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:42,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 12:29:42,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 12:29:42,047 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2019-11-28 12:29:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:42,134 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2019-11-28 12:29:42,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 12:29:42,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 12:29:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:42,163 INFO L225 Difference]: With dead ends: 4848 [2019-11-28 12:29:42,163 INFO L226 Difference]: Without dead ends: 3558 [2019-11-28 12:29:42,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 12:29:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-11-28 12:29:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2019-11-28 12:29:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-11-28 12:29:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2019-11-28 12:29:42,272 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2019-11-28 12:29:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:42,273 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2019-11-28 12:29:42,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 12:29:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2019-11-28 12:29:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 12:29:42,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:42,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:42,275 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:42,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash 439630726, now seen corresponding path program 1 times [2019-11-28 12:29:42,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:42,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769668275] [2019-11-28 12:29:42,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:42,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769668275] [2019-11-28 12:29:42,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:42,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 12:29:42,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9713474] [2019-11-28 12:29:42,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 12:29:42,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 12:29:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:29:42,366 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 7 states. [2019-11-28 12:29:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:42,642 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2019-11-28 12:29:42,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:29:42,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-28 12:29:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:42,662 INFO L225 Difference]: With dead ends: 4417 [2019-11-28 12:29:42,662 INFO L226 Difference]: Without dead ends: 4393 [2019-11-28 12:29:42,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:29:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-11-28 12:29:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2019-11-28 12:29:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-11-28 12:29:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2019-11-28 12:29:42,782 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2019-11-28 12:29:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:42,783 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2019-11-28 12:29:42,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 12:29:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2019-11-28 12:29:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 12:29:42,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:42,785 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:42,785 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:42,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1784829996, now seen corresponding path program 2 times [2019-11-28 12:29:42,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:42,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780430726] [2019-11-28 12:29:42,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:42,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780430726] [2019-11-28 12:29:42,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:42,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 12:29:42,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116495406] [2019-11-28 12:29:42,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 12:29:42,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:42,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 12:29:42,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 12:29:42,876 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2019-11-28 12:29:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:43,000 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2019-11-28 12:29:43,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:29:43,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-28 12:29:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:43,017 INFO L225 Difference]: With dead ends: 4024 [2019-11-28 12:29:43,017 INFO L226 Difference]: Without dead ends: 4024 [2019-11-28 12:29:43,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:29:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2019-11-28 12:29:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2019-11-28 12:29:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2019-11-28 12:29:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2019-11-28 12:29:43,133 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2019-11-28 12:29:43,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:43,134 INFO L462 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2019-11-28 12:29:43,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 12:29:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2019-11-28 12:29:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 12:29:43,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:43,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:43,136 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:43,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:43,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2096337026, now seen corresponding path program 1 times [2019-11-28 12:29:43,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:43,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700903051] [2019-11-28 12:29:43,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:43,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700903051] [2019-11-28 12:29:43,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:43,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 12:29:43,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531135885] [2019-11-28 12:29:43,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 12:29:43,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:43,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 12:29:43,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:29:43,203 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 7 states. [2019-11-28 12:29:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:43,404 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2019-11-28 12:29:43,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:29:43,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 12:29:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:43,424 INFO L225 Difference]: With dead ends: 4225 [2019-11-28 12:29:43,425 INFO L226 Difference]: Without dead ends: 4129 [2019-11-28 12:29:43,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:29:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2019-11-28 12:29:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2019-11-28 12:29:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2019-11-28 12:29:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2019-11-28 12:29:43,656 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2019-11-28 12:29:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:43,656 INFO L462 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2019-11-28 12:29:43,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 12:29:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2019-11-28 12:29:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 12:29:43,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:43,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:43,659 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:43,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1440753652, now seen corresponding path program 2 times [2019-11-28 12:29:43,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:43,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633227296] [2019-11-28 12:29:43,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:43,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633227296] [2019-11-28 12:29:43,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:43,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 12:29:43,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226228719] [2019-11-28 12:29:43,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 12:29:43,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:43,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 12:29:43,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:29:43,825 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2019-11-28 12:29:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:44,302 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2019-11-28 12:29:44,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 12:29:44,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-28 12:29:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:44,321 INFO L225 Difference]: With dead ends: 4979 [2019-11-28 12:29:44,322 INFO L226 Difference]: Without dead ends: 4905 [2019-11-28 12:29:44,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-28 12:29:44,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-11-28 12:29:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2019-11-28 12:29:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2019-11-28 12:29:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2019-11-28 12:29:44,456 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2019-11-28 12:29:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:44,457 INFO L462 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2019-11-28 12:29:44,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 12:29:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2019-11-28 12:29:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 12:29:44,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:44,459 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:44,460 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:44,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:44,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2054209068, now seen corresponding path program 3 times [2019-11-28 12:29:44,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:44,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760345722] [2019-11-28 12:29:44,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:44,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760345722] [2019-11-28 12:29:44,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:44,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 12:29:44,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720777248] [2019-11-28 12:29:44,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 12:29:44,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:44,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 12:29:44,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-28 12:29:44,581 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2019-11-28 12:29:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:44,960 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2019-11-28 12:29:44,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 12:29:44,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-28 12:29:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:44,981 INFO L225 Difference]: With dead ends: 6735 [2019-11-28 12:29:44,982 INFO L226 Difference]: Without dead ends: 6661 [2019-11-28 12:29:44,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-28 12:29:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2019-11-28 12:29:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2019-11-28 12:29:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2019-11-28 12:29:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2019-11-28 12:29:45,124 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2019-11-28 12:29:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:45,125 INFO L462 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2019-11-28 12:29:45,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 12:29:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2019-11-28 12:29:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 12:29:45,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:45,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:45,127 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:45,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:45,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1150446370, now seen corresponding path program 4 times [2019-11-28 12:29:45,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:45,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719265953] [2019-11-28 12:29:45,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:45,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719265953] [2019-11-28 12:29:45,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:45,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 12:29:45,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747311548] [2019-11-28 12:29:45,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 12:29:45,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:45,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 12:29:45,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:29:45,396 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 11 states. [2019-11-28 12:29:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:46,341 INFO L93 Difference]: Finished difference Result 5384 states and 21910 transitions. [2019-11-28 12:29:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 12:29:46,343 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-28 12:29:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:46,359 INFO L225 Difference]: With dead ends: 5384 [2019-11-28 12:29:46,360 INFO L226 Difference]: Without dead ends: 5310 [2019-11-28 12:29:46,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-11-28 12:29:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2019-11-28 12:29:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 4116. [2019-11-28 12:29:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2019-11-28 12:29:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2019-11-28 12:29:46,552 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2019-11-28 12:29:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:46,555 INFO L462 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2019-11-28 12:29:46,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 12:29:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2019-11-28 12:29:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 12:29:46,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:46,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:46,558 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:46,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1529508729, now seen corresponding path program 1 times [2019-11-28 12:29:46,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:46,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463288561] [2019-11-28 12:29:46,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:46,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463288561] [2019-11-28 12:29:46,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:46,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 12:29:46,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665780866] [2019-11-28 12:29:46,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 12:29:46,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:46,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 12:29:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:29:46,717 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 7 states. [2019-11-28 12:29:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:46,849 INFO L93 Difference]: Finished difference Result 4625 states and 18119 transitions. [2019-11-28 12:29:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:29:46,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 12:29:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:46,864 INFO L225 Difference]: With dead ends: 4625 [2019-11-28 12:29:46,865 INFO L226 Difference]: Without dead ends: 4625 [2019-11-28 12:29:46,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 12:29:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2019-11-28 12:29:46,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4078. [2019-11-28 12:29:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2019-11-28 12:29:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2019-11-28 12:29:46,973 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2019-11-28 12:29:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:46,974 INFO L462 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2019-11-28 12:29:46,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 12:29:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2019-11-28 12:29:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 12:29:46,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:46,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:29:46,977 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:46,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:46,977 INFO L82 PathProgramCache]: Analyzing trace with hash 386755117, now seen corresponding path program 1 times [2019-11-28 12:29:46,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:46,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590054511] [2019-11-28 12:29:46,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:47,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590054511] [2019-11-28 12:29:47,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:47,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 12:29:47,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341361640] [2019-11-28 12:29:47,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:29:47,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:47,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:29:47,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:29:47,244 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 12 states. [2019-11-28 12:29:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:48,295 INFO L93 Difference]: Finished difference Result 5865 states and 24362 transitions. [2019-11-28 12:29:48,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 12:29:48,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-28 12:29:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:48,313 INFO L225 Difference]: With dead ends: 5865 [2019-11-28 12:29:48,313 INFO L226 Difference]: Without dead ends: 5791 [2019-11-28 12:29:48,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-11-28 12:29:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2019-11-28 12:29:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 4021. [2019-11-28 12:29:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2019-11-28 12:29:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2019-11-28 12:29:48,436 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2019-11-28 12:29:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:48,436 INFO L462 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2019-11-28 12:29:48,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:29:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2019-11-28 12:29:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 12:29:48,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:48,439 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] [2019-11-28 12:29:48,439 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:48,440 INFO L82 PathProgramCache]: Analyzing trace with hash 169969073, now seen corresponding path program 1 times [2019-11-28 12:29:48,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:48,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241375769] [2019-11-28 12:29:48,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:48,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241375769] [2019-11-28 12:29:48,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:48,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 12:29:48,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266184966] [2019-11-28 12:29:48,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:29:48,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:29:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:29:48,622 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 10 states. [2019-11-28 12:29:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:49,178 INFO L93 Difference]: Finished difference Result 5436 states and 21881 transitions. [2019-11-28 12:29:49,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:29:49,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 12:29:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:49,191 INFO L225 Difference]: With dead ends: 5436 [2019-11-28 12:29:49,192 INFO L226 Difference]: Without dead ends: 5390 [2019-11-28 12:29:49,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 12:29:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5390 states. [2019-11-28 12:29:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5390 to 4174. [2019-11-28 12:29:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-11-28 12:29:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 16952 transitions. [2019-11-28 12:29:49,321 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 16952 transitions. Word has length 20 [2019-11-28 12:29:49,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:49,321 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 16952 transitions. [2019-11-28 12:29:49,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:29:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 16952 transitions. [2019-11-28 12:29:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 12:29:49,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:49,325 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] [2019-11-28 12:29:49,325 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:49,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1932078158, now seen corresponding path program 1 times [2019-11-28 12:29:49,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:49,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328444870] [2019-11-28 12:29:49,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:49,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328444870] [2019-11-28 12:29:49,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:49,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 12:29:49,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718143720] [2019-11-28 12:29:49,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:29:49,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:49,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:29:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:29:49,566 INFO L87 Difference]: Start difference. First operand 4174 states and 16952 transitions. Second operand 10 states. [2019-11-28 12:29:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:50,130 INFO L93 Difference]: Finished difference Result 5508 states and 22462 transitions. [2019-11-28 12:29:50,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:29:50,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 12:29:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:50,143 INFO L225 Difference]: With dead ends: 5508 [2019-11-28 12:29:50,143 INFO L226 Difference]: Without dead ends: 5462 [2019-11-28 12:29:50,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-11-28 12:29:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2019-11-28 12:29:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 4020. [2019-11-28 12:29:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2019-11-28 12:29:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16223 transitions. [2019-11-28 12:29:50,260 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16223 transitions. Word has length 20 [2019-11-28 12:29:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:50,260 INFO L462 AbstractCegarLoop]: Abstraction has 4020 states and 16223 transitions. [2019-11-28 12:29:50,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:29:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16223 transitions. [2019-11-28 12:29:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 12:29:50,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:50,263 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] [2019-11-28 12:29:50,263 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash -944906415, now seen corresponding path program 2 times [2019-11-28 12:29:50,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:50,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427948371] [2019-11-28 12:29:50,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:50,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427948371] [2019-11-28 12:29:50,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:50,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 12:29:50,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095289085] [2019-11-28 12:29:50,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:29:50,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:50,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:29:50,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:29:50,475 INFO L87 Difference]: Start difference. First operand 4020 states and 16223 transitions. Second operand 10 states. [2019-11-28 12:29:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:51,456 INFO L93 Difference]: Finished difference Result 5427 states and 21857 transitions. [2019-11-28 12:29:51,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 12:29:51,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 12:29:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:51,470 INFO L225 Difference]: With dead ends: 5427 [2019-11-28 12:29:51,470 INFO L226 Difference]: Without dead ends: 5381 [2019-11-28 12:29:51,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-28 12:29:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-11-28 12:29:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4169. [2019-11-28 12:29:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4169 states. [2019-11-28 12:29:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 16935 transitions. [2019-11-28 12:29:51,578 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 16935 transitions. Word has length 20 [2019-11-28 12:29:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:51,578 INFO L462 AbstractCegarLoop]: Abstraction has 4169 states and 16935 transitions. [2019-11-28 12:29:51,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:29:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 16935 transitions. [2019-11-28 12:29:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 12:29:51,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:51,585 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] [2019-11-28 12:29:51,585 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:51,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1562884562, now seen corresponding path program 2 times [2019-11-28 12:29:51,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:51,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005962405] [2019-11-28 12:29:51,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:51,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005962405] [2019-11-28 12:29:51,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:51,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 12:29:51,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178078526] [2019-11-28 12:29:51,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:29:51,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:51,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:29:51,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:29:51,724 INFO L87 Difference]: Start difference. First operand 4169 states and 16935 transitions. Second operand 10 states. [2019-11-28 12:29:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:52,353 INFO L93 Difference]: Finished difference Result 6798 states and 27735 transitions. [2019-11-28 12:29:52,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 12:29:52,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 12:29:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:52,369 INFO L225 Difference]: With dead ends: 6798 [2019-11-28 12:29:52,369 INFO L226 Difference]: Without dead ends: 6752 [2019-11-28 12:29:52,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-11-28 12:29:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2019-11-28 12:29:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 4168. [2019-11-28 12:29:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-11-28 12:29:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 16934 transitions. [2019-11-28 12:29:52,483 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 16934 transitions. Word has length 20 [2019-11-28 12:29:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:52,484 INFO L462 AbstractCegarLoop]: Abstraction has 4168 states and 16934 transitions. [2019-11-28 12:29:52,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:29:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 16934 transitions. [2019-11-28 12:29:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 12:29:52,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:52,486 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] [2019-11-28 12:29:52,486 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:52,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:52,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1659645476, now seen corresponding path program 3 times [2019-11-28 12:29:52,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:52,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311595664] [2019-11-28 12:29:52,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:52,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311595664] [2019-11-28 12:29:52,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:52,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 12:29:52,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804264125] [2019-11-28 12:29:52,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:29:52,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:52,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:29:52,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:29:52,647 INFO L87 Difference]: Start difference. First operand 4168 states and 16934 transitions. Second operand 10 states. [2019-11-28 12:29:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:53,138 INFO L93 Difference]: Finished difference Result 5273 states and 21186 transitions. [2019-11-28 12:29:53,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:29:53,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 12:29:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:53,151 INFO L225 Difference]: With dead ends: 5273 [2019-11-28 12:29:53,151 INFO L226 Difference]: Without dead ends: 5227 [2019-11-28 12:29:53,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-28 12:29:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5227 states. [2019-11-28 12:29:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5227 to 4013. [2019-11-28 12:29:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2019-11-28 12:29:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16202 transitions. [2019-11-28 12:29:53,329 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16202 transitions. Word has length 20 [2019-11-28 12:29:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:53,329 INFO L462 AbstractCegarLoop]: Abstraction has 4013 states and 16202 transitions. [2019-11-28 12:29:53,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:29:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16202 transitions. [2019-11-28 12:29:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 12:29:53,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:53,331 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] [2019-11-28 12:29:53,332 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1961766501, now seen corresponding path program 3 times [2019-11-28 12:29:53,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:53,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358118423] [2019-11-28 12:29:53,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:53,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358118423] [2019-11-28 12:29:53,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:53,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 12:29:53,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918767596] [2019-11-28 12:29:53,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 12:29:53,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:53,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 12:29:53,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:29:53,442 INFO L87 Difference]: Start difference. First operand 4013 states and 16202 transitions. Second operand 8 states. [2019-11-28 12:29:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:53,769 INFO L93 Difference]: Finished difference Result 6360 states and 25585 transitions. [2019-11-28 12:29:53,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 12:29:53,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-11-28 12:29:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:53,788 INFO L225 Difference]: With dead ends: 6360 [2019-11-28 12:29:53,789 INFO L226 Difference]: Without dead ends: 6314 [2019-11-28 12:29:53,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-28 12:29:53,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2019-11-28 12:29:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 3983. [2019-11-28 12:29:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2019-11-28 12:29:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2019-11-28 12:29:53,880 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2019-11-28 12:29:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:53,880 INFO L462 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2019-11-28 12:29:53,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 12:29:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2019-11-28 12:29:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 12:29:53,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:53,883 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] [2019-11-28 12:29:53,883 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:53,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:53,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2117723117, now seen corresponding path program 1 times [2019-11-28 12:29:53,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:53,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616870149] [2019-11-28 12:29:53,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:53,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616870149] [2019-11-28 12:29:53,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:53,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 12:29:53,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019998968] [2019-11-28 12:29:53,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 12:29:53,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:53,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 12:29:53,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:29:53,976 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 7 states. [2019-11-28 12:29:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:54,199 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2019-11-28 12:29:54,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:29:54,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 12:29:54,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:54,211 INFO L225 Difference]: With dead ends: 4762 [2019-11-28 12:29:54,211 INFO L226 Difference]: Without dead ends: 4687 [2019-11-28 12:29:54,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:29:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2019-11-28 12:29:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2019-11-28 12:29:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2019-11-28 12:29:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2019-11-28 12:29:54,283 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2019-11-28 12:29:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:54,283 INFO L462 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2019-11-28 12:29:54,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 12:29:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2019-11-28 12:29:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 12:29:54,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:54,286 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] [2019-11-28 12:29:54,286 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1335103446, now seen corresponding path program 1 times [2019-11-28 12:29:54,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:54,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017964781] [2019-11-28 12:29:54,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:54,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017964781] [2019-11-28 12:29:54,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:54,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 12:29:54,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915385761] [2019-11-28 12:29:54,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 12:29:54,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:54,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 12:29:54,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:29:54,417 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 8 states. [2019-11-28 12:29:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:54,551 INFO L93 Difference]: Finished difference Result 4856 states and 18991 transitions. [2019-11-28 12:29:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:29:54,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 12:29:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:54,562 INFO L225 Difference]: With dead ends: 4856 [2019-11-28 12:29:54,562 INFO L226 Difference]: Without dead ends: 4329 [2019-11-28 12:29:54,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:29:54,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2019-11-28 12:29:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 3712. [2019-11-28 12:29:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3712 states. [2019-11-28 12:29:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 14646 transitions. [2019-11-28 12:29:54,620 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 14646 transitions. Word has length 21 [2019-11-28 12:29:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:54,620 INFO L462 AbstractCegarLoop]: Abstraction has 3712 states and 14646 transitions. [2019-11-28 12:29:54,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 12:29:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 14646 transitions. [2019-11-28 12:29:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 12:29:54,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:54,624 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] [2019-11-28 12:29:54,624 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1959403642, now seen corresponding path program 1 times [2019-11-28 12:29:54,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:54,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999854215] [2019-11-28 12:29:54,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:54,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999854215] [2019-11-28 12:29:54,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:54,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 12:29:54,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891885321] [2019-11-28 12:29:54,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:29:54,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:54,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:29:54,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:29:54,929 INFO L87 Difference]: Start difference. First operand 3712 states and 14646 transitions. Second operand 12 states. [2019-11-28 12:29:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:55,892 INFO L93 Difference]: Finished difference Result 4906 states and 19112 transitions. [2019-11-28 12:29:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 12:29:55,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-28 12:29:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:55,905 INFO L225 Difference]: With dead ends: 4906 [2019-11-28 12:29:55,905 INFO L226 Difference]: Without dead ends: 4857 [2019-11-28 12:29:55,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-28 12:29:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2019-11-28 12:29:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 3488. [2019-11-28 12:29:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-11-28 12:29:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 13508 transitions. [2019-11-28 12:29:55,970 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 13508 transitions. Word has length 21 [2019-11-28 12:29:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:55,970 INFO L462 AbstractCegarLoop]: Abstraction has 3488 states and 13508 transitions. [2019-11-28 12:29:55,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:29:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 13508 transitions. [2019-11-28 12:29:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 12:29:55,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:55,972 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] [2019-11-28 12:29:55,973 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1977277281, now seen corresponding path program 1 times [2019-11-28 12:29:55,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:55,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104205787] [2019-11-28 12:29:55,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:56,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104205787] [2019-11-28 12:29:56,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:56,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 12:29:56,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130956068] [2019-11-28 12:29:56,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 12:29:56,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:56,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 12:29:56,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:29:56,317 INFO L87 Difference]: Start difference. First operand 3488 states and 13508 transitions. Second operand 11 states. [2019-11-28 12:29:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:57,214 INFO L93 Difference]: Finished difference Result 4464 states and 17193 transitions. [2019-11-28 12:29:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 12:29:57,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-28 12:29:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:57,225 INFO L225 Difference]: With dead ends: 4464 [2019-11-28 12:29:57,226 INFO L226 Difference]: Without dead ends: 4415 [2019-11-28 12:29:57,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-11-28 12:29:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2019-11-28 12:29:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 3330. [2019-11-28 12:29:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2019-11-28 12:29:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2019-11-28 12:29:57,302 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2019-11-28 12:29:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:57,303 INFO L462 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2019-11-28 12:29:57,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 12:29:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2019-11-28 12:29:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 12:29:57,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:57,306 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] [2019-11-28 12:29:57,307 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:57,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:57,307 INFO L82 PathProgramCache]: Analyzing trace with hash -430854838, now seen corresponding path program 1 times [2019-11-28 12:29:57,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:57,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306587468] [2019-11-28 12:29:57,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:57,822 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-28 12:29:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:57,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306587468] [2019-11-28 12:29:57,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:57,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 12:29:57,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177845437] [2019-11-28 12:29:57,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:29:57,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:57,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:29:57,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:29:57,846 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 12 states. [2019-11-28 12:29:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:58,738 INFO L93 Difference]: Finished difference Result 3991 states and 15112 transitions. [2019-11-28 12:29:58,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 12:29:58,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-28 12:29:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:58,747 INFO L225 Difference]: With dead ends: 3991 [2019-11-28 12:29:58,748 INFO L226 Difference]: Without dead ends: 3835 [2019-11-28 12:29:58,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-28 12:29:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2019-11-28 12:29:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 2831. [2019-11-28 12:29:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2019-11-28 12:29:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2019-11-28 12:29:58,799 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2019-11-28 12:29:58,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:58,799 INFO L462 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2019-11-28 12:29:58,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:29:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2019-11-28 12:29:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 12:29:58,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:58,802 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] [2019-11-28 12:29:58,802 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash 641940987, now seen corresponding path program 1 times [2019-11-28 12:29:58,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:58,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53695166] [2019-11-28 12:29:58,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:58,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53695166] [2019-11-28 12:29:58,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:58,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 12:29:58,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360768432] [2019-11-28 12:29:58,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 12:29:58,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 12:29:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:29:58,916 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2019-11-28 12:29:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:29:59,318 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2019-11-28 12:29:59,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 12:29:59,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-28 12:29:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:29:59,327 INFO L225 Difference]: With dead ends: 3550 [2019-11-28 12:29:59,327 INFO L226 Difference]: Without dead ends: 3490 [2019-11-28 12:29:59,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-28 12:29:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2019-11-28 12:29:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2019-11-28 12:29:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-11-28 12:29:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2019-11-28 12:29:59,373 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2019-11-28 12:29:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:29:59,373 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2019-11-28 12:29:59,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 12:29:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2019-11-28 12:29:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 12:29:59,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:29:59,376 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] [2019-11-28 12:29:59,376 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:29:59,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:29:59,376 INFO L82 PathProgramCache]: Analyzing trace with hash -109833189, now seen corresponding path program 2 times [2019-11-28 12:29:59,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:29:59,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244565469] [2019-11-28 12:29:59,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:29:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:29:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:29:59,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244565469] [2019-11-28 12:29:59,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:29:59,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 12:29:59,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483244946] [2019-11-28 12:29:59,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 12:29:59,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:29:59,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 12:29:59,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 12:29:59,507 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2019-11-28 12:30:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:00,072 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2019-11-28 12:30:00,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 12:30:00,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 12:30:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:00,081 INFO L225 Difference]: With dead ends: 3862 [2019-11-28 12:30:00,081 INFO L226 Difference]: Without dead ends: 3802 [2019-11-28 12:30:00,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-11-28 12:30:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2019-11-28 12:30:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2019-11-28 12:30:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-11-28 12:30:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-11-28 12:30:00,129 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-11-28 12:30:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:00,129 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-11-28 12:30:00,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 12:30:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-11-28 12:30:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 12:30:00,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:00,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:30:00,133 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1541949331, now seen corresponding path program 3 times [2019-11-28 12:30:00,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:00,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957770432] [2019-11-28 12:30:00,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:00,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957770432] [2019-11-28 12:30:00,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:00,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 12:30:00,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129649425] [2019-11-28 12:30:00,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:30:00,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:30:00,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:30:00,258 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2019-11-28 12:30:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:00,715 INFO L93 Difference]: Finished difference Result 3525 states and 13034 transitions. [2019-11-28 12:30:00,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:30:00,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 12:30:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:00,724 INFO L225 Difference]: With dead ends: 3525 [2019-11-28 12:30:00,724 INFO L226 Difference]: Without dead ends: 3465 [2019-11-28 12:30:00,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-28 12:30:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2019-11-28 12:30:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2822. [2019-11-28 12:30:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-11-28 12:30:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-11-28 12:30:00,768 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-11-28 12:30:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:00,769 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-11-28 12:30:00,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:30:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-11-28 12:30:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 12:30:00,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:00,772 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] [2019-11-28 12:30:00,773 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:00,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1025373391, now seen corresponding path program 4 times [2019-11-28 12:30:00,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:00,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45852027] [2019-11-28 12:30:00,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:01,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45852027] [2019-11-28 12:30:01,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:01,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 12:30:01,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219936433] [2019-11-28 12:30:01,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 12:30:01,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:01,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 12:30:01,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:30:01,058 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2019-11-28 12:30:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:01,544 INFO L93 Difference]: Finished difference Result 3740 states and 13820 transitions. [2019-11-28 12:30:01,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:30:01,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-11-28 12:30:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:01,553 INFO L225 Difference]: With dead ends: 3740 [2019-11-28 12:30:01,553 INFO L226 Difference]: Without dead ends: 3680 [2019-11-28 12:30:01,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-28 12:30:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2019-11-28 12:30:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2822. [2019-11-28 12:30:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-11-28 12:30:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10603 transitions. [2019-11-28 12:30:01,599 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10603 transitions. Word has length 22 [2019-11-28 12:30:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:01,599 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10603 transitions. [2019-11-28 12:30:01,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 12:30:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10603 transitions. [2019-11-28 12:30:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 12:30:01,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:01,602 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] [2019-11-28 12:30:01,602 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:01,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1258119955, now seen corresponding path program 5 times [2019-11-28 12:30:01,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:01,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17505860] [2019-11-28 12:30:01,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:01,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17505860] [2019-11-28 12:30:01,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:01,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 12:30:01,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87098934] [2019-11-28 12:30:01,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:30:01,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:01,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:30:01,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:30:01,745 INFO L87 Difference]: Start difference. First operand 2822 states and 10603 transitions. Second operand 10 states. [2019-11-28 12:30:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:02,144 INFO L93 Difference]: Finished difference Result 4237 states and 15414 transitions. [2019-11-28 12:30:02,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 12:30:02,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 12:30:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:02,154 INFO L225 Difference]: With dead ends: 4237 [2019-11-28 12:30:02,155 INFO L226 Difference]: Without dead ends: 4177 [2019-11-28 12:30:02,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-11-28 12:30:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2019-11-28 12:30:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 2670. [2019-11-28 12:30:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2019-11-28 12:30:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2019-11-28 12:30:02,215 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2019-11-28 12:30:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:02,215 INFO L462 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2019-11-28 12:30:02,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:30:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2019-11-28 12:30:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 12:30:02,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:02,217 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] [2019-11-28 12:30:02,217 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:02,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash -230669277, now seen corresponding path program 1 times [2019-11-28 12:30:02,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:02,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966650945] [2019-11-28 12:30:02,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:02,579 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-28 12:30:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:02,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966650945] [2019-11-28 12:30:02,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:02,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 12:30:02,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563682108] [2019-11-28 12:30:02,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:30:02,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:02,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:30:02,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:30:02,673 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2019-11-28 12:30:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:03,460 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2019-11-28 12:30:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 12:30:03,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-28 12:30:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:03,467 INFO L225 Difference]: With dead ends: 3103 [2019-11-28 12:30:03,467 INFO L226 Difference]: Without dead ends: 3007 [2019-11-28 12:30:03,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-11-28 12:30:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2019-11-28 12:30:03,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2019-11-28 12:30:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-11-28 12:30:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2019-11-28 12:30:03,501 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2019-11-28 12:30:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:03,501 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2019-11-28 12:30:03,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:30:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2019-11-28 12:30:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 12:30:03,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:03,503 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] [2019-11-28 12:30:03,505 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:03,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1022800040, now seen corresponding path program 1 times [2019-11-28 12:30:03,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:03,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573282275] [2019-11-28 12:30:03,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:03,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573282275] [2019-11-28 12:30:03,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:03,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 12:30:03,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713550648] [2019-11-28 12:30:03,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 12:30:03,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:03,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 12:30:03,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:30:03,856 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 11 states. [2019-11-28 12:30:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:04,451 INFO L93 Difference]: Finished difference Result 2812 states and 10003 transitions. [2019-11-28 12:30:04,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 12:30:04,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-28 12:30:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:04,458 INFO L225 Difference]: With dead ends: 2812 [2019-11-28 12:30:04,458 INFO L226 Difference]: Without dead ends: 2755 [2019-11-28 12:30:04,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-28 12:30:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-28 12:30:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2130. [2019-11-28 12:30:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-11-28 12:30:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2019-11-28 12:30:04,492 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2019-11-28 12:30:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:04,492 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2019-11-28 12:30:04,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 12:30:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2019-11-28 12:30:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 12:30:04,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:04,494 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] [2019-11-28 12:30:04,495 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:04,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:04,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1539375980, now seen corresponding path program 2 times [2019-11-28 12:30:04,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:04,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46758454] [2019-11-28 12:30:04,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:04,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46758454] [2019-11-28 12:30:04,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:04,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 12:30:04,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796015534] [2019-11-28 12:30:04,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 12:30:04,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:04,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 12:30:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-28 12:30:04,914 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 13 states. [2019-11-28 12:30:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:05,897 INFO L93 Difference]: Finished difference Result 2895 states and 10221 transitions. [2019-11-28 12:30:05,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 12:30:05,898 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-28 12:30:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:05,904 INFO L225 Difference]: With dead ends: 2895 [2019-11-28 12:30:05,905 INFO L226 Difference]: Without dead ends: 2778 [2019-11-28 12:30:05,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-11-28 12:30:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2019-11-28 12:30:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 1842. [2019-11-28 12:30:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-28 12:30:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 6495 transitions. [2019-11-28 12:30:05,941 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 6495 transitions. Word has length 23 [2019-11-28 12:30:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:05,941 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 6495 transitions. [2019-11-28 12:30:05,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 12:30:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 6495 transitions. [2019-11-28 12:30:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 12:30:05,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:05,944 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] [2019-11-28 12:30:05,945 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:05,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:05,945 INFO L82 PathProgramCache]: Analyzing trace with hash -396779108, now seen corresponding path program 1 times [2019-11-28 12:30:05,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:05,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217558063] [2019-11-28 12:30:05,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:06,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217558063] [2019-11-28 12:30:06,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:06,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 12:30:06,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514248375] [2019-11-28 12:30:06,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 12:30:06,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 12:30:06,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:30:06,021 INFO L87 Difference]: Start difference. First operand 1842 states and 6495 transitions. Second operand 7 states. [2019-11-28 12:30:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:06,262 INFO L93 Difference]: Finished difference Result 2339 states and 7931 transitions. [2019-11-28 12:30:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:30:06,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-28 12:30:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:06,269 INFO L225 Difference]: With dead ends: 2339 [2019-11-28 12:30:06,269 INFO L226 Difference]: Without dead ends: 2275 [2019-11-28 12:30:06,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:30:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2019-11-28 12:30:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2154. [2019-11-28 12:30:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-11-28 12:30:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 7487 transitions. [2019-11-28 12:30:06,306 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 7487 transitions. Word has length 24 [2019-11-28 12:30:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:06,307 INFO L462 AbstractCegarLoop]: Abstraction has 2154 states and 7487 transitions. [2019-11-28 12:30:06,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 12:30:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 7487 transitions. [2019-11-28 12:30:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 12:30:06,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:06,309 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] [2019-11-28 12:30:06,309 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:06,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1742211423, now seen corresponding path program 1 times [2019-11-28 12:30:06,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:06,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721803626] [2019-11-28 12:30:06,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:06,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721803626] [2019-11-28 12:30:06,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:06,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 12:30:06,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519644078] [2019-11-28 12:30:06,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 12:30:06,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:06,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 12:30:06,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 12:30:06,442 INFO L87 Difference]: Start difference. First operand 2154 states and 7487 transitions. Second operand 9 states. [2019-11-28 12:30:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:06,911 INFO L93 Difference]: Finished difference Result 3002 states and 10436 transitions. [2019-11-28 12:30:06,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:30:06,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-28 12:30:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:06,918 INFO L225 Difference]: With dead ends: 3002 [2019-11-28 12:30:06,918 INFO L226 Difference]: Without dead ends: 2978 [2019-11-28 12:30:06,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-28 12:30:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-11-28 12:30:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2153. [2019-11-28 12:30:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2153 states. [2019-11-28 12:30:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 7486 transitions. [2019-11-28 12:30:06,953 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 7486 transitions. Word has length 24 [2019-11-28 12:30:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:06,953 INFO L462 AbstractCegarLoop]: Abstraction has 2153 states and 7486 transitions. [2019-11-28 12:30:06,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 12:30:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 7486 transitions. [2019-11-28 12:30:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 12:30:06,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:06,955 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] [2019-11-28 12:30:06,955 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:06,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:06,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1800981697, now seen corresponding path program 2 times [2019-11-28 12:30:06,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:06,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804270297] [2019-11-28 12:30:06,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:07,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804270297] [2019-11-28 12:30:07,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:07,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 12:30:07,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102888403] [2019-11-28 12:30:07,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:30:07,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:07,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:30:07,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:30:07,181 INFO L87 Difference]: Start difference. First operand 2153 states and 7486 transitions. Second operand 10 states. [2019-11-28 12:30:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:08,164 INFO L93 Difference]: Finished difference Result 3010 states and 10450 transitions. [2019-11-28 12:30:08,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 12:30:08,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-28 12:30:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:08,171 INFO L225 Difference]: With dead ends: 3010 [2019-11-28 12:30:08,171 INFO L226 Difference]: Without dead ends: 2986 [2019-11-28 12:30:08,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-11-28 12:30:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-11-28 12:30:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2156. [2019-11-28 12:30:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-11-28 12:30:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 7493 transitions. [2019-11-28 12:30:08,205 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 7493 transitions. Word has length 24 [2019-11-28 12:30:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:08,205 INFO L462 AbstractCegarLoop]: Abstraction has 2156 states and 7493 transitions. [2019-11-28 12:30:08,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:30:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 7493 transitions. [2019-11-28 12:30:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 12:30:08,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:08,207 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] [2019-11-28 12:30:08,208 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:08,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:08,208 INFO L82 PathProgramCache]: Analyzing trace with hash 652694931, now seen corresponding path program 3 times [2019-11-28 12:30:08,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:08,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97284927] [2019-11-28 12:30:08,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:08,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97284927] [2019-11-28 12:30:08,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:08,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 12:30:08,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549942811] [2019-11-28 12:30:08,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 12:30:08,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:08,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 12:30:08,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:30:08,389 INFO L87 Difference]: Start difference. First operand 2156 states and 7493 transitions. Second operand 11 states. [2019-11-28 12:30:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:08,855 INFO L93 Difference]: Finished difference Result 3595 states and 12600 transitions. [2019-11-28 12:30:08,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 12:30:08,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-28 12:30:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:08,865 INFO L225 Difference]: With dead ends: 3595 [2019-11-28 12:30:08,865 INFO L226 Difference]: Without dead ends: 3571 [2019-11-28 12:30:08,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-11-28 12:30:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2019-11-28 12:30:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2134. [2019-11-28 12:30:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2019-11-28 12:30:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 7443 transitions. [2019-11-28 12:30:08,918 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 7443 transitions. Word has length 24 [2019-11-28 12:30:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:08,918 INFO L462 AbstractCegarLoop]: Abstraction has 2134 states and 7443 transitions. [2019-11-28 12:30:08,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 12:30:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 7443 transitions. [2019-11-28 12:30:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 12:30:08,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:08,922 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] [2019-11-28 12:30:08,922 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:08,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:08,923 INFO L82 PathProgramCache]: Analyzing trace with hash 351528874, now seen corresponding path program 2 times [2019-11-28 12:30:08,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:08,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709337176] [2019-11-28 12:30:08,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:09,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709337176] [2019-11-28 12:30:09,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:09,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 12:30:09,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910173193] [2019-11-28 12:30:09,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 12:30:09,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:09,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 12:30:09,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:30:09,033 INFO L87 Difference]: Start difference. First operand 2134 states and 7443 transitions. Second operand 8 states. [2019-11-28 12:30:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:09,469 INFO L93 Difference]: Finished difference Result 2628 states and 8874 transitions. [2019-11-28 12:30:09,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 12:30:09,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-28 12:30:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:09,476 INFO L225 Difference]: With dead ends: 2628 [2019-11-28 12:30:09,476 INFO L226 Difference]: Without dead ends: 2564 [2019-11-28 12:30:09,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-28 12:30:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2019-11-28 12:30:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2131. [2019-11-28 12:30:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-28 12:30:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 7438 transitions. [2019-11-28 12:30:09,506 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 7438 transitions. Word has length 24 [2019-11-28 12:30:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:09,506 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 7438 transitions. [2019-11-28 12:30:09,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 12:30:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 7438 transitions. [2019-11-28 12:30:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 12:30:09,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:09,508 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] [2019-11-28 12:30:09,508 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:09,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:09,509 INFO L82 PathProgramCache]: Analyzing trace with hash -548948534, now seen corresponding path program 3 times [2019-11-28 12:30:09,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:09,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367550470] [2019-11-28 12:30:09,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:09,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367550470] [2019-11-28 12:30:09,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:09,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 12:30:09,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660145825] [2019-11-28 12:30:09,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 12:30:09,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:09,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 12:30:09,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 12:30:09,634 INFO L87 Difference]: Start difference. First operand 2131 states and 7438 transitions. Second operand 9 states. [2019-11-28 12:30:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:10,059 INFO L93 Difference]: Finished difference Result 2930 states and 9846 transitions. [2019-11-28 12:30:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 12:30:10,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-28 12:30:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:10,065 INFO L225 Difference]: With dead ends: 2930 [2019-11-28 12:30:10,066 INFO L226 Difference]: Without dead ends: 2866 [2019-11-28 12:30:10,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-11-28 12:30:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2019-11-28 12:30:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2125. [2019-11-28 12:30:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-11-28 12:30:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 7424 transitions. [2019-11-28 12:30:10,100 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 7424 transitions. Word has length 24 [2019-11-28 12:30:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:10,101 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 7424 transitions. [2019-11-28 12:30:10,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 12:30:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 7424 transitions. [2019-11-28 12:30:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 12:30:10,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:10,104 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] [2019-11-28 12:30:10,104 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:10,104 INFO L82 PathProgramCache]: Analyzing trace with hash -610918652, now seen corresponding path program 4 times [2019-11-28 12:30:10,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:10,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515569442] [2019-11-28 12:30:10,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:10,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515569442] [2019-11-28 12:30:10,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:10,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 12:30:10,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352601534] [2019-11-28 12:30:10,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 12:30:10,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:10,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 12:30:10,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:30:10,327 INFO L87 Difference]: Start difference. First operand 2125 states and 7424 transitions. Second operand 11 states. [2019-11-28 12:30:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:10,605 INFO L93 Difference]: Finished difference Result 2567 states and 8721 transitions. [2019-11-28 12:30:10,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:30:10,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-28 12:30:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:10,611 INFO L225 Difference]: With dead ends: 2567 [2019-11-28 12:30:10,611 INFO L226 Difference]: Without dead ends: 2503 [2019-11-28 12:30:10,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-11-28 12:30:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-11-28 12:30:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2125. [2019-11-28 12:30:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-11-28 12:30:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 7424 transitions. [2019-11-28 12:30:10,640 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 7424 transitions. Word has length 24 [2019-11-28 12:30:10,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:10,641 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 7424 transitions. [2019-11-28 12:30:10,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 12:30:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 7424 transitions. [2019-11-28 12:30:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 12:30:10,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:10,643 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] [2019-11-28 12:30:10,643 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:10,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:10,643 INFO L82 PathProgramCache]: Analyzing trace with hash -847503804, now seen corresponding path program 5 times [2019-11-28 12:30:10,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:10,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037312568] [2019-11-28 12:30:10,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:10,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037312568] [2019-11-28 12:30:10,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:10,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 12:30:10,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545506341] [2019-11-28 12:30:10,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 12:30:10,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:10,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 12:30:10,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-28 12:30:10,955 INFO L87 Difference]: Start difference. First operand 2125 states and 7424 transitions. Second operand 13 states. [2019-11-28 12:30:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:11,888 INFO L93 Difference]: Finished difference Result 3312 states and 11307 transitions. [2019-11-28 12:30:11,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 12:30:11,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-28 12:30:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:11,896 INFO L225 Difference]: With dead ends: 3312 [2019-11-28 12:30:11,897 INFO L226 Difference]: Without dead ends: 3184 [2019-11-28 12:30:11,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-11-28 12:30:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-11-28 12:30:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2185. [2019-11-28 12:30:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2019-11-28 12:30:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 7740 transitions. [2019-11-28 12:30:11,932 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 7740 transitions. Word has length 24 [2019-11-28 12:30:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:11,932 INFO L462 AbstractCegarLoop]: Abstraction has 2185 states and 7740 transitions. [2019-11-28 12:30:11,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 12:30:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 7740 transitions. [2019-11-28 12:30:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 12:30:11,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:11,935 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] [2019-11-28 12:30:11,935 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2037680112, now seen corresponding path program 6 times [2019-11-28 12:30:11,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:11,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067906112] [2019-11-28 12:30:11,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:12,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067906112] [2019-11-28 12:30:12,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:12,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 12:30:12,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507075203] [2019-11-28 12:30:12,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 12:30:12,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:12,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 12:30:12,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:30:12,150 INFO L87 Difference]: Start difference. First operand 2185 states and 7740 transitions. Second operand 11 states. [2019-11-28 12:30:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:12,507 INFO L93 Difference]: Finished difference Result 3092 states and 10338 transitions. [2019-11-28 12:30:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 12:30:12,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-28 12:30:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:12,514 INFO L225 Difference]: With dead ends: 3092 [2019-11-28 12:30:12,515 INFO L226 Difference]: Without dead ends: 3028 [2019-11-28 12:30:12,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-28 12:30:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2019-11-28 12:30:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2005. [2019-11-28 12:30:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-11-28 12:30:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 7054 transitions. [2019-11-28 12:30:12,545 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 7054 transitions. Word has length 24 [2019-11-28 12:30:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:12,546 INFO L462 AbstractCegarLoop]: Abstraction has 2005 states and 7054 transitions. [2019-11-28 12:30:12,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 12:30:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 7054 transitions. [2019-11-28 12:30:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 12:30:12,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:12,548 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-28 12:30:12,548 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash 128519362, now seen corresponding path program 1 times [2019-11-28 12:30:12,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:12,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990836078] [2019-11-28 12:30:12,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:12,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990836078] [2019-11-28 12:30:12,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:12,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 12:30:12,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329458829] [2019-11-28 12:30:12,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:30:12,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:12,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:30:12,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:30:12,849 INFO L87 Difference]: Start difference. First operand 2005 states and 7054 transitions. Second operand 12 states. [2019-11-28 12:30:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:13,566 INFO L93 Difference]: Finished difference Result 2627 states and 9048 transitions. [2019-11-28 12:30:13,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 12:30:13,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-11-28 12:30:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:13,572 INFO L225 Difference]: With dead ends: 2627 [2019-11-28 12:30:13,572 INFO L226 Difference]: Without dead ends: 2604 [2019-11-28 12:30:13,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-28 12:30:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2019-11-28 12:30:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1613. [2019-11-28 12:30:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2019-11-28 12:30:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2019-11-28 12:30:13,596 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 25 [2019-11-28 12:30:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:13,597 INFO L462 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2019-11-28 12:30:13,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:30:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2019-11-28 12:30:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 12:30:13,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:13,599 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] [2019-11-28 12:30:13,599 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1601368368, now seen corresponding path program 1 times [2019-11-28 12:30:13,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:13,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773237393] [2019-11-28 12:30:13,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:13,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773237393] [2019-11-28 12:30:13,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:13,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 12:30:13,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097532313] [2019-11-28 12:30:13,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:30:13,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:13,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:30:13,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:30:13,732 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 10 states. [2019-11-28 12:30:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:13,989 INFO L93 Difference]: Finished difference Result 2230 states and 7382 transitions. [2019-11-28 12:30:13,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:30:13,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-28 12:30:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:13,995 INFO L225 Difference]: With dead ends: 2230 [2019-11-28 12:30:13,995 INFO L226 Difference]: Without dead ends: 2208 [2019-11-28 12:30:13,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-11-28 12:30:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-11-28 12:30:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1612. [2019-11-28 12:30:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2019-11-28 12:30:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 5562 transitions. [2019-11-28 12:30:14,017 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 5562 transitions. Word has length 26 [2019-11-28 12:30:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:14,017 INFO L462 AbstractCegarLoop]: Abstraction has 1612 states and 5562 transitions. [2019-11-28 12:30:14,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:30:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 5562 transitions. [2019-11-28 12:30:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 12:30:14,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:14,019 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] [2019-11-28 12:30:14,019 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:14,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1793121520, now seen corresponding path program 2 times [2019-11-28 12:30:14,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:14,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314109084] [2019-11-28 12:30:14,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:14,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314109084] [2019-11-28 12:30:14,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:14,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 12:30:14,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152932814] [2019-11-28 12:30:14,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:30:14,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:14,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:30:14,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:30:14,191 INFO L87 Difference]: Start difference. First operand 1612 states and 5562 transitions. Second operand 10 states. [2019-11-28 12:30:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:15,158 INFO L93 Difference]: Finished difference Result 2230 states and 7379 transitions. [2019-11-28 12:30:15,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 12:30:15,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-28 12:30:15,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:15,165 INFO L225 Difference]: With dead ends: 2230 [2019-11-28 12:30:15,165 INFO L226 Difference]: Without dead ends: 2208 [2019-11-28 12:30:15,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-11-28 12:30:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-11-28 12:30:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1615. [2019-11-28 12:30:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-11-28 12:30:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 5569 transitions. [2019-11-28 12:30:15,204 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 5569 transitions. Word has length 26 [2019-11-28 12:30:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:15,204 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 5569 transitions. [2019-11-28 12:30:15,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:30:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 5569 transitions. [2019-11-28 12:30:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 12:30:15,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:15,209 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] [2019-11-28 12:30:15,209 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:15,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:15,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1731151402, now seen corresponding path program 3 times [2019-11-28 12:30:15,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:15,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446906239] [2019-11-28 12:30:15,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:15,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446906239] [2019-11-28 12:30:15,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:15,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 12:30:15,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681670689] [2019-11-28 12:30:15,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:30:15,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:15,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:30:15,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:30:15,450 INFO L87 Difference]: Start difference. First operand 1615 states and 5569 transitions. Second operand 12 states. [2019-11-28 12:30:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:15,854 INFO L93 Difference]: Finished difference Result 2246 states and 7479 transitions. [2019-11-28 12:30:15,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:30:15,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-28 12:30:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:15,859 INFO L225 Difference]: With dead ends: 2246 [2019-11-28 12:30:15,859 INFO L226 Difference]: Without dead ends: 2202 [2019-11-28 12:30:15,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-11-28 12:30:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2019-11-28 12:30:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1491. [2019-11-28 12:30:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-11-28 12:30:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 5039 transitions. [2019-11-28 12:30:15,881 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 5039 transitions. Word has length 26 [2019-11-28 12:30:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:15,881 INFO L462 AbstractCegarLoop]: Abstraction has 1491 states and 5039 transitions. [2019-11-28 12:30:15,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:30:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 5039 transitions. [2019-11-28 12:30:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 12:30:15,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:15,884 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] [2019-11-28 12:30:15,884 INFO L410 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:15,884 INFO L82 PathProgramCache]: Analyzing trace with hash 304389942, now seen corresponding path program 4 times [2019-11-28 12:30:15,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:15,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555798022] [2019-11-28 12:30:15,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:16,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555798022] [2019-11-28 12:30:16,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:16,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 12:30:16,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746567398] [2019-11-28 12:30:16,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:30:16,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:16,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:30:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:30:16,122 INFO L87 Difference]: Start difference. First operand 1491 states and 5039 transitions. Second operand 12 states. [2019-11-28 12:30:16,529 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-11-28 12:30:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:16,754 INFO L93 Difference]: Finished difference Result 1544 states and 5003 transitions. [2019-11-28 12:30:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:30:16,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-28 12:30:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:16,757 INFO L225 Difference]: With dead ends: 1544 [2019-11-28 12:30:16,758 INFO L226 Difference]: Without dead ends: 1500 [2019-11-28 12:30:16,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-11-28 12:30:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2019-11-28 12:30:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 885. [2019-11-28 12:30:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-11-28 12:30:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2019-11-28 12:30:16,771 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2019-11-28 12:30:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:16,772 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2019-11-28 12:30:16,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:30:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2019-11-28 12:30:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 12:30:16,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:16,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:30:16,774 INFO L410 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash -720297978, now seen corresponding path program 1 times [2019-11-28 12:30:16,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:16,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140706445] [2019-11-28 12:30:16,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:16,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140706445] [2019-11-28 12:30:16,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:16,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 12:30:16,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153693690] [2019-11-28 12:30:16,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 12:30:16,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:16,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 12:30:16,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:30:16,845 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2019-11-28 12:30:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:17,008 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2019-11-28 12:30:17,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:30:17,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-28 12:30:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:17,011 INFO L225 Difference]: With dead ends: 885 [2019-11-28 12:30:17,011 INFO L226 Difference]: Without dead ends: 879 [2019-11-28 12:30:17,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:30:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-11-28 12:30:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2019-11-28 12:30:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-11-28 12:30:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2019-11-28 12:30:17,022 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2019-11-28 12:30:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:17,022 INFO L462 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2019-11-28 12:30:17,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 12:30:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2019-11-28 12:30:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 12:30:17,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:17,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:30:17,024 INFO L410 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:17,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:17,024 INFO L82 PathProgramCache]: Analyzing trace with hash 525302158, now seen corresponding path program 1 times [2019-11-28 12:30:17,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:17,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284572509] [2019-11-28 12:30:17,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:30:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:30:17,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284572509] [2019-11-28 12:30:17,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:30:17,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 12:30:17,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587879827] [2019-11-28 12:30:17,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 12:30:17,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:30:17,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 12:30:17,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:30:17,129 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2019-11-28 12:30:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:30:17,290 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2019-11-28 12:30:17,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:30:17,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-28 12:30:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:30:17,292 INFO L225 Difference]: With dead ends: 879 [2019-11-28 12:30:17,292 INFO L226 Difference]: Without dead ends: 819 [2019-11-28 12:30:17,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:30:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-11-28 12:30:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2019-11-28 12:30:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-11-28 12:30:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2019-11-28 12:30:17,314 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2019-11-28 12:30:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:30:17,315 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2019-11-28 12:30:17,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 12:30:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2019-11-28 12:30:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 12:30:17,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:30:17,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:30:17,319 INFO L410 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-28 12:30:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:30:17,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1075124498, now seen corresponding path program 1 times [2019-11-28 12:30:17,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:30:17,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939929374] [2019-11-28 12:30:17,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:30:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 12:30:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 12:30:17,398 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 12:30:17,398 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 12:30:17,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [467] [467] ULTIMATE.startENTRY-->L1123: Formula: (let ((.cse0 (store |v_#valid_113| 0 0))) (and (= |v_#NULL.offset_4| 0) (= |v_#valid_111| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_24| 1)) (= |v_ULTIMATE.start_main_~#t~0.offset_20| 0) (= 0 |v_#NULL.base_4|) (= v_~v~0.offset_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_24|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_main_~#t~0.base_24| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~#t~0.base_24|) |v_ULTIMATE.start_main_~#t~0.offset_20| 5)) |v_#memory_int_119|) (< 0 |v_#StackHeapBarrier_22|) (= v_~v~0.base_45 0) (= (store |v_#length_40| |v_ULTIMATE.start_main_~#t~0.base_24| 4) |v_#length_39|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t~0.base_24|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_113|, #memory_int=|v_#memory_int_120|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_9|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_20|, ~v~0.base=v_~v~0.base_45, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~v~0.offset=v_~v~0.offset_45, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_13|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_24|, #length=|v_#length_39|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_25|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, #NULL.offset, ULTIMATE.start_main_~#t~0.offset, ~v~0.base, #NULL.base, ~v~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-11-28 12:30:17,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [464] [464] thread0ENTRY-->L1108: Formula: (let ((.cse1 (store |v_#valid_104| |v_thread0Thread1of1ForFork3_~#t1~0.base_16| 1))) (let ((.cse3 (store .cse1 |v_thread0Thread1of1ForFork3_~#t2~0.base_15| 1))) (let ((.cse2 (store .cse3 |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 1))) (let ((.cse0 (store .cse2 |v_thread0Thread1of1ForFork3_~#t4~0.base_15| 1))) (and (= 0 |v_thread0Thread1of1ForFork3_~#t1~0.offset_12|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t4~0.base_15|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t2~0.base_15|) (= 0 (select |v_#valid_104| |v_thread0Thread1of1ForFork3_~#t1~0.base_16|)) (= |v_thread0Thread1of1ForFork3_~#t5~0.offset_15| 0) (= (store .cse0 |v_thread0Thread1of1ForFork3_~#t5~0.base_19| 1) |v_#valid_102|) (= 0 |v_thread0Thread1of1ForFork3_~#t3~0.offset_13|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t3~0.base_16|) (= (select .cse1 |v_thread0Thread1of1ForFork3_~#t2~0.base_15|) 0) (not (= |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 0)) (= 0 (select .cse2 |v_thread0Thread1of1ForFork3_~#t4~0.base_15|)) (not (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.base_15|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t5~0.base_19|) (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.offset_12|) (= 0 (select .cse0 |v_thread0Thread1of1ForFork3_~#t5~0.base_19|)) (not (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.base_15|)) (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.offset_11|) (not (= |v_thread0Thread1of1ForFork3_~#t1~0.base_16| 0)) (= v_thread0Thread1of1ForFork3_~arg.base_4 |v_thread0Thread1of1ForFork3_#in~arg.base_6|) (= v_thread0Thread1of1ForFork3_~arg.offset_4 |v_thread0Thread1of1ForFork3_#in~arg.offset_6|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t5~0.base_19|)) (= 0 (select .cse3 |v_thread0Thread1of1ForFork3_~#t3~0.base_16|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t1~0.base_16|) (= |v_#memory_int_117| (store |v_#memory_int_118| |v_thread0Thread1of1ForFork3_~#t1~0.base_16| (store (select |v_#memory_int_118| |v_thread0Thread1of1ForFork3_~#t1~0.base_16|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_12| 0))) (= |v_#length_36| (store (store (store (store (store |v_#length_38| |v_thread0Thread1of1ForFork3_~#t1~0.base_16| 4) |v_thread0Thread1of1ForFork3_~#t2~0.base_15| 4) |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 4) |v_thread0Thread1of1ForFork3_~#t4~0.base_15| 4) |v_thread0Thread1of1ForFork3_~#t5~0.base_19| 4))))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, thread0Thread1of1ForFork3_#in~arg.offset=|v_thread0Thread1of1ForFork3_#in~arg.offset_6|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_118|, #length=|v_#length_38|, thread0Thread1of1ForFork3_#in~arg.base=|v_thread0Thread1of1ForFork3_#in~arg.base_6|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_16|, thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_12|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_11|, thread0Thread1of1ForFork3_#in~arg.offset=|v_thread0Thread1of1ForFork3_#in~arg.offset_6|, thread0Thread1of1ForFork3_#in~arg.base=|v_thread0Thread1of1ForFork3_#in~arg.base_6|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_15|, thread0Thread1of1ForFork3_~arg.base=v_thread0Thread1of1ForFork3_~arg.base_4, #StackHeapBarrier=|v_#StackHeapBarrier_21|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_13|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_16|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_117|, thread0Thread1of1ForFork3_~arg.offset=v_thread0Thread1of1ForFork3_~arg.offset_4, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_12|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_15|, #length=|v_#length_36|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_19|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_15|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_~#t3~0.base, thread0Thread1of1ForFork3_~#t4~0.offset, thread0Thread1of1ForFork3_~#t2~0.offset, thread0Thread1of1ForFork3_~#t4~0.base, thread0Thread1of1ForFork3_~arg.base, thread0Thread1of1ForFork3_~#t3~0.offset, thread0Thread1of1ForFork3_~#t1~0.base, #valid, #memory_int, thread0Thread1of1ForFork3_~arg.offset, thread0Thread1of1ForFork3_~#t1~0.offset, thread0Thread1of1ForFork3_~#t2~0.base, #length, thread0Thread1of1ForFork3_~#t5~0.base, thread0Thread1of1ForFork3_~#t5~0.offset] because there is no mapped edge [2019-11-28 12:30:17,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [424] [424] L1108-1-->L1109-1: Formula: (= (select (select |v_#memory_int_48| |v_thread0Thread1of1ForFork3_~#t1~0.base_8|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_7|) |v_thread0Thread1of1ForFork3_#t~mem4_25|) InVars {thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_8|, #memory_int=|v_#memory_int_48|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_7|} OutVars{thread0Thread1of1ForFork3_#t~mem4=|v_thread0Thread1of1ForFork3_#t~mem4_25|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_8|, #memory_int=|v_#memory_int_48|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_7|, thread0Thread1of1ForFork3_#t~nondet3=|v_thread0Thread1of1ForFork3_#t~nondet3_2|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_#t~mem4, thread0Thread1of1ForFork3_#t~nondet3] because there is no mapped edge [2019-11-28 12:30:17,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [428] [428] L1123-1-->L1124-1: Formula: (= |v_ULTIMATE.start_main_#t~mem14_31| (select (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t~0.base_14|) |v_ULTIMATE.start_main_~#t~0.offset_14|)) InVars {#memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_14|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_14|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-11-28 12:30:17,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [462] [462] thread1ENTRY-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_5| 0)) (< |v_thread1Thread1of1ForFork4_#t~malloc2.base_5| |v_#StackHeapBarrier_20|) (= |v_#length_34| (store |v_#length_35| |v_thread1Thread1of1ForFork4_#t~malloc2.base_5| 1)) (= 0 (select |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_5|)) (= |v_thread1Thread1of1ForFork4_#t~malloc2.offset_5| 0) (= |v_#valid_98| (store |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_5| 1)) (= v_thread1Thread1of1ForFork4_~arg.offset_3 |v_thread1Thread1of1ForFork4_#in~arg.offset_7|) (= v_~v~0.offset_44 |v_thread1Thread1of1ForFork4_#t~malloc2.offset_5|) (= v_thread1Thread1of1ForFork4_~arg.base_3 |v_thread1Thread1of1ForFork4_#in~arg.base_7|) (= 0 |v_thread1Thread1of1ForFork4_#res.base_3|) (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_5| v_~v~0.base_44) (= 0 |v_thread1Thread1of1ForFork4_#res.offset_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_99|, thread1Thread1of1ForFork4_#in~arg.base=|v_thread1Thread1of1ForFork4_#in~arg.base_7|, #length=|v_#length_35|, thread1Thread1of1ForFork4_#in~arg.offset=|v_thread1Thread1of1ForFork4_#in~arg.offset_7|} OutVars{thread1Thread1of1ForFork4_#res.base=|v_thread1Thread1of1ForFork4_#res.base_3|, thread1Thread1of1ForFork4_~arg.offset=v_thread1Thread1of1ForFork4_~arg.offset_3, thread1Thread1of1ForFork4_#t~malloc2.base=|v_thread1Thread1of1ForFork4_#t~malloc2.base_5|, thread1Thread1of1ForFork4_#in~arg.base=|v_thread1Thread1of1ForFork4_#in~arg.base_7|, ~v~0.base=v_~v~0.base_44, #StackHeapBarrier=|v_#StackHeapBarrier_20|, thread1Thread1of1ForFork4_~arg.base=v_thread1Thread1of1ForFork4_~arg.base_3, thread1Thread1of1ForFork4_#res.offset=|v_thread1Thread1of1ForFork4_#res.offset_3|, ~v~0.offset=v_~v~0.offset_44, #valid=|v_#valid_98|, #length=|v_#length_34|, thread1Thread1of1ForFork4_#t~malloc2.offset=|v_thread1Thread1of1ForFork4_#t~malloc2.offset_5|, thread1Thread1of1ForFork4_#in~arg.offset=|v_thread1Thread1of1ForFork4_#in~arg.offset_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_#res.base, thread1Thread1of1ForFork4_~arg.offset, thread1Thread1of1ForFork4_~arg.base, thread1Thread1of1ForFork4_#t~malloc2.base, thread1Thread1of1ForFork4_#res.offset, ~v~0.offset, #valid, #length, thread1Thread1of1ForFork4_#t~malloc2.offset, ~v~0.base] because there is no mapped edge [2019-11-28 12:30:17,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [443] [443] L1097-->thread2EXIT: Formula: (and (= (store |v_#memory_int_81| v_~v~0.base_25 (store (select |v_#memory_int_81| v_~v~0.base_25) v_~v~0.offset_25 88)) |v_#memory_int_80|) (= 0 |v_thread2Thread1of1ForFork5_#res.base_3|) (= |v_thread2Thread1of1ForFork5_#res.offset_3| 0)) InVars {~v~0.offset=v_~v~0.offset_25, #memory_int=|v_#memory_int_81|, ~v~0.base=v_~v~0.base_25} OutVars{~v~0.offset=v_~v~0.offset_25, #memory_int=|v_#memory_int_80|, thread2Thread1of1ForFork5_#res.base=|v_thread2Thread1of1ForFork5_#res.base_3|, thread2Thread1of1ForFork5_#res.offset=|v_thread2Thread1of1ForFork5_#res.offset_3|, ~v~0.base=v_~v~0.base_25} AuxVars[] AssignedVars[#memory_int, thread2Thread1of1ForFork5_#res.base, thread2Thread1of1ForFork5_#res.offset] because there is no mapped edge [2019-11-28 12:30:17,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [412] [412] L1110-2-->L1111-1: Formula: (= (store |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t3~0.base_9| (store (select |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t3~0.base_9|) |v_thread0Thread1of1ForFork3_~#t3~0.offset_7| 2)) |v_#memory_int_36|) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_9|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_7|, #memory_int=|v_#memory_int_37|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_9|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_7|, #memory_int=|v_#memory_int_36|, thread0Thread1of1ForFork3_#t~nondet5=|v_thread0Thread1of1ForFork3_#t~nondet5_2|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet5] because there is no mapped edge [2019-11-28 12:30:17,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [417] [417] L1111-2-->L1112-1: Formula: (= (store |v_#memory_int_41| |v_thread0Thread1of1ForFork3_~#t4~0.base_8| (store (select |v_#memory_int_41| |v_thread0Thread1of1ForFork3_~#t4~0.base_8|) |v_thread0Thread1of1ForFork3_~#t4~0.offset_7| 3)) |v_#memory_int_40|) InVars {thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_7|, #memory_int=|v_#memory_int_41|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_8|} OutVars{thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_7|, #memory_int=|v_#memory_int_40|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_8|, thread0Thread1of1ForFork3_#t~nondet6=|v_thread0Thread1of1ForFork3_#t~nondet6_2|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet6] because there is no mapped edge [2019-11-28 12:30:17,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [411] [411] L1112-2-->L1113-1: Formula: (= (store |v_#memory_int_35| |v_thread0Thread1of1ForFork3_~#t5~0.base_8| (store (select |v_#memory_int_35| |v_thread0Thread1of1ForFork3_~#t5~0.base_8|) |v_thread0Thread1of1ForFork3_~#t5~0.offset_6| 4)) |v_#memory_int_34|) InVars {#memory_int=|v_#memory_int_35|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_8|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_6|} OutVars{#memory_int=|v_#memory_int_34|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_8|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_6|, thread0Thread1of1ForFork3_#t~nondet7=|v_thread0Thread1of1ForFork3_#t~nondet7_2|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet7] because there is no mapped edge [2019-11-28 12:30:17,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [435] [435] L1113-2-->L1114-1: Formula: (= (select (select |v_#memory_int_62| |v_thread0Thread1of1ForFork3_~#t2~0.base_8|) |v_thread0Thread1of1ForFork3_~#t2~0.offset_6|) |v_thread0Thread1of1ForFork3_#t~mem9_25|) InVars {thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_6|, #memory_int=|v_#memory_int_62|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_8|} OutVars{thread0Thread1of1ForFork3_#t~nondet8=|v_thread0Thread1of1ForFork3_#t~nondet8_2|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_6|, #memory_int=|v_#memory_int_62|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_8|, thread0Thread1of1ForFork3_#t~mem9=|v_thread0Thread1of1ForFork3_#t~mem9_25|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_#t~nondet8, thread0Thread1of1ForFork3_#t~mem9] because there is no mapped edge [2019-11-28 12:30:17,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_7| 0) (= (store |v_#memory_int_109| v_~v~0.base_37 (store (select |v_#memory_int_109| v_~v~0.base_37) v_~v~0.offset_37 88)) |v_#memory_int_108|) (= |v_thread2Thread1of1ForFork2_#res.base_7| 0)) InVars {~v~0.offset=v_~v~0.offset_37, #memory_int=|v_#memory_int_109|, ~v~0.base=v_~v~0.base_37} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_7|, ~v~0.offset=v_~v~0.offset_37, #memory_int=|v_#memory_int_108|, ~v~0.base=v_~v~0.base_37, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, #memory_int, thread2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 12:30:17,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [446] [446] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_9| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_9| 0) (= (store |v_#memory_int_89| v_~v~0.base_28 (store (select |v_#memory_int_89| v_~v~0.base_28) v_~v~0.offset_28 88)) |v_#memory_int_88|)) InVars {~v~0.offset=v_~v~0.offset_28, #memory_int=|v_#memory_int_89|, ~v~0.base=v_~v~0.base_28} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_9|, ~v~0.offset=v_~v~0.offset_28, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_9|, #memory_int=|v_#memory_int_88|, ~v~0.base=v_~v~0.base_28} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, #memory_int] because there is no mapped edge [2019-11-28 12:30:17,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [448] [448] L1102-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_3| 0) (= |v_#memory_int_96| (store |v_#memory_int_97| v_~v~0.base_32 (store (select |v_#memory_int_97| v_~v~0.base_32) v_~v~0.offset_32 89))) (= |v_thread3Thread1of1ForFork0_#res.offset_3| 0)) InVars {~v~0.offset=v_~v~0.offset_32, #memory_int=|v_#memory_int_97|, ~v~0.base=v_~v~0.base_32} OutVars{~v~0.offset=v_~v~0.offset_32, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_3|, #memory_int=|v_#memory_int_96|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_3|, ~v~0.base=v_~v~0.base_32} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 12:30:17,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [470] [470] L1118-->thread0EXIT: Formula: (and (= 0 |v_thread0Thread1of1ForFork3_#res.offset_2|) (= 0 |v_thread0Thread1of1ForFork3_#res.base_2|) (= (store (store (store (store (store |v_#valid_121| |v_thread0Thread1of1ForFork3_~#t1~0.base_20| 0) |v_thread0Thread1of1ForFork3_~#t2~0.base_19| 0) |v_thread0Thread1of1ForFork3_~#t3~0.base_20| 0) |v_thread0Thread1of1ForFork3_~#t4~0.base_19| 0) |v_thread0Thread1of1ForFork3_~#t5~0.base_23| 0) |v_#valid_120|)) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_20|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_20|, #valid=|v_#valid_121|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_19|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_23|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_19|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_19|, thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_14|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_13|, thread0Thread1of1ForFork3_#res.base=|v_thread0Thread1of1ForFork3_#res.base_2|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_18|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_15|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_19|, thread0Thread1of1ForFork3_#res.offset=|v_thread0Thread1of1ForFork3_#res.offset_2|, #valid=|v_#valid_120|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_18|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_14|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_22|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_17|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_~#t3~0.base, thread0Thread1of1ForFork3_~#t4~0.offset, thread0Thread1of1ForFork3_~#t2~0.offset, thread0Thread1of1ForFork3_#res.base, thread0Thread1of1ForFork3_~#t4~0.base, thread0Thread1of1ForFork3_~#t3~0.offset, thread0Thread1of1ForFork3_~#t1~0.base, thread0Thread1of1ForFork3_#res.offset, #valid, thread0Thread1of1ForFork3_~#t2~0.base, thread0Thread1of1ForFork3_~#t1~0.offset, thread0Thread1of1ForFork3_~#t5~0.base, thread0Thread1of1ForFork3_~#t5~0.offset] because there is no mapped edge [2019-11-28 12:30:17,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [457] [457] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_21| (select (select |v_#memory_int_115| v_~v~0.base_42) v_~v~0.offset_42)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (ite (= |v_ULTIMATE.start_main_#t~mem15_21| 88) 1 0)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_115|, ~v~0.base=v_~v~0.base_42} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_21|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 12:30:17,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:30:17 BasicIcfg [2019-11-28 12:30:17,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 12:30:17,498 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 12:30:17,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 12:30:17,498 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 12:30:17,499 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:29:36" (3/4) ... [2019-11-28 12:30:17,502 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 12:30:17,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [467] [467] ULTIMATE.startENTRY-->L1123: Formula: (let ((.cse0 (store |v_#valid_113| 0 0))) (and (= |v_#NULL.offset_4| 0) (= |v_#valid_111| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_24| 1)) (= |v_ULTIMATE.start_main_~#t~0.offset_20| 0) (= 0 |v_#NULL.base_4|) (= v_~v~0.offset_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_24|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_main_~#t~0.base_24| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~#t~0.base_24|) |v_ULTIMATE.start_main_~#t~0.offset_20| 5)) |v_#memory_int_119|) (< 0 |v_#StackHeapBarrier_22|) (= v_~v~0.base_45 0) (= (store |v_#length_40| |v_ULTIMATE.start_main_~#t~0.base_24| 4) |v_#length_39|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t~0.base_24|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_113|, #memory_int=|v_#memory_int_120|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_9|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_20|, ~v~0.base=v_~v~0.base_45, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~v~0.offset=v_~v~0.offset_45, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_13|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_24|, #length=|v_#length_39|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_25|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, #NULL.offset, ULTIMATE.start_main_~#t~0.offset, ~v~0.base, #NULL.base, ~v~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-11-28 12:30:17,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [464] [464] thread0ENTRY-->L1108: Formula: (let ((.cse1 (store |v_#valid_104| |v_thread0Thread1of1ForFork3_~#t1~0.base_16| 1))) (let ((.cse3 (store .cse1 |v_thread0Thread1of1ForFork3_~#t2~0.base_15| 1))) (let ((.cse2 (store .cse3 |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 1))) (let ((.cse0 (store .cse2 |v_thread0Thread1of1ForFork3_~#t4~0.base_15| 1))) (and (= 0 |v_thread0Thread1of1ForFork3_~#t1~0.offset_12|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t4~0.base_15|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t2~0.base_15|) (= 0 (select |v_#valid_104| |v_thread0Thread1of1ForFork3_~#t1~0.base_16|)) (= |v_thread0Thread1of1ForFork3_~#t5~0.offset_15| 0) (= (store .cse0 |v_thread0Thread1of1ForFork3_~#t5~0.base_19| 1) |v_#valid_102|) (= 0 |v_thread0Thread1of1ForFork3_~#t3~0.offset_13|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t3~0.base_16|) (= (select .cse1 |v_thread0Thread1of1ForFork3_~#t2~0.base_15|) 0) (not (= |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 0)) (= 0 (select .cse2 |v_thread0Thread1of1ForFork3_~#t4~0.base_15|)) (not (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.base_15|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t5~0.base_19|) (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.offset_12|) (= 0 (select .cse0 |v_thread0Thread1of1ForFork3_~#t5~0.base_19|)) (not (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.base_15|)) (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.offset_11|) (not (= |v_thread0Thread1of1ForFork3_~#t1~0.base_16| 0)) (= v_thread0Thread1of1ForFork3_~arg.base_4 |v_thread0Thread1of1ForFork3_#in~arg.base_6|) (= v_thread0Thread1of1ForFork3_~arg.offset_4 |v_thread0Thread1of1ForFork3_#in~arg.offset_6|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t5~0.base_19|)) (= 0 (select .cse3 |v_thread0Thread1of1ForFork3_~#t3~0.base_16|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t1~0.base_16|) (= |v_#memory_int_117| (store |v_#memory_int_118| |v_thread0Thread1of1ForFork3_~#t1~0.base_16| (store (select |v_#memory_int_118| |v_thread0Thread1of1ForFork3_~#t1~0.base_16|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_12| 0))) (= |v_#length_36| (store (store (store (store (store |v_#length_38| |v_thread0Thread1of1ForFork3_~#t1~0.base_16| 4) |v_thread0Thread1of1ForFork3_~#t2~0.base_15| 4) |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 4) |v_thread0Thread1of1ForFork3_~#t4~0.base_15| 4) |v_thread0Thread1of1ForFork3_~#t5~0.base_19| 4))))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, thread0Thread1of1ForFork3_#in~arg.offset=|v_thread0Thread1of1ForFork3_#in~arg.offset_6|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_118|, #length=|v_#length_38|, thread0Thread1of1ForFork3_#in~arg.base=|v_thread0Thread1of1ForFork3_#in~arg.base_6|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_16|, thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_12|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_11|, thread0Thread1of1ForFork3_#in~arg.offset=|v_thread0Thread1of1ForFork3_#in~arg.offset_6|, thread0Thread1of1ForFork3_#in~arg.base=|v_thread0Thread1of1ForFork3_#in~arg.base_6|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_15|, thread0Thread1of1ForFork3_~arg.base=v_thread0Thread1of1ForFork3_~arg.base_4, #StackHeapBarrier=|v_#StackHeapBarrier_21|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_13|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_16|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_117|, thread0Thread1of1ForFork3_~arg.offset=v_thread0Thread1of1ForFork3_~arg.offset_4, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_12|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_15|, #length=|v_#length_36|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_19|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_15|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_~#t3~0.base, thread0Thread1of1ForFork3_~#t4~0.offset, thread0Thread1of1ForFork3_~#t2~0.offset, thread0Thread1of1ForFork3_~#t4~0.base, thread0Thread1of1ForFork3_~arg.base, thread0Thread1of1ForFork3_~#t3~0.offset, thread0Thread1of1ForFork3_~#t1~0.base, #valid, #memory_int, thread0Thread1of1ForFork3_~arg.offset, thread0Thread1of1ForFork3_~#t1~0.offset, thread0Thread1of1ForFork3_~#t2~0.base, #length, thread0Thread1of1ForFork3_~#t5~0.base, thread0Thread1of1ForFork3_~#t5~0.offset] because there is no mapped edge [2019-11-28 12:30:17,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [424] [424] L1108-1-->L1109-1: Formula: (= (select (select |v_#memory_int_48| |v_thread0Thread1of1ForFork3_~#t1~0.base_8|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_7|) |v_thread0Thread1of1ForFork3_#t~mem4_25|) InVars {thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_8|, #memory_int=|v_#memory_int_48|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_7|} OutVars{thread0Thread1of1ForFork3_#t~mem4=|v_thread0Thread1of1ForFork3_#t~mem4_25|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_8|, #memory_int=|v_#memory_int_48|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_7|, thread0Thread1of1ForFork3_#t~nondet3=|v_thread0Thread1of1ForFork3_#t~nondet3_2|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_#t~mem4, thread0Thread1of1ForFork3_#t~nondet3] because there is no mapped edge [2019-11-28 12:30:17,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [428] [428] L1123-1-->L1124-1: Formula: (= |v_ULTIMATE.start_main_#t~mem14_31| (select (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t~0.base_14|) |v_ULTIMATE.start_main_~#t~0.offset_14|)) InVars {#memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_14|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_14|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-11-28 12:30:17,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [462] [462] thread1ENTRY-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_5| 0)) (< |v_thread1Thread1of1ForFork4_#t~malloc2.base_5| |v_#StackHeapBarrier_20|) (= |v_#length_34| (store |v_#length_35| |v_thread1Thread1of1ForFork4_#t~malloc2.base_5| 1)) (= 0 (select |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_5|)) (= |v_thread1Thread1of1ForFork4_#t~malloc2.offset_5| 0) (= |v_#valid_98| (store |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_5| 1)) (= v_thread1Thread1of1ForFork4_~arg.offset_3 |v_thread1Thread1of1ForFork4_#in~arg.offset_7|) (= v_~v~0.offset_44 |v_thread1Thread1of1ForFork4_#t~malloc2.offset_5|) (= v_thread1Thread1of1ForFork4_~arg.base_3 |v_thread1Thread1of1ForFork4_#in~arg.base_7|) (= 0 |v_thread1Thread1of1ForFork4_#res.base_3|) (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_5| v_~v~0.base_44) (= 0 |v_thread1Thread1of1ForFork4_#res.offset_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_99|, thread1Thread1of1ForFork4_#in~arg.base=|v_thread1Thread1of1ForFork4_#in~arg.base_7|, #length=|v_#length_35|, thread1Thread1of1ForFork4_#in~arg.offset=|v_thread1Thread1of1ForFork4_#in~arg.offset_7|} OutVars{thread1Thread1of1ForFork4_#res.base=|v_thread1Thread1of1ForFork4_#res.base_3|, thread1Thread1of1ForFork4_~arg.offset=v_thread1Thread1of1ForFork4_~arg.offset_3, thread1Thread1of1ForFork4_#t~malloc2.base=|v_thread1Thread1of1ForFork4_#t~malloc2.base_5|, thread1Thread1of1ForFork4_#in~arg.base=|v_thread1Thread1of1ForFork4_#in~arg.base_7|, ~v~0.base=v_~v~0.base_44, #StackHeapBarrier=|v_#StackHeapBarrier_20|, thread1Thread1of1ForFork4_~arg.base=v_thread1Thread1of1ForFork4_~arg.base_3, thread1Thread1of1ForFork4_#res.offset=|v_thread1Thread1of1ForFork4_#res.offset_3|, ~v~0.offset=v_~v~0.offset_44, #valid=|v_#valid_98|, #length=|v_#length_34|, thread1Thread1of1ForFork4_#t~malloc2.offset=|v_thread1Thread1of1ForFork4_#t~malloc2.offset_5|, thread1Thread1of1ForFork4_#in~arg.offset=|v_thread1Thread1of1ForFork4_#in~arg.offset_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_#res.base, thread1Thread1of1ForFork4_~arg.offset, thread1Thread1of1ForFork4_~arg.base, thread1Thread1of1ForFork4_#t~malloc2.base, thread1Thread1of1ForFork4_#res.offset, ~v~0.offset, #valid, #length, thread1Thread1of1ForFork4_#t~malloc2.offset, ~v~0.base] because there is no mapped edge [2019-11-28 12:30:17,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [443] [443] L1097-->thread2EXIT: Formula: (and (= (store |v_#memory_int_81| v_~v~0.base_25 (store (select |v_#memory_int_81| v_~v~0.base_25) v_~v~0.offset_25 88)) |v_#memory_int_80|) (= 0 |v_thread2Thread1of1ForFork5_#res.base_3|) (= |v_thread2Thread1of1ForFork5_#res.offset_3| 0)) InVars {~v~0.offset=v_~v~0.offset_25, #memory_int=|v_#memory_int_81|, ~v~0.base=v_~v~0.base_25} OutVars{~v~0.offset=v_~v~0.offset_25, #memory_int=|v_#memory_int_80|, thread2Thread1of1ForFork5_#res.base=|v_thread2Thread1of1ForFork5_#res.base_3|, thread2Thread1of1ForFork5_#res.offset=|v_thread2Thread1of1ForFork5_#res.offset_3|, ~v~0.base=v_~v~0.base_25} AuxVars[] AssignedVars[#memory_int, thread2Thread1of1ForFork5_#res.base, thread2Thread1of1ForFork5_#res.offset] because there is no mapped edge [2019-11-28 12:30:17,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [412] [412] L1110-2-->L1111-1: Formula: (= (store |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t3~0.base_9| (store (select |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t3~0.base_9|) |v_thread0Thread1of1ForFork3_~#t3~0.offset_7| 2)) |v_#memory_int_36|) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_9|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_7|, #memory_int=|v_#memory_int_37|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_9|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_7|, #memory_int=|v_#memory_int_36|, thread0Thread1of1ForFork3_#t~nondet5=|v_thread0Thread1of1ForFork3_#t~nondet5_2|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet5] because there is no mapped edge [2019-11-28 12:30:17,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [417] [417] L1111-2-->L1112-1: Formula: (= (store |v_#memory_int_41| |v_thread0Thread1of1ForFork3_~#t4~0.base_8| (store (select |v_#memory_int_41| |v_thread0Thread1of1ForFork3_~#t4~0.base_8|) |v_thread0Thread1of1ForFork3_~#t4~0.offset_7| 3)) |v_#memory_int_40|) InVars {thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_7|, #memory_int=|v_#memory_int_41|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_8|} OutVars{thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_7|, #memory_int=|v_#memory_int_40|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_8|, thread0Thread1of1ForFork3_#t~nondet6=|v_thread0Thread1of1ForFork3_#t~nondet6_2|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet6] because there is no mapped edge [2019-11-28 12:30:17,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [411] [411] L1112-2-->L1113-1: Formula: (= (store |v_#memory_int_35| |v_thread0Thread1of1ForFork3_~#t5~0.base_8| (store (select |v_#memory_int_35| |v_thread0Thread1of1ForFork3_~#t5~0.base_8|) |v_thread0Thread1of1ForFork3_~#t5~0.offset_6| 4)) |v_#memory_int_34|) InVars {#memory_int=|v_#memory_int_35|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_8|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_6|} OutVars{#memory_int=|v_#memory_int_34|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_8|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_6|, thread0Thread1of1ForFork3_#t~nondet7=|v_thread0Thread1of1ForFork3_#t~nondet7_2|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet7] because there is no mapped edge [2019-11-28 12:30:17,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [435] [435] L1113-2-->L1114-1: Formula: (= (select (select |v_#memory_int_62| |v_thread0Thread1of1ForFork3_~#t2~0.base_8|) |v_thread0Thread1of1ForFork3_~#t2~0.offset_6|) |v_thread0Thread1of1ForFork3_#t~mem9_25|) InVars {thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_6|, #memory_int=|v_#memory_int_62|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_8|} OutVars{thread0Thread1of1ForFork3_#t~nondet8=|v_thread0Thread1of1ForFork3_#t~nondet8_2|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_6|, #memory_int=|v_#memory_int_62|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_8|, thread0Thread1of1ForFork3_#t~mem9=|v_thread0Thread1of1ForFork3_#t~mem9_25|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_#t~nondet8, thread0Thread1of1ForFork3_#t~mem9] because there is no mapped edge [2019-11-28 12:30:17,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_7| 0) (= (store |v_#memory_int_109| v_~v~0.base_37 (store (select |v_#memory_int_109| v_~v~0.base_37) v_~v~0.offset_37 88)) |v_#memory_int_108|) (= |v_thread2Thread1of1ForFork2_#res.base_7| 0)) InVars {~v~0.offset=v_~v~0.offset_37, #memory_int=|v_#memory_int_109|, ~v~0.base=v_~v~0.base_37} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_7|, ~v~0.offset=v_~v~0.offset_37, #memory_int=|v_#memory_int_108|, ~v~0.base=v_~v~0.base_37, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, #memory_int, thread2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 12:30:17,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [446] [446] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_9| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_9| 0) (= (store |v_#memory_int_89| v_~v~0.base_28 (store (select |v_#memory_int_89| v_~v~0.base_28) v_~v~0.offset_28 88)) |v_#memory_int_88|)) InVars {~v~0.offset=v_~v~0.offset_28, #memory_int=|v_#memory_int_89|, ~v~0.base=v_~v~0.base_28} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_9|, ~v~0.offset=v_~v~0.offset_28, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_9|, #memory_int=|v_#memory_int_88|, ~v~0.base=v_~v~0.base_28} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, #memory_int] because there is no mapped edge [2019-11-28 12:30:17,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [448] [448] L1102-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_3| 0) (= |v_#memory_int_96| (store |v_#memory_int_97| v_~v~0.base_32 (store (select |v_#memory_int_97| v_~v~0.base_32) v_~v~0.offset_32 89))) (= |v_thread3Thread1of1ForFork0_#res.offset_3| 0)) InVars {~v~0.offset=v_~v~0.offset_32, #memory_int=|v_#memory_int_97|, ~v~0.base=v_~v~0.base_32} OutVars{~v~0.offset=v_~v~0.offset_32, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_3|, #memory_int=|v_#memory_int_96|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_3|, ~v~0.base=v_~v~0.base_32} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 12:30:17,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [470] [470] L1118-->thread0EXIT: Formula: (and (= 0 |v_thread0Thread1of1ForFork3_#res.offset_2|) (= 0 |v_thread0Thread1of1ForFork3_#res.base_2|) (= (store (store (store (store (store |v_#valid_121| |v_thread0Thread1of1ForFork3_~#t1~0.base_20| 0) |v_thread0Thread1of1ForFork3_~#t2~0.base_19| 0) |v_thread0Thread1of1ForFork3_~#t3~0.base_20| 0) |v_thread0Thread1of1ForFork3_~#t4~0.base_19| 0) |v_thread0Thread1of1ForFork3_~#t5~0.base_23| 0) |v_#valid_120|)) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_20|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_20|, #valid=|v_#valid_121|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_19|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_23|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_19|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_19|, thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_14|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_13|, thread0Thread1of1ForFork3_#res.base=|v_thread0Thread1of1ForFork3_#res.base_2|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_18|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_15|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_19|, thread0Thread1of1ForFork3_#res.offset=|v_thread0Thread1of1ForFork3_#res.offset_2|, #valid=|v_#valid_120|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_18|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_14|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_22|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_17|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_~#t3~0.base, thread0Thread1of1ForFork3_~#t4~0.offset, thread0Thread1of1ForFork3_~#t2~0.offset, thread0Thread1of1ForFork3_#res.base, thread0Thread1of1ForFork3_~#t4~0.base, thread0Thread1of1ForFork3_~#t3~0.offset, thread0Thread1of1ForFork3_~#t1~0.base, thread0Thread1of1ForFork3_#res.offset, #valid, thread0Thread1of1ForFork3_~#t2~0.base, thread0Thread1of1ForFork3_~#t1~0.offset, thread0Thread1of1ForFork3_~#t5~0.base, thread0Thread1of1ForFork3_~#t5~0.offset] because there is no mapped edge [2019-11-28 12:30:17,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [457] [457] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_21| (select (select |v_#memory_int_115| v_~v~0.base_42) v_~v~0.offset_42)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (ite (= |v_ULTIMATE.start_main_#t~mem15_21| 88) 1 0)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_115|, ~v~0.base=v_~v~0.base_42} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_21|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 12:30:17,596 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 12:30:17,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 12:30:17,597 INFO L168 Benchmark]: Toolchain (without parser) took 42906.28 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 955.0 MB in the beginning and 1.7 GB in the end (delta: -745.9 MB). Peak memory consumption was 456.9 MB. Max. memory is 11.5 GB. [2019-11-28 12:30:17,598 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 12:30:17,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 963.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -109.4 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-11-28 12:30:17,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.59 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 12:30:17,599 INFO L168 Benchmark]: Boogie Preprocessor took 41.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 12:30:17,599 INFO L168 Benchmark]: RCFGBuilder took 561.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-11-28 12:30:17,599 INFO L168 Benchmark]: TraceAbstraction took 41171.83 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -700.3 MB). Peak memory consumption was 367.6 MB. Max. memory is 11.5 GB. [2019-11-28 12:30:17,600 INFO L168 Benchmark]: Witness Printer took 98.69 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-28 12:30:17,602 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.25 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 963.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -109.4 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.59 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 561.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41171.83 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -700.3 MB). Peak memory consumption was 367.6 MB. Max. memory is 11.5 GB. * Witness Printer took 98.69 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.4s, 172 ProgramPointsBefore, 99 ProgramPointsAfterwards, 243 TransitionsBefore, 173 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 1461 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 10 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2242 CheckedPairsTotal, 74 TotalNumberOfCompositions - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={0:0}] [L1109] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1110] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1111] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1112] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1113] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1114] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1115] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1115] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1116] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1116] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1117] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1117] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={6:0}, t5={9:0}, v={1:0}] [L1124] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, v={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Result: UNSAFE, OverallTime: 40.7s, OverallIterations: 47, TraceHistogramMax: 1, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4903 SDtfs, 9208 SDslu, 16268 SDs, 0 SdLazy, 9710 SolverSat, 1377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 50 SyntacticMatches, 21 SemanticMatches, 583 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 16.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4305occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 46 MinimizatonAttempts, 44427 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 963 ConstructedInterpolants, 0 QuantifiedInterpolants, 368890 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...